Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches
From MaRDI portal
(Redirected from Publication:6080993)
Cites work
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
- 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
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
Cited in
(5)- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- scientific article; zbMATH DE number 7155759 (Why is no real title available?)
- A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
- Decentralized, decomposition-based observation scheduling for a large-scale satellite constellation
This page was built for publication: Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080993)