A Memetic Algorithm for Single-orbit Image Scheduling of Agile Satellite

DOI

10.2991/iccsae-15.2016.62How to use a DOI?

Keywords

agile satellite, scheduling, memetic algorithm, local search

Abstract

This article analyzes the complex time constraints such as time window visibility and attitude transition time of the single-orbit image scheduling problem for agile satellite, establishes a constrained optimization model and proposes a memetic algorithm to tackle this NP-hard problem. In our algorithm, binary and permutation representation is combined to represent selecting and timetabling sub problem respectively, mixture of feasible and infeasible solutions are allowed to maintain population diversity, tabu search is introduced after crossover and mutation to improve local optimum. In the aspect of constraint handling, a repair method along with penalty function is developed. Experimental results show that this algorithm is a feasible approach for solving the above problem.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Dengyi Zhang
AU  - Lei Guo
PY  - 2016/02
DA  - 2016/02
TI  - A Memetic Algorithm for Single-orbit Image Scheduling of Agile Satellite
BT  - Proceedings of the 2015 5th International Conference on Computer Sciences and Automation Engineering
PB  - Atlantis Press
SP  - 325
EP  - 329
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccsae-15.2016.62
DO  - 10.2991/iccsae-15.2016.62
ID  - Zhang2016/02
ER  -