Approximation Algorithms for the Heterogeneous Vehicle Routing Problem

Please enable javascript in your browser.

Monfared, Hesamodin | 2013

1003 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 44615 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Zarrabi-Zadeh, Hamid
Abstract:
In this thesis, we study the heterogeneous vehicles routing problem, which is a general-ization of the well-known travelling salesperson problem. In this problem, we are given a set of heterogeneous vehicles located in specific depots, along with a set of customers in the form of a graph. The vertices of the graph represent clients and depots, and the weight of edges represents the cost of travel between vertices of the graph. The goal is to find a subgraph for each vehicle so that the union of the subgraphs contain all customers and the total travel cost is minimized. The heterogeneity here means that the cost of traversing edges for each vehicle might be different. In this work, we briefly sketch the current solutions to this problem, and then try to provide improvements to some variants of the problem
Keywords:
Heteroscedasticity ; Approximate Algorithm ; Vehicle Routing Problem