A Comparison of Heuristic Methods for Scheduling Earth Observing Satellites Fleet

Author

Wang, Pei ; Tan, Yuejin ; Reinelt, Gerhard

Author_Institution

Group of Discrete & Combinatorial Optimization, Univ. of Heidelberg, Heidelberg, Germany

Volume

2

fYear

2009

fDate

25-26 July 2009

Firstpage

164

Lastpage

167

Abstract

This paper addressed the planning and scheduling problem for earth observing satellites fleet of China. The author first described the problem scope naturally, then proposed a mixed-integer programming model for a simplified version of the problem, which only considered the data-take activities of the satellites. Then the author gave two heuristic methods for it and made experimental comparisons based on some randomly generated problem instances. Computational Experiments showed that the special conflict-avoided heuristic enjoyed an optimality/computational-time ratio advantage against the other ILOG-based tabu search under a time-critical application background.

Keywords

aerospace computing; artificial satellites; integer programming; planning; scheduling; search problems; ILOG-based tabu search; computational-time ratio; earth observing satellites; mixed integer programming model; optimality time ratio; planning problem; scheduling problem; Computer science; Dynamic programming; Earth Observing System; Geoscience; Information technology; Instruments; Management information systems; Optimization methods; Processor scheduling; Satellites; Earth Observing Satellites Fleet; Heuristic; Mixed-Integer Programming; Planning and Scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Technology and Computer Science, 2009. ITCS 2009. International Conference on

Conference_Location

Kiev

Print_ISBN

978-0-7695-3688-0

Type

conf

DOI

10.1109/ITCS.2009.174

Filename

5190206