Optimization of LPG Distribution Route Using Variable Neighborhood Tabu Search Algorithm

Azzahra, Jasmine Athifa (2021) Optimization of LPG Distribution Route Using Variable Neighborhood Tabu Search Algorithm. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

Text 02411740000117_Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 October 2023. Download (2MB) | Request a copy

Abstract

PT Galaxi Energi Pratama (GEP) merupakan salah satu distributor LPG bersubsidi terbesar di wilayah Malang Raya. Saat ini perencanaan rute tidak dilakukan dengan baik, yang mengakibatkan biaya bahan bakar yang tinggi. Karena proses bisnis utama perusahaan tersebut adalah distribusi, perencanaan rute perlu ditingkatkan untuk memaksimalkan keuntungan. Permasalahan di PT GEP diklasifikasikan sebagai Heterogeneous Vehicle Routing Problem with Multiple Trips (HVRPM). Masalah ini tergolong NP-Hard dan membutuhkan upaya komputasi yang tinggi untuk mendapatkan solusi yang baik sehingga metode metaheuristik lebih disukai. Dalam penelitian ini, algoritma Variable Neighborhood Tabu Search (VNTS) dikembangkan untuk menyelesaikan HVRPM dan diimplementasikan untuk meminimalkan biaya bahan bakar PT GEP. Algoritma tersebut diimplementasikan dalam enam dataset yang dikumpulkan dari studi kasus. Rute yang dihasilkan memberikan total penghematan sebesar Rp 150.876, atau sekitar 18% dari biaya awal. Waktu komputasi algoritma dievaluasi dengan membandingkan dengan Simulated Annealing menggunakan masalah dengan ukuran yang sama. VNTS memiliki waktu rata-rata yang lebih rendah dan diharapkan untuk bekerja secara kompetitif ketika dataset standar digunakan untuk perbandingan. Kualitas solusi dari algoritma tersebut kemudian dibandingkan dengan metode branch-and-bound. VNTS mampu menemukan satu solusi global optimal dari enam dataset dan secara keseluruhan, performanya lebih baik daripada branch-and-bound.
========================================================================================================
PT. Galaxi Energi Pratama (GEP) is one of the biggest distributors of subsidized LPG in Malang Raya area. Currently the route planning is not done very well, which results in a high fuel cost. With the company's main business process being distribution, the planning needs to be improved to maximize the profit. The problem in PT. GEP is classified as the Heterogeneous Vehicle Routing Problem with Multiple Trips (HVRPM). This problem is classified as NP-Hard and requires high computational effort to obtain a good solution so metaheuristic method is preferred. In this research, variable neighborhood tabu search (VNTS) algorithm is developed to solve the HVRPM and implemented to minimize the fuel cost of PT. GEP. The developed algorithm is implemented in the six instances collected from the case study. The generated trips produce a total savings of Rp 171,192 for one operational week, or roughly 18% of the initial cost. The computation time of the algorithm is evaluated by comparing with Simulated Annealing using a problem with the same size. VNTS has a lower average time and is expected to perform competitively when a standardized dataset is used for comparison. The solution quality of the algorithm is then compared with branch-and-bound method. VNTS is able to find one global optimal solution out of the six instances and overall, it performs better than branch-and-bound.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Vehicle Routing Problem, Heterogeneous VRP with Multiple Trips, Variable Neighborhood Search, Tabu Search, Variable Neighborhood Tabu Search.
Subjects:	Q Science > QA Mathematics > QA402.6 Transportation problems (Programming)
Divisions:	Faculty of Industrial Technology and Systems Engineering (INDSYS) > Industrial Engineering > 26201-(S1) Undergraduate Thesis
Depositing User:	Jasmine Athifa Azzahra
Date Deposited:	20 Aug 2021 05:59
Last Modified:	20 Aug 2021 05:59
URI:	http://repository.its.ac.id/id/eprint/87465

Actions (login required)

View Item