An Interactive Algorithm for Multi-objective Route Planning

Date

2011-08-01

Author

Tezcaner, Diclehan
Köksalan, Mustafa Murat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

142
views

0
downloads

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.

Subject Keywords

Management Science and Operations Research, Control and Optimization, Applied Mathematics

URI

https://hdl.handle.net/11511/56683

Journal

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS

DOI

https://doi.org/10.1007/s10957-011-9838-y

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A flexible reference point-based multi-objective evolutionary algorithm: An application to the UAV route planning problem DAŞDEMİR, ERDİ; Köksalan, Mustafa Murat; TEZCANER ÖZTÜRK, DİCLEHAN (Elsevier BV, 2020-02-01) We study the multi-objective route planning problem of an unmanned air vehicle (UAV) moving in a continuous terrain. In this problem, the UAV starts from a base, visits all targets and returns to the base in a continuous terrain that is monitored by radars. We consider two objectives: minimizing total distance and minimizing radar detection threat. This problem has infinitely many Pareto-optimal points and generating all those points is not possible. We develop a general preference-based multi-objective evo...
Solving the area coverage problem with UAVs: A vehicle routing with time windows variation Semiz, Fatih; Polat, Faruk (Elsevier BV, 2020-4) In real life, providing security for a set of large areas by covering the area with Unmanned Aerial Vehicles (UAVs) is a difficult problem that consist of multiple objectives. These difficulties are even greater if the area coverage must continue throughout a specific time window. We address this by considering a Vehicle Routing Problem with Time Windows (VRPTW) variation in which capacity of agents is one and each customer (target area) must be supplied with more than one vehicles simultaneously without v...
Improvement of routing protocols for unmanned flying ad hoc networks (UFANETS) by using crosslayer metrics Alkış, Oğuz; Ulusoy, İlkay; Department of Electrical and Electronics Engineering (2019) Unmanned Air Vehicles (UAV) have been used to perform different type of missions. Many of these civilian and military missions require information exchange between UAVs, which is performed by using routing protocols for wireless ad hoc networks. An efficient routing protocol for unmanned flying ad hoc networks (UFANETs) plays a critical role for data transmission during various applications. In the literature, there are many studies for mobile ad hoc networks (MANET) routing protocols. Due to high mobility ...
Multi-objective route selection Tezcaner, Diclehan; Köksalan, Murat; Department of Industrial Engineering (2009) In this thesis, 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. For this case, there are multiple combinatorial problems to be considered. First, the paths to be followed between any pairs of targets should be determined. This part can be considered as a multi-objective shortest path problem. Additionally, we need to determine the order of the targe...
Integrated aircraft and passenger recovery with cruise time controllability Arikan, Ugur; Gürel, Sinan; Akturk, M. Selim (Springer Science and Business Media LLC, 2016-01-01) Disruptions in airline operations can result in infeasibilities in aircraft and passenger schedules. Airlines typically recover aircraft schedules and disruptions in passenger itineraries sequentially. However, passengers are severely affected by disruptions and recovery decisions. In this paper, we present a mathematical formulation for the integrated aircraft and passenger recovery problem that considers aircraft and passenger related costs simultaneously. Using the superimposition of aircraft and passeng...

Citation Formats

D. Tezcaner and M. M. Köksalan, “An Interactive Algorithm for Multi-objective Route Planning,” JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, pp. 379–394, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56683.