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

Michel Vasquez (1) , Jin-Kao Hao (2)

1 LGI2P - Laboratoire de Génie Informatique et Ingénierie de Production
2 LERIA - Laboratoire d'Etudes et de Recherche en Informatique d'Angers

The daily photograph scheduling problem of earth observation satellites such as Spot 5 consists of scheduling a subset of mono or stereo photographs from a given set of candidates to different cameras. The scheduling must maximize a profit function while satisfying a large number of constraints. In this paper, we first present a formulation of the problem as a generalized version of the well-known knapsack model, which includes large numbers of binary and ternary ldquologicalrdquo constraints. We then develop a tabu search algorithm which integrates some important features including an efficient neighborhood, a dynamic tabu tenure mechanism, techniques for constraint handling, intensification and diversification. Extensive experiments on a set of large and realistic benchmark instances show the effectiveness of this approach.

Mots clés: tabu search; heuristics; satellite photograph scheduling; multidimensional knapsack; constrained combinatorial optimization

Domaines: Recherche opérationnelle [math.OC]; Intelligence artificielle [cs.AI]

Michel Vasquez, Jin-Kao Hao. A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. Computational Optimization and Applications, 2001, 20 (2), pp.137-157. ⟨hal-00359386⟩