Article ID: | iaor20116947 |
Volume: | 150 |
Issue: | 2 |
Start Page Number: | 379 |
End Page Number: | 394 |
Publication Date: | Aug 2011 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Kksalan Murat, Tezcaner Diclehan |
Keywords: | combinatorial optimization, transportation: air, programming: multiple criteria |
We address the route selection problem for Unmanned Air Vehicles (UAV) under multiple objectives. We consider a general case for this problem, where the UAV has to visit several targets and return to the base. We model this problem as a combination of two combinatorial problems. First, the path to be followed between each pair of targets should be determined. We model this as a multi‐objective shortest path problem. Additionally, we need to determine the order of the targets to be visited. We model this as a multi‐objective traveling salesperson problem (MOTSP). The overall problem is a combination of these two problems, which we define as a generalized MOTSP. We develop an exact interactive approach to identify the best paths and the best tour of a decision maker under a linear utility function.