An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
From MaRDI portal
Publication:2664286
Recommendations
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
- A branch and bound algorithm for agile earth observation satellite scheduling
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Scheduling for single agile satellite, redundant targets problem using complex networks theory
Cites work
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A column generation algorithm for the vehicle routing problem with soft time windows
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- A mixed integer linear programming model for multi-satellite scheduling
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Exact algorithms for electric vehicle-routing problems with time windows
- Maximizing the value of an Earth observation satellite orbit
- Multi satellites scheduling algorithm based on task merging mechanism
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Solving the orienteering problem with time windows via the pulse framework
- The maximum collection problem with time-dependent rewards
- Three scheduling algorithms applied to the Earth observing systems domain
Cited in
(12)- A branch and bound algorithm for agile earth observation satellite scheduling
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
- Distance preserving recombination operator for Earth observation satellites operations scheduling
- UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
- Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
- An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem
- Scheduling of Earth observing satellites using distributed constraint optimization
- Scheduling for single agile satellite, redundant targets problem using complex networks theory
This page was built for publication: An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664286)
