Abstract
Ground Station Scheduling arises in satellite mission planning and belongs to scheduling family with time windows. It is know for its high computational complexity and hardness to solve to optimality. In fact, in some cases it is even hard to find a feasible solution that satisfies all user requirements and resource constraints. In this paper we present a Hill Climbing (HC) algorithm for the problem, which is a fast local search algorithm. Despite of being a simple search method, HC showed a good performance for small size instance while could not cope with medium and large size instances. The Satellite Toolkit is used for its experimental study and performance evaluation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Instances can be downloaded from http://www.lsi.upc.edu/~fatos/GSSchedulingInputs.zip.
References
Fischetti M, Martello S, Toth P (1992) Approximation algorithms for fixed schedule problems, Oper Res 40/1:96-S108
Jansen K (1994) An approximation algorithm for the license and shift class design problem. Eur J Oper Res 73:127–131
Kolen A, Lenstra JK, Papadimitriou C, Orlin J Interval scheduling problems, Manuscript, Center of Mathematics and Computer Science, C.W.I., Amsterdam
Kolen AWJ, Kroon LG (1993) On the computational complexity of (maximum) shift class scheduling. Eur J Oper Res 64:138–151
Pemberton JC, Greenwald L (2004) On the need for dynamic scheduling of imaging satellites. Proceedings of AAAI’04, pp 723–728
Vaghei BG, Moghadam RA, Bagheri A, Sarkheyli A (2010) Scheduling earth observation activities in LEO satellites using graph coloring problem. In 2010 5th international symposium on telecommunications (IST), 4–6 Dec 2010, pp 928–931
Harrison SA, Price ME, Philpott MS (1999) Task scheduling for satellite based imagery. In: The eighteenth workshop of the UK planning and scheduling, special interest group, University of Salford, UK
Barbulescu L, Howe A, Watson J, Whitley L (2002) Satellite range scheduling: a comparison of genetic, heuristic and local search. Parallel problem solving from Nature –PPSN, VII: 611–620
Sarkheyli A, Vaghei BG, Bagheri A (2010) New tabu search heuristic in scheduling earth observation satellites. In: Proceedings of 2nd international conference on software technology and engineering (ICSTE), pp V2-199–V2-203
Xhafa F, Barolli A, Takizawa M (2013) Steady state genetic algorithm for ground station scheduling problem. In: IEEE 27th international conference on advanced information networking and applications, AINA-2013, Spain, 25–28 Mar 2013, pp 153–160
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Xhafa, F., Herrero, X., Barolli, A., Takizawa, M. (2013). A Hill Climbing Algorithm for Ground Station Scheduling. In: Park, J., Barolli, L., Xhafa, F., Jeong, HY. (eds) Information Technology Convergence. Lecture Notes in Electrical Engineering, vol 253. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6996-0_14
Download citation
DOI: https://doi.org/10.1007/978-94-007-6996-0_14
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-6995-3
Online ISBN: 978-94-007-6996-0
eBook Packages: EngineeringEngineering (R0)