Résumé (EN)

We consider a satellite following orbits around the earth in order to take shots corresponding to images requested by various customers. The daily operations of such a satellite consist of defining a feasible and satisfactory shot sequence. This problem involves both combinatorial and multiple criteria difficulties. Indeed, the number of feasible shot sequences grows significantly with the number of images asked for, and the evaluation of a shot sequence is based on several conflicting criteria. We propose to formulate this problem as the selection of a multiple criteria path in a graph without circuit. Our approach for solving this problem involves two stages: generation of efficient paths and selection of a satisfactory path using a multiple criteria interactive procedure.