Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A hill climbing algorithm for ground station scheduling

Autor
Xhafa, F.; Herrero, J.; Barolli, A.; Takizawa, M.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
5th International Conference on Information Technology Convergence and Services and 3rd International Conference on Intelligent Robotics, Automations, Telecommunication Facilities, and Applications
Any de l'edició
2013
Data de presentació
2013-07
Llibre d'actes
Information technology convergence: security, robotics, automations and communication
Pàgina inicial
131
Pàgina final
139
DOI
10.1007/978-94-007-6996-0_14
URL
https://link.springer.com/chapter/10.1007/978-94-007-6996-0_14 Obrir en finestra nova
Resum
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 goo...
Paraules clau
Algorithms, Information technology, Multiobjective optimization, Robotics, Satellite ground stations, Satellites, Scheduling, Spacecraft, Telecommunication services
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

  • Xhafa Xhafa, Fatos  (autor ponent)
  • Herrero Bautista, Javier  (autor ponent)
  • Barolli, Admir  (autor ponent)
  • Takizawa, Makoto  (autor ponent)