Advertisement

A Hill Climbing Algorithm for Ground Station Scheduling

  • Fatos Xhafa
  • Xavier Herrero
  • Admir Barolli
  • Makoto Takizawa
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 253)

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.

Keywords

Hill climbing Ground station scheduling Spacecrafts Multi-objective optimization Satellite toolkit 

References

  1. 1.
    Fischetti M, Martello S, Toth P (1992) Approximation algorithms for fixed schedule problems, Oper Res 40/1:96-S108Google Scholar
  2. 2.
    Jansen K (1994) An approximation algorithm for the license and shift class design problem. Eur J Oper Res 73:127–131CrossRefMATHGoogle Scholar
  3. 3.
    Kolen A, Lenstra JK, Papadimitriou C, Orlin J Interval scheduling problems, Manuscript, Center of Mathematics and Computer Science, C.W.I., Amsterdam Google Scholar
  4. 4.
    Kolen AWJ, Kroon LG (1993) On the computational complexity of (maximum) shift class scheduling. Eur J Oper Res 64:138–151CrossRefMATHGoogle Scholar
  5. 5.
    Pemberton JC, Greenwald L (2004) On the need for dynamic scheduling of imaging satellites. Proceedings of AAAI’04, pp 723–728Google Scholar
  6. 6.
    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–931Google Scholar
  7. 7.
    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, UKGoogle Scholar
  8. 8.
    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 Google Scholar
  9. 9.
    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 Google Scholar
  10. 10.
    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–160Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  • Fatos Xhafa
    • 1
  • Xavier Herrero
    • 1
  • Admir Barolli
    • 2
  • Makoto Takizawa
    • 3
  1. 1.Universitat Politècnica de CatalunyaBarcelonaSpain
  2. 2.Canadian Institute of TechnologyTiranaAlbania
  3. 3.Hosei UniversityTokyoJapan

Personalised recommendations