Upper bounds for the SPOT 5 daily photograph scheduling problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2003

Upper bounds for the SPOT 5 daily photograph scheduling problem

Résumé

This paper introduces tight upper bounds for the daily photograph scheduling problem of earth observation satellites. These bounds, which were unavailable until now, allow us to assess the quality of the heuristic solutions obtained previously. These bounds are obtained with a partition-based approach following the divide and pas conquer principle. Dynamic programming and tabu search are conjointly used in this approach. We present also simplex-based linear programming relaxation and a relaxed knapsack approach for the problem.
Fichier principal
Vignette du fichier
upper-bounds-for-the-spot-5-daily-photograph.pdf (121.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00359381 , version 1 (17-10-2023)

Identifiants

  • HAL Id : hal-00359381 , version 1

Citer

Michel Vasquez, Jin-Kao Hao. Upper bounds for the SPOT 5 daily photograph scheduling problem. Journal of Combinatorial Optimization, 2003, 7 (1), pp.87-103. ⟨hal-00359381⟩
108 Consultations
7 Téléchargements

Partager

Gmail Facebook X LinkedIn More