Mathematical Programming for Earth Observation Satellite Mission Planning

  • Virginie Gabrel
  • Cécile Murat
Part of the Applied Optimization book series (APOP, volume 79)


Planning the mission of an Earth observation satellite is choosing the shots to be taken during a given period in order to satisfy some requested images. The difficulty of the underlying combinatorial problem depends on the satellite characteristics and on the planning horizon.

We present several formulations using graph theory and mathematical programming. We show that some special cases can be easily solved since they leads to determine longest paths in acyclic directed graphs. For more realistic cases, integer mathematical programming models are much more complicated but, our formulation contains simple longest paths problems as sub-problems. Consequently some decomposition techniques, like column generation, can favorably be used.


Earth observation satellite mission planning graph theory column generation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ahuja R.K., Magnanti T.L., Orlin J.B. Network flows: Theory, Algorithms, and Applications. New Jersey: Prentice Hall, 1993.zbMATHGoogle Scholar
  2. [2]
    Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M. W. P., Vance P. H., Branch-and-Price: Column Generation for Solving Huge Integer Programs. Operations Research, 43:(6) 316–329, 1998.MathSciNetCrossRefGoogle Scholar
  3. [3]
    Bensanna E., Verfaillie G., Agnèse J-C., Bataille N., Blumstein D. Exact and approximate methods for the daily management of an earth observation satellite. In Proceedings of the 4th Int. Symposium on Space Mission Operations and Ground Data Systems, Munich, Germany, 1996.Google Scholar
  4. [4]
    Bensanna E., Lemaître M., Verfaillie G. Earth observation satellite management. Constraints: an International Journal, 4:(3) 293–299, 1999.CrossRefGoogle Scholar
  5. [5]
    Gabrel V., Moulet A., Murat C, Paschos V. Th. A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts. Annals of Operations Research, 69: 115–134, 1997.zbMATHCrossRefGoogle Scholar
  6. [6]
    Gondran M., Minoux M. Graphes et algorithmes. Paris: Eyrolles, 1985.Google Scholar
  7. [7]
    Minoux M., Programmation mathématique: Théorie et Algorithmes. Paris: Dunod, 1983. English translation, New York: Wiley, 1986.Google Scholar
  8. [8]
    Ribeiro C. C, Minoux M., Penna M. C. An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment. European Journal of Operational Research, 41 232–239, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    Vasquez M., Hao J-K., A Logic-Constrained Knapsack formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation satelite. Journal of Computational Optimization and Applications, 20:(2) 137–157, 2001.MathSciNetzbMATHCrossRefGoogle Scholar
  10. [10]
    Wolfe W. J., Sorensen S. E. Three scheduling algorithms applied to the earth observing systems domain. Management Science, 46: (1) 148–168, 2000.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2003

Authors and Affiliations

  • Virginie Gabrel
    • 1
  • Cécile Murat
    • 2
  1. 1.LIPN Université ParisVilletaneuseFrance
  2. 2.LAMSADE Université Paris DauphineParisFrance

Personalised recommendations