An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
From MaRDI portal
Publication:1652375
DOI10.1016/j.cor.2017.04.006zbMath1391.90288OpenAlexW2605409691MaRDI QIDQ1652375
Xiaolu Liu, Gilbert Laporte, Ying-Wu Chen, Ren-Jie He
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.04.006
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (17)
Scheduling unrelated additive manufacturing machines with practical constraints ⋮ An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits ⋮ An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Learning to schedule heuristics for the simultaneous stochastic optimization of mining complexes ⋮ Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm ⋮ Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ A mixed integer linear programming model for multi-satellite scheduling ⋮ Energy-saving production scheduling in a single-machine manufacturing system by improved particle swarm optimization ⋮ A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem ⋮ Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times ⋮ An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Quantum bridge analytics. I: A tutorial on formulating and using QUBO models ⋮ Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
Cites Work
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- A general heuristic for vehicle routing problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- Maximizing the value of an Earth observation satellite orbit
This page was built for publication: An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
