A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
From MaRDI portal
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- On the tractability of satellite range scheduling
- An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
- Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches
- A constraint-based approach to satellite scheduling
- An introduction to optimal satellite range scheduling
- scientific article; zbMATH DE number 2221460
- Route-reduction-based dynamic programming for large-scale satellite range scheduling problem
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
Cites work
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A heuristic approach for antenna positioning in cellular networks
- A metaheuristic approach for the vertex coloring problem
- A solution method for a car fleet management problem with maintenance constraints
- A unified tabu search heuristic for vehicle routing problems with time windows
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- Computer Solutions of the Traveling Salesman Problem
- Consistent neighborhood search for combinatorial optimization
- Designing and reporting on computational experiments with heuristic methods
- Earth observation satellite management
- Efficient filtering and tabu search on a consistent neighbourhood for the frequency assignment problem with polarisation
- Graph colouring approaches for a satellite range scheduling problem
- Handbook of metaheuristics
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2065615 (Why is no real title available?)
- scientific article; zbMATH DE number 956854 (Why is no real title available?)
- Probabilistic diversification and intensification in local search for vehicle routing
- Scheduling space-ground communications for the air force satellite control network
- Strong formulation for the spot 5 daily photograph scheduling problem
- The dynamic frequency assignment problem
Cited in
(5)- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Consistent neighborhood search for combinatorial optimization
- Adaptive variable neighborhood search algorithm with Metropolis rule and tabu list for satellite range scheduling problem
This page was built for publication: A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5247673)
