A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- E. Bensana, M. Lemaître, and G. Verfaillie, “Benchmark problems: earth observation satellite management. ” Constraints, An International Journal, vol. 4, pp. 293–299, 1999.
- E. Bensana, G. Verfaillie, J.C. Agnèse, N. Bataille, and D. Blumstein, “Exact and approximate methods for the daily management of an earth observation satellite, ” in Proc. of the 4th Intl. Symposium on Space Mission Operations and Ground Data Systems (SpaceOps-96), Munich, Germany, 1996. ftp://ftp.cert.fr/pub/verfaillie/spaceops96.ps.
- P.C. Chu and J.E. Beasley, “A genetic algorithm for the multidimensional knapsack problem, ” Journal of Heuristics, vol. 4, pp. 63–86, 1998.
- F. Dammeyer and S. Voss, “Dynamic tabu list management using reverse elimination method, ” Annals of Operations Research, vol. 41, pp. 31–46, 1993.
- A. Frèville and G. Plateau, “An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, ” Discrete Applied Mathematics, vol. 49, pp. 189–212, 1994.
- A. Frèville and G. Plateau, “The 0-1 bidimensional knapsack problem: toward an efficient high-level primitive tool, ” Journal of Heuristics, vol. 2, pp. 147–167, 1997.
- V. Gabrel, Improved linear programming bounds via column generation for daily scheduling of earth observation satellite. Research Report 99-01, LIPN, Universitè de Paris XIII, January 1999.
- F. Glover and G.A. Kochenberger, “Critical event tabu search for multidimensional knapsack problems”, in Meta-Heuristics: Theory and Applications, I.H. Osman and J.P. Kelly (Eds.), Kluwer Academic Publishers, 1996, pp. 407–428.
- F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997.
- S. Hanafi, A. Freville, and A.EI. Abdellaoui, “Comparison of heuristics for the 0-1 multidimensional knapsack problem, ” in Meta-Heuristics: Theory and Applications, I.H. Osman and J.P. Kelly (Eds.), Kluwer Academic Publishers, 1996, pp. 449–465.
- S. Hanafi and A. Freville, “An efficient tabu search approach for the 0-1 multidimensional knapsack problem, ” European Journal of Operational Research, Special Tabu Search Issue, vol. 106, no. (2-3) pp. 663–697, 1998.
- M. Lemaître and G. Verfaillie, “Daily management of an earth observation satellite: comparison of Ilog solver with dedicated algorithms for valued constraint satisfaction problems, ” in Proc. of the 3rd Ilog Intl. Users Meeting, Paris, France, 1997. ftp://ftp.cert.fr/pub/verfaillie/ilog97.ps.
- A. Lokketangen and F. Glover, “Solving zero-one mixed integer programming problems using tabu search”, European Journal of Operational Research, Special Tabu Search Issue, vol. 106, no. (2-3), pp. 627–662, 1998.
- S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley Chichester, 1990.
- H. Pirkul, “Aheuristic solution procedure for the multiconstraint zero-one knapsack problem, ” Naval Research Logistics, vol. 34, pp. 161–172, 1987.
- G. Verfaillie, Personal communications. Apr 1999.
- G. Verfaillie, M. Lemaître, and T. Schiex, “Russian doll search for solving constraint optimization problems, ” in Proc. of the 13th National Conference on Artificial Intelligence (AAAI-96), Portland, USA, 1996, pp. 181–187.
- A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite
Computational Optimization and Applications
Volume 20, Issue 2 , pp 137-157
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- tabu search
- satellite photograph scheduling
- multidimensional knapsack
- constrained combinatorial optimization
- Industry Sectors