Loading...
Loading...

Go to the content (press return)

A hill climbing algorithm for ground station scheduling

Author
Xhafa, F.; Herrero, J.; Barolli, A.; Takizawa, M.
Type of activity
Presentation of work at congresses
Name of edition
5th International Conference on Information Technology Convergence and Services and 3rd International Conference on Intelligent Robotics, Automations, Telecommunication Facilities, and Applications
Date of publication
2013
Presentation's date
2013-07
Book of congress proceedings
Information technology convergence: security, robotics, automations and communication
First page
131
Last page
139
DOI
10.1007/978-94-007-6996-0_14
URL
https://link.springer.com/chapter/10.1007/978-94-007-6996-0_14 Open in new window
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 goo...
Keywords
Algorithms, Information technology, Multiobjective optimization, Robotics, Satellite ground stations, Satellites, Scheduling, Spacecraft, Telecommunication services
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

  • Xhafa Xhafa, Fatos  (author and speaker )
  • Herrero Bautista, Javier  (author and speaker )
  • Barolli, Admir  (author and speaker )
  • Takizawa, Makoto  (author and speaker )