Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches

DOI10.1007/978-3-031-33271-5_29OpenAlexW4377249625MaRDI QIDQ6080993

Samuel Squillaci, Stéphanie Roussel, Cédric Pralet

Publication date: 4 October 2023

Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-33271-5_29

zbMATH Keywords

heuristic searchconstraint programminglarge neighborhood searchsatellites constellation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Cites Work

• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
• An effective large neighborhood search for the team orienteering problem with time windows
• A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
• Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times

This page was built for publication: Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches