An Evolution Algorithm for Satellite Range Scheduling Problem with Priority Constraint

Article Preview

Abstract:

The satellite range scheduling problem is one of the most important problems in the field of the satellite operation. The purpose of this problem is finding the optimal feasible schedules, scheduling the communications between satellites and ground stations effectively, in another word. The problem is known for its high complexity and is an over-constrained problem. This paper present the resolution of the problem through a Station Coding Based Evolution Algorithm, particularly with the priority constraint, which adopting a new chromosome encoding method based on arranging the tasks in the ground station ID order. Computational results and analysis are presented for the case of the multi-ground stations scheduling.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

775-780

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Schalck, S. M., Automating satellite range scheduling. Masters Thesis. Air Force Institute of Technology, (1993).

Google Scholar

[2] Marinelli, F., Nocella, S., Rossi, F., & Smriglio, S. A Lagrangian heuristic for satellite range scheduling with resource constraints (Tech. rept. TRCS 004/2005). Dip. di Informatica, (2006).

DOI: 10.1016/j.cor.2011.01.016

Google Scholar

[3] Nicolas Zufferey, Patrick Amstutz, Philippe Giaccari. Graph colouring approaches for a satellite range scheduling problem. Journal of Scheduling. (2008)11: 263-277.

DOI: 10.1007/s10951-008-0066-8

Google Scholar

[4] Gooley, T. D. Automating the satellite range scheduling process. M. Phil. Thesis, Air Force Institute of Technology, USA. (1993).

Google Scholar

[5] Schlack, S. M. Automating satellite range scheduling. M. Phil. Thesis, Air Force Institute of Technology, USA. (1993).

Google Scholar

[6] Baptiste, P., L. Peridy, E. Pinson. A branch and bound to minimize the number of late jobs on a single machine with release time constraints, Europe Journal of Operation Research. 2003, 144(1): 1-11.

DOI: 10.1016/s0377-2217(01)00353-8

Google Scholar

[7] Bar-Noy, A., S. Guha, Joseph(Seffi) Naor, B. Schieber. Approximating the throughput of multiple machines in realtime scheduling. SIAM J. Comput., 2002, 31(2): 331-352.

DOI: 10.1137/s0097539799354138

Google Scholar

[8] Fatos Xhafaa, Junzi Sunb, Admir Barollic, Alexander Biberajd and Leonard Barollie. Genetic algorithms for satellite scheduling problems. Mobile Information Systems 8 (2012) 351–377.

Google Scholar

[9] Barbulescu, L., Watson, J. -P., Whitley, L. D., & Howe, A. E. Scheduling space-ground communications for the air force satellite control network. Journal of Scheduling, 2004, 7(1), 7–34.

DOI: 10.1023/b:josh.0000013053.32600.3c

Google Scholar