A two-phase genetic annealing method for integrated Earth observation satellite scheduling problems
- 224 Downloads
This paper investigates an integrated approach to Earth observation satellite scheduling (EOSS) and proposes a two-phase genetic annealing (TPGA) method to solve the scheduling problem. Standard EOSS requires the development of feasible imaging schedules for Earth observation satellites. However, integrated EOSS is more complicated, mainly because both imaging and data transmission operations are of equal concern. In this paper, we first establish a mixed integer linear programming model for the scheduling problem using a directed acyclic graph for determining candidate solution options. Then, we optimize the model by applying the TPGA method, which consists of two phases in which a genetic algorithm is first employed, followed by simulated annealing. Detailed designs of the algorithm integration and algorithm switching rules are provided based on reasonable deductions. Finally, simulation experiments are conducted to demonstrate the feasibility and optimality of the proposed TPGA method.
KeywordsEOS Integrated scheduling Two-phase solution method Genetic annealing method Automatic switching
The authors thank the editors and two anonymous referees for their constructive suggestions which have enabled the authors to significantly improve the paper. This study was funded by the National Natural Science Foundation of China under Grants 71521001, 71671059 and 71401048.
Compliance with ethical standards
Conflict of interest
The authors declare that there is no conflict of interests regarding the publication of this paper.
Human and animal rights
This article does not contain any studies with human participants performed by any of the authors. Informed consent was obtained from all individual participants included in the study.
- Abdelbar AM,&Hosny MI (2006) Finding most probable explanations using a self-adaptive hybridization of genetic algorithms and simulated annealing. In: Proceedings of the 10th WSEAS international conference on Computers. World Scientific and Engineering Academy and Society (WSEAS), pp 810–816Google Scholar
- Adler D (1993) Genetic algorithms and simulated annealing: a marriage proposal. In: Neural Networks, 1993., IEEE International Conference on, IEEE, pp 1104–1109Google Scholar
- Brown DE, Huntley CL,&Spillane AR (1989) A parallel genetic heuristic for the quadratic assignment problem. In: Proceedings of the 3rd international conference on genetic algorithms, Morgan Kaufmann Publishers Inc, pp 406–415Google Scholar
- Grefenstette JJ (1987) Incorporating problem-specific knowledge in genetic algorithms. In: Davis (ed) Genetic algorithms and simulated annealing. Pitman, London, pp 42–60Google Scholar
- Globus A, Crawford J, Lohn J, Pryor A (2004) A comparison of techniques for scheduling earth observing satellites. In: AAAI, pp 836–843Google Scholar
- Haynes W (2013) Student’s t-test. In: HaynesW (ed) Encyclopedia of systems biology. Springer, New York, pp 2023–2025Google Scholar
- O’Mahony M (1986) Sensory evaluation of food: statistical methods and procedures. CRC Press, Boca RatonGoogle Scholar
- Pelton JN, Madry S, Camacho-Lara S (2012) Handbook of satellite applications [M]. Springer Publishing Company, Incorporated, BerlinGoogle Scholar
- Peng G, Wen L, Feng Y, Baocun B, Jing Y (2011) Simulated annealing algorithm for EOS scheduling problem with task merging. In: Modelling, identification and control (ICMIC), proceedings of 2011 international conference on, IEEE, pp 547–552Google Scholar
- Tangpattanakul P, Jozefowiez N, Lopez P (2015a) Biased random key genetic algorithm for multi-user Earth observation scheduling. In: Fidanova S (ed) Recent advances in computational optimization, Springer International Publishing, pp 143–160Google Scholar
- Verfaillie G, Lemaître M, Schiex T(1996) Russian doll search for solving constraint optimization problems. In: AAAI/IAAI, vol. 1, pp 181–187Google Scholar
- Zhang C, Li P, Rao Y, Li S (2005) A new hybrid GA/SA algorithm for the job shop scheduling problem. In: Raidl GR, Gottlieb J (eds) Evolutionary computation in combinatorial optimization. EvoCOP 2005. Lecture notes in computer science, vol 3448. Springer, Berlin, Heidelberg, pp 246–259Google Scholar
- Zhang D, Guo L, Cai B, Sun N, Wang Q (2013) A hybrid discrete particle swarm optimization for satellite scheduling problem. In: Conference anthology, IEEE, IEEE, pp 1-5Google Scholar