Abstract
Earth observation satellites, such as the SPOT 5, take photographs of the earth according to consumers’ demands. Obtaining a good schedule for the photographs is a combinatorial optimization problem known in the literature as the daily photograph scheduling problem (DPSP). The DPSP consists of selecting a subset of photographs, from a set of candidates, to different cameras, maximizing a profit function and satisfying a large number of constraints. Commercial solvers, with standard integer programming formulations, are not able to solve some DPSP real instances available in the literature. In this paper we present a strengthened formulation for the DPSP, based on valid inequalities arising in node packing and 3-regular independence system polyhedra. This formulation was able, with a commercial solver, to solve to optimality all those instances in a short computation time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Atamtürk A, Nemhauser GL, Savelsbergh MWP (2000) Conflict graphs in solving integer programming problems. Eur J Oper Res 121:40–45
Balas E, Ng SM (1989) On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}. Math Program 43:57–69
Benoist T, Rottembourg B (2004) Upper bounds for revenue maximization in a satellite scheduling problem. Q J Belg French Italian Oper Res Soc 2:235–249
Bensana E, Verfaillie G, Agnèsse JC, Bataille N, Blumstein D (1996) Exact and approximate methods for the daily management of an earth observation satellite. In: Proceedings of the 4th international symposium on space mission operations and ground data systems (SpaceOps-96), Munich, Germany. Available at ftp://ftp.cert.fr/pub/verfaillie/spaceops96.ps
Bensana E, Lamaítre M, Verfaillie G (1999) Benchmark problems: earth observation satellite management. Constraints 4:293–299
Conforti M, Laurent M (1988) On the facial structure of independence system polyhedra. Math Oper Res 13(4):543–555
Cordeau J-F, Laporte G (2005) Maximizing the value of an earth observation satellite orbit. J Oper Res Soc 56:962–968
Euler R, Junger M, Reinelt G (1987) Generalizations of cliques, odd cycles and anticycles and their relation to independence system polyhedra. Math Oper Res 12(3):451–462
Fréville A, Hanafi S (2005) The multidimensional 0–1 knapsack problem—bounds and computational aspects. Ann Oper Res 139:195–227
Fulkerson DR (1971) Blocking and anti-blocking pairs of polyhedra. Math Program 1:168–194
Gabrel V (2005) An extensive comparison of 0–1 linear programs for SPOT5 daily mission planning problem. Ann LAMSADE 4–5
Gabrel V (2006) Strengthened 0–1 linear formulation for the daily satellite mission planning. J Comb Optim 11:341–346
Gabrel V, Murat C (2003) Mathematical programming for earth observation satellite mission planning. In: Ciriani TA, Fasano G, Gliozzi S, Tadei R (eds) Operations research in space and air. Kluwer Academics, Dordrecht, pp 103–122
Habet D, Vasquez M (2004) Solving the selecting and scheduling satellite photographs problem with a consistent neighborhood heuristic. In: Proceedings of the 16th IEEE international conference on tools with artificial intelligence (ICTAI 2004), Boca Raton, USA, pp 302–309
ILOG (2006) CPLEX 10 reference manual. Gentilly, France
Laurent M (1989) A generalization of antiwebs to independence systems and their canonical facets. Math Program 45:97–108
Lemaitre M, Verfaillie G (1997) Daily management of an earth observation satellite: comparison of ILOG solver with dedicated algorithms for valued constraint satisfaction problems. In: Proceedings of the 3rd ILOG international users meeting, Paris, France. Available at ftp://ftp.cert.fr/pub/verfaillie/ilog97.ps
Lin W-C, Liao D-Y, Liu C-Y, Lee Y-Y (2005) Daily imaging scheduling of an earth observation satellite. IEEE Trans Syst Man Cyber Part A Syst Hum 35:213–223
Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester
Nemhauser GL, Sigismondi G (1992) A strong cutting plane/branch-and-bound algorithm for node packing. J Oper Res Soc 43:443–457
Nemhauser GL, Trotter LE (1974) Properties of vertex packing and independence system polyhedra. Math Program 6:48–61
Padberg MW (1973) On the facial structure of set packing polyhedra. Math Program 5:199–215
Ribeiro GM (2007) Relaxação lagrangeana com clusters para alguns problemas de otimização modelados em grafos de conflitos (Lagrangian relaxation with clusters for some optimization problems modeled by conflict graphs). PhD dissertation, National Institute for Space Research—INPE, São Paulo, Brazil, p 194. Available at http://www.lac.inpe.br/~lorena
Sassano S (1989) On the facial structure of the set covering polytope. Math Program 44:181–202
Vasquez M, Hao J-K (2001) A “logic-constrained” knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. J Comput Optim Appl 20:137–157
Vasquez M, Hao J-K (2003) Upper bounds for the SPOT 5 daily photograph scheduling problem. J Comb Optim 7:87–103
Verfaillie G, Lemaître M, Schiex T (1996) Russian doll search for solving constraint optimization problems. In: Proceedings of the 13th national conference on artificial intelligence (AAAI-96), Portland, USA, pp 181–187
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ribeiro, G.M., Constantino, M.F. & Lorena, L.A.N. Strong formulation for the spot 5 daily photograph scheduling problem. J Comb Optim 20, 385–398 (2010). https://doi.org/10.1007/s10878-009-9215-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-009-9215-z