Priority-based and conflict-avoidance heuristics for multi-satellite scheduling

• Verfasst von: Chen, Xiaoyu [VerfasserIn]
• Verfasst von: Reinelt, Gerhard [VerfasserIn]
• Titel: Priority-based and conflict-avoidance heuristics for multi-satellite scheduling
• Verf.angabe: Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Maocai Wang
• E-Jahr: 2018
• Jahr: [August 2018]
• Umfang: 5 S.
• Fussnoten: Gesehen am 18.04.2019
• Titel Quelle: Enthalten in: Applied soft computing
• Ort Quelle: Amsterdam [u.a.] : Elsevier Science, 2001
• Jahr Quelle: 2018
• Band/Heft Quelle: 69(2018), Seite 177-191
• ISSN Quelle: 1872-9681
• DOI: doi:10.1016/j.asoc.2018.04.021
• Datenträger: Online-Ressource
• Sprache: eng
• Sach-SW: Differential evolution
• Sach-SW: Earth observing satellites
• Sach-SW: Heuristic
• Sach-SW: Optimization
• Sach-SW: Scheduling
• K10plus-PPN: 1663450633

Abstract

In this paper we address the problem of multi-satellite scheduling with limited observing ability. As with other computationally hard combinatorial optimization problems, a two-stage heuristic method is developed to obtain high quality solutions in a reasonable amount of computation time. The first stage involves the determination of an observing sequence and the generation of a feasible scheduling scheme. We propose several priority-based and conflict-avoidance heuristic strategies and develop the time-based greedy approaches, the weight-based greedy approaches, and an improved differential evolution (DE) algorithm. The second stage consists of further improvement strategies under different resource contentions, thus improving the scheduling results further. Finally, we design different classes of instances to test the efficiency and applicability of the methods. Computational results reveal that the new proposed methods routinely delivered very close to optimal solutions.