Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite

Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite

0.00 Avg rating0 Votes
Article ID: iaor20023333
Country: Netherlands
Volume: 139
Issue: 3
Start Page Number: 533
End Page Number: 542
Publication Date: Jun 2002
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: multiple criteria, scheduling
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.