Optimization of telescope scheduling. Algorithmic research and scientific policy

Astronomy and Astrophysics – Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

3

Methods: Observational

Scientific paper

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 (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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Optimization of telescope scheduling. Algorithmic research and scientific policy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimization of telescope scheduling. Algorithmic research and scientific policy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization of telescope scheduling. Algorithmic research and scientific policy will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1366530

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.