An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits

DOI10.1016/J.COR.2020.104946MaRDI QIDQ2664286zbMATH OpenOpenAlexFDO

Authors Guansheng Peng, Guopeng Song, Lining Xing, Pieter Vansteenwegen, Aldy Gunawan

Publication date 20 April 2021

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://ink.library.smu.edu.sg/sis_research/5261

zbMATH Keywords

agile satellite schedulingdecremental state space relaxationdynamic programmingtime-dependent profits

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

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 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 Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• 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

(19)

• An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
• Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
• Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties
• UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• 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
• Distance preserving recombination operator for Earth observation satellites operations scheduling
• An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem
• A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
• Scheduling for single agile satellite, redundant targets problem using complex networks theory
• Scheduling of Earth observing satellites using distributed constraint optimization
• The integrated agile Earth observation satellite scheduling problem
• Nested branch-and-price for multi-mode nanosatellite task scheduling with interior-point regularization and GPU acceleration
• Branch-and-cut-and-price for agile Earth observation satellite scheduling
• Satellite scheduling problems: a survey of applications in Earth and outer space observation
• Multi-objective route planning of an unmanned air vehicle in continuous terrain: an exact and an approximation algorithm
• Three multi-objective memetic algorithms for observation scheduling problem of active-imaging agile earth observation satellites
• A Lagrangian relaxation-based heuristic algorithm for multiple agile Earth observation satellite scheduling with time-dependent constraint

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)