Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite

DOI10.1007/s10589-008-9220-7zbMath1200.90075MaRDI QIDQ711387

Yannick Vimont, Michel Vasquez, Djamal Habet

Publication date: 26 October 2010

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-008-9220-7

zbMATH Keywords

dynamic programming; tabu search; consistent neighborhood

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems, 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, A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds, Scheduling for single agile satellite, redundant targets problem using complex networks theory, Consistent neighborhood search for combinatorial optimization, High-performance technique for satellite range scheduling, An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time, A mixed integer linear programming model for multi-satellite scheduling, A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem, Approximate path searching method for single-satellite observation and transmission task planning problem, Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times, QUEST -- a new quadratic decision model for the multi-satellite scheduling problem, A branch and bound algorithm for agile earth observation satellite scheduling, An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits

Uses Software

• Tabu search

Cites Work

• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• Maximizing the value of a space mission
• A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
• Upper bounds for the SPOT 5 daily photograph scheduling problem
• Upper bounds for revenue maximization in a satellite scheduling problem
• Earth observation satellite management
• Genetic and hybrid algorithms for graph coloring
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
• A unified tabu search heuristic for vehicle routing problems with time windows
• Computer Solutions of the Traveling Salesman Problem
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite