Multi-objective route selection

Download
index.pdf
2009
Tezcaner, Diclehan
Show full item record
195
views
124
downloads
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 targets to be visited. This in turn, is a multi-objective traveling salesperson problem. The overall problem is a combination of these two combinatorial problems. The route selection for UAVs has been studied by several researchers, mainly in the military context. They considered a linear combination of the two objectives; minimizing distance traveled and minimizing radar detection threat; and proposed heuristics for the minimization of the composite single objective problem. We treat these two objectives separately. We develop an evolutionary algorithm to determine the efficient tours. We also consider an exact interactive approach to identify the best paths and tours of a decision maker. We tested the two solution approaches on both small-sized and large-sized problem instances.
Industrial engineering.
http://etd.lib.metu.edu.tr/upload/2/12610767/index.pdf
https://hdl.handle.net/11511/18681
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Multiobjective hub location problem
Barutçuoğlu, Aras; Köksalan, Murat; Department of Industrial Engineering (2009)
In this study, we propose a two-phase solution approach for approximating the efficient frontier of a bicriteria hub location problem. We develop an evolutionary algorithm to locate the hubs on the network as the first phase. In the second phase, we develop a bounding procedure based on dominance relations and using the determined bounds, we solve the allocation subproblem for each located hub set. The two-phase approach is tested on the Australian Post data set and it is observed that our approach approxim...
Approximate models and solution approaches for the vehicle routing problem with multiple use of vehicles and time windows
Boer, Jeroen Wouter de; Süral, Haldun; Department of Industrial Engineering (2008)
In this study we discuss the Vehicle Routing Problem with multiple use of vehicles (VRPM). In this variant of the routing problem the vehicles may replenish at any time at the depot. We present a detailed review of existing literature and propose two mathematical models to solve the VRPM. For these two models and their several variants we provide computational results based on the test problems taken from the literature. We also discuss a case study in which we are simultaneously dealing with side constrain...
An Interactive Algorithm for Multi-objective Route Planning
Tezcaner, Diclehan; Köksalan, Mustafa Murat (Springer Science and Business Media LLC, 2011-08-01)
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 lagrangean heuristic for the two-stage modular capacitated facility location problem
Sevinç, Selim; Meral, Fatma Sedef; Department of Industrial Engineering (2008)
In this study, a Lagrangean heuristic based on Lagrangean relaxation and subgradient optimization is proposed for the two-stage modular capacitated facility location problem. The objective is to minimize the cost of locating and operating plants and warehouses, plus the cost of transporting goods at both echelons to satisfy the demand of customers. The difference of our study from the two-stage capacitated facility location problem is the existence of multiple capacity levels as a candidate for each plant i...
On the service models for dynamic scheduling of multi-class base-stock controlled systems
Kat, Bora; Avşar, Zeynep Müge; Department of Industrial Engineering (2005)
This study is on the service models for dynamic scheduling of multi-class make-to-stock systems. An exponential single-server facility processes different types of items one by one and demand arrivals for different item types occur according to independent Poisson processes. Inventories of the items are managed by base-stock policies and backordering is allowed. The objective is to minimize base-stock investments or average inventory holding costs subject to a constraint on the aggregate fill rate, which is...
Citation Formats
D. Tezcaner, “Multi-objective route selection,” M.S. - Master of Science, Middle East Technical University, 2009.
METU IIS - Integrated Information Service open@metu.edu.tr