Volume 403, Number 1, May III 2003
|Page(s)||357 - 367|
|Published online||29 April 2003|
Optimization of telescope scheduling
Algorithmic research and scientific policy
Instituto de Astronomía y Geodesia (CSIC-UCM), Universidad Complutense de Madrid, 28040 Madrid, Spain
2 Department of Statistics and Operations Research, Universidad Complutense de Madrid, 28040 Madrid, Spain e-mail: email@example.com
Corresponding author: A. I. Gómez de Castro, firstname.lastname@example.org
Accepted: 28 October 2002
The use of very expensive facilities in Modern Astronomy has demonstrated the importance of automatic modes in the operation of large telescopes. As a consequence, several mathematical tools have been applied and developed to solve the () scheduling optimization problem: from simple heuristics to the more complex genetic algorithms or neural networks. In this work, the basic scheduling problem is translated into mathematical language and two main methods are used to solve it: neighborhood search methods and genetic algorithms; both of them are analysed. It is shown that the algorithms are sensitive to the scientific policy by means of the definition of the objective function (F) and also by the assignment of scientific priorities to the projects. The definition of F is not trivial and requires a detailed discussion among the Astronomical Community.
Key words: methods: observational
© ESO, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.