Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/25916
Share/Export:
logo share SHARE logo core CORE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Title

Optimization of telescope scheduling: algorithmic research and scientific policy

AuthorsGómez de Castro, Ana Inés CSIC; Yáñez, Javier
KeywordsTelescope scheduling
Algorithmic research
Issue Date2003
PublisherEDP Sciences
CitationAstronomy and Astrophysics - Les Ulis, 403, p. 357-367 (2003)
AbstractThe 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 (NP − hard) 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.
Publisher version (URL)http://dx.doi.org/10.1051/0004-6361:20030319
URIhttp://hdl.handle.net/10261/25916
DOI10.1051/0004-6361:20030319
ISSN0004-6361
Appears in Collections:(IAG) Artículos

Files in This Item:
File Description SizeFormat
articulo24_2003.pdf123,65 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work

SCOPUSTM   
Citations

17
checked on May 11, 2022

WEB OF SCIENCETM
Citations

17
checked on May 14, 2022

Page view(s)

344
checked on May 18, 2022

Download(s)

331
checked on May 18, 2022

Google ScholarTM

Check

Altmetric

Dimensions


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.