Strong formulation for the spot 5 daily photograph scheduling problem

Authors:
Glaydston Mattos Ribeiro;Miguel Fragoso Constantino;Luiz Antonio Lorena
Affiliations:
CEUNES--Centro Universitário Norte do Espírito Santo, UFES--Universidade Federal do Espírito Santo, São Mateus, Brazil 29.933-480;DEIO--Departamento de Estatística e Investigação Operacional, CIO--Centro de Investigação Operacional, Universidade de Lisboa, Lisbon, Portugal 1749-016;LAC--Laboratório Associado de Computação e Matemática Aplicada, INPE--Instituto Nacional de Pesquisas Espaciais, São José dos Campos, Brazil 12.227-010
Venue:
Journal of Combinatorial Optimization
Year:
2010

Citing 11
Cited 1

Generalizations of cliques, odd cycles and anticycles and their relation to independence system polyhedra

Mathematics of Operations Research
On the facial structure of independence system polyhedra

Mathematics of Operations Research
On the set covering polytope: I. all the facets with coefficients in {0, 1, 2}

Mathematical Programming: Series A and B
A generalization of antiwebs to independence systems and their canonical facets

Mathematical Programming: Series A and B
On the facial structure of the set covering polytope dimensional linear programming

Mathematical Programming: Series A and B
Knapsack problems: algorithms and computer implementations

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

Computational Optimization and Applications
Earth Observation Satellite Management

Constraints
Solving the Selecting and Scheduling Satellite Photographs Problem with a Consistent Neighborhood Heuristic

ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Russian doll search for solving constraint optimization problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Daily imaging scheduling of an Earth observation satellite

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

A two-phase scheduling method with the consideration of task clustering for earth observing satellites

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.