Computational Optimization and Applications

, Volume 20, Issue 2, pp 137–157

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

  • Michel Vasquez
  • Jin-Kao Hao

DOI: 10.1023/A:1011203002719

Cite this article as:
Vasquez, M. & Hao, JK. Computational Optimization and Applications (2001) 20: 137. doi:10.1023/A:1011203002719


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 “logical” 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.

tabu searchheuristicssatellite photograph schedulingmultidimensional knapsackconstrained combinatorial optimization

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Michel Vasquez
  • Jin-Kao Hao

There are no affiliations available