A clustering based heuristic for location routing problems

Warning The system is temporarily closed to updates for reporting purpose.

Sarıgöl, İlkan (2007) A clustering based heuristic for location routing problems. [Thesis]

[thumbnail of SarigolIlkan.pdf] PDF
SarigolIlkan.pdf

Download (1MB)

Abstract

In this thesis we address the location routing problem (LRP) in which vehicle routing and warehouse location/allocation decisions are made simultaneously. LRP deals with determining the optimal number of warehouses as well as their locations while assigning customers to warehouses so that the shortest vehicle routes are achieved. The objective is to minimize total vehicle related costs (fixed vehicle cost and route cost) and the cost of operating the warehouses. To solve this NP-hard problem, we propose a clustering based heuristic approach which consists of three parts. Firstly, we determine the customer clusters based on vehicle capacities, i.e. all customers in the cluster are serviced by the same vehicle. Secondly, we solve a traveling salesman problem for each cluster. Thirdly, we attempt to improve the routes by using local search techniques. Finally, the routed clusters are assigned to warehouses.
Item Type: Thesis
Uncontrolled Keywords: Clustering. -- Heuristics. -- Location-allocation. -- Location-routing. -- Vehicle routing. -- Heuristic methods. -- Routing. -- Araç Rotalama. -- Lokasyon Dağıtım. -- Lokasyon Rotalama. -- Sezgisel Yöntemler. -- Sezgisel algoritmalar. -- Rotalama.
Subjects: T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering
Divisions: Faculty of Engineering and Natural Sciences
Faculty of Engineering and Natural Sciences > Academic programs > Manufacturing Systems Eng.
Depositing User: IC-Cataloging
Date Deposited: 10 Mar 2010 16:41
Last Modified: 26 Apr 2022 09:51
URI: https://research.sabanciuniv.edu/id/eprint/13812

Actions (login required)

View Item
View Item