What is it about?
On the surface of the earth, several targets have been identified beforehand and the problem to be solved is how to schedule a fleet of satellites in order to observe these targets during the time windows in which they are observable and maximize "quality" of the observations. In this paper, we present some highly efficient solution approaches to schedule this large fleet of satellites. Our approach, although not generating optimal solutions, generates the best solutions found so far for a set of difficult benchmark instances in short computation times.
Featured Image
Photo by NASA on Unsplash
Read the Original
This page is a summary of: Agile earth observation satellite scheduling: An orienteering problem with time-dependent profits and travel times, Computers & Operations Research, November 2019, Elsevier,
DOI: 10.1016/j.cor.2019.05.030.
You can read the full text:
Contributors
The following have contributed to this page
