Anderson, Michael and Sumarsono, Sumarsono and Mahendra, Adhiguna (2018) Vehicle Routing Problem In A Medical Facility Waste Collection Company: A Comparative Analysis Of Guided Local Search, Simulated Annealing And Tabu Search Algorithm. Bachelor thesis, Swiss German University.

Preview	Text Michael Anderson 11407012 TOC.pdf Download (319kB) | Preview
	Text Michael Anderson 11407012 1.pdf Restricted to Registered users only Download (270kB)
	Text Michael Anderson 11407012 2.pdf Restricted to Registered users only Download (778kB)
	Text Michael Anderson 11407012 3.pdf Restricted to Registered users only Download (534kB)
	Text Michael Anderson 11407012 4.pdf Restricted to Registered users only Download (773kB)
	Text Michael Anderson 11407012 5.pdf Restricted to Registered users only Download (244kB)
Preview	Text Michael Anderson 11407012 Ref.pdf Download (181kB) | Preview

Abstract

VRP is a very famous combinatorial optimization problem. There are a lot of efforts done by researchers all over the world to find out how to optimize the problem in many aspects such as distance, time or cost. VRP is very relatable to real life situation in logistics. This research aims to compare three algorithm, which are guided local search, tabu search and simulated annealing using a tool called or tools to solve the VRP problem that a waste management company is currently having. The combined VRP variants which fits the description of the current situation of the waste management company is the Heterogenous Fleet Distance Constrained Capacitated VRP with Time Windows. To run the VRP solver using the algorithm, a software with python programming language is developed. The software is made step by step with each step adding a new constraint or dimension. The versions would later be compared to each other to see the effect of dimension on a VRP. The final test of this research is the sensitivity analysis to see how the problem would fare when it is tested in different environment. From all the test done, the best ortools components are the path most constrained arc as its initial solution generator and guided local search as its optimization algorithm, where it provides the best result in terms of distance optimization, vehicle utilization and balance in vehicle work load.

Item Type:	Thesis (Bachelor)
Uncontrolled Keywords:	Vehicle Routing Problem (VRP); Waste Collection; Guided Local Search; Tabu Search; Simulated Annealing
Subjects:	H Social Sciences > HD Industries. Land use. Labor > HD38.5 Supply Chain Management H Social Sciences > HD Industries. Land use. Labor > HD62 Standardization. Simplification. Waste
Divisions:	Faculty of Engineering and Information Technology > Department of Industrial Engineering
Depositing User:	Astuti Kusumaningrum
Date Deposited:	31 May 2020 15:05
Last Modified:	31 May 2020 15:05
URI:	http://repository.sgu.ac.id/id/eprint/735

Actions (login required)

View Item