A mixed integer linear programming model for multi-satellite scheduling
From MaRDI portal
Abstract: We address the multi-satellite scheduling problem with limited observation capacities that arises from the need to observe a set of targets on the Earth's surface using imaging resources installed on a set of satellites. We define and analyze the conflict indicators of all available visible time windows of missions, as well as the feasible time intervals of resources. The problem is then formulated as a mixed integer linear programming model, in which constraints are derived from a careful analysis of the interdependency between feasible time intervals that are eligible for observations. We apply the proposed model to several different problem instances that reflect real-world situations. The computational results verify that our approach is effective for obtaining optimum solutions or solutions with a very good quality.
Recommendations
- Scheduling of a constellation of satellites: creating a mixed-integer linear model
- A constraint-based approach to satellite scheduling
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
- QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
- Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty
Cites work
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- Earth observation satellite management
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem
- Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project
- Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites
- High-performance technique for satellite range scheduling
- Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
- Maximizing the value of an Earth observation satellite orbit
- Multi satellites scheduling algorithm based on task merging mechanism
- Multi-agent scheduling on a single machine with max-form criteria
- Optimization-based scheduling for the single-satellite, multi-ground station communication problem
- Scheduling space-ground communications for the air force satellite control network
- Strengthened 0-1 linear formulation for the daily satellite mission planning
- Strong formulation for the spot 5 daily photograph scheduling problem
- Three scheduling algorithms applied to the Earth observing systems domain
- Upper bounds for the SPOT 5 daily photograph scheduling problem
Cited in
(26)- Double layer programming model to the scheduling of remote sensing data processing tasks
- Robust integrated planning for LEO satellite network design and service operations
- Scheduling satellite launch missions: an MILP approach
- An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
- Strengthened 0-1 linear formulation for the daily satellite mission planning
- Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
- A constraint-based approach to satellite scheduling
- Deep reinforcement learning-based resource allocation method for multi-satellite scheduling
- Satellite scheduling problems: a survey of applications in Earth and outer space observation
- Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits
- Multi-objective approaches to ground station scheduling for optimization of communication with satellites
- scientific article; zbMATH DE number 7155759 (Why is no real title available?)
- Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets
- Dynamic relay satellite scheduling based on ABC-TOPSIS algorithm
- Scheduling of a constellation of satellites: creating a mixed-integer linear model
- A branch-and-price algorithm for energy aware task scheduling of constellations of nanosatellites
- A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service
- A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites
- QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
- Nested branch-and-price for multi-mode nanosatellite task scheduling with interior-point regularization and GPU acceleration
- Time schedule optimization of satellites
- Large satellite constellations and space debris: exploratory analysis of strategic management of the space commons
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- Branch-and-cut-and-price for agile Earth observation satellite scheduling
- Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty
This page was built for publication: A mixed integer linear programming model for multi-satellite scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713768)
