Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite

Authors:
Djamal Habet;Michel Vasquez;Yannick Vimont
Affiliations:
LSIS - UMR CNRS 6168, Domaine Universitaire de Saint-Jérôme, Marseille cedex 20, France 13397;École des Mines d'Alès, LGI2P Research Center, Nîmes cedex 01, France 30035;École des Mines d'Alès, LGI2P Research Center, Nîmes cedex 01, France 30035
Venue:
Computational Optimization and Applications
Year:
2010

Citing 6
Cited 1

A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite

Computational Optimization and Applications
Tabu Search

Tabu Search
Earth Observation Satellite Management

Constraints
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain

Management Science
Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

A two-phase scheduling method with the consideration of task clustering for earth observing satellites

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of managing an Agile Earth Observing Satellite consists of selecting and scheduling a subset of photographs among a set of candidate ones that satisfy imperative constraints and maximize a gain function. We propose a tabu search algorithm to solve this NP-hard problem. This one is formulated as a constrained optimization problem and involves stereoscopic and time window visibility constraints; and a convex evaluation function that increases its hardness. To obtain a wide-ranging and an efficient exploration of the search space, we sample it by consistent and saturated configurations. Our algorithm is also hybridized with a systematic search that uses partial enumerations. To increase the solution quality, we introduce and solve a secondary problem; the minimization of the sum of the transition durations between the acquisitions. Upper bounds are also calculated by a dynamic programming algorithm on a relaxed problem. The obtained results show the efficiency of our approach.