SISTEM PENDUKUNG KEPUTUSAN DENGAN PEMODELAN CAPACITATED VEHICLE ROUTING PROBLEM UNTUK OPTIMALISASI RUTE DISTRIBUSI DAN TOTAL KENDARAAN

ZULFIQAR, La Ode Mohamad and Isnanto, R. Rizal and Nurhayati, Oky Dwi (2018) SISTEM PENDUKUNG KEPUTUSAN DENGAN PEMODELAN CAPACITATED VEHICLE ROUTING PROBLEM UNTUK OPTIMALISASI RUTE DISTRIBUSI DAN TOTAL KENDARAAN. Masters thesis, School of Postgraduate.

[img]PDF
Restricted to Repository staff only

2959Kb

Abstract

Optimalisasi rute merupakan hal penting yang mempengaruhi efisiensi operasional sistem transportasi. Efisiensi sistem transportasi berdampak besar terhadap keuntungan finansial suatu perusahaan karena lebih dari setengah dari total anggaran logistik suatu perusahaan merupakan proporsi terhadap anggaran transportasi. Dalam penelitian ini, dikembangkan suatu sistem pendukung keputusan untuk optimalisasi operasi logistik (total kendaraan dan rute distribusi) yang diterapkan dengan pemodelan Capacitated Vehicle Routing Problem menggunakan kombinasi Algoritma Dijkstra dan Algoritma Sweep Nearest (SWN). Data yang digunakan diperoleh dari data operasional PT. Pertamina Depo Malang, Jawa Timur, yang mencakup data koordinat agen SPBU di Kota Malang, kendaraan operasional dan rute distribusi saat ini. Melalui penelitian yang telah dilakukan, diperoleh hasil bahwa metode Capacitated Vehicle Routing Problem dengan menggunakan kombinasi Algoritma SWN dan Algoritma Dijkstra dapat mengoptimalkan akumulasi jarak tempuh yang sebelumnya mencapai 115 kilometer, dioptimalkan menjadi 105 kilometer. Selain itu, total kendaraan yang digunakan dalam operasional distribusi premium juga dapat diminimalisasi penggunaan kendaraan sebanyak 1 unit dari total penggunaan kendaraan 15 unit, sehingga menjadi total 14 unit kendaraan yang dibutuhkan. Kata Kunci — Capacitated Vehichle Routing Problem; Optimalisasi rute distribusi premium; Optimalisasi total kendaraan; Algoritma Dijkstra; Algoritma Sweep Nearest. Route optimization is an essential matter impacting operation of transportation‘s efficiency. The efficiency of transportation systems has big influencing for financial benefit, which is more than half from the total of logistic budget is the transportation‘s budget. In this research, a decision support system is implemented to optimize logistic operations (amounts of vehicles used dan distribution routes). This system is utilizing the model of capacitated vehicle routing problem and the fusion of Dijkstra Algorithm and Sweep Nearest Algorithm. The data used, obtained from PT. Pertamina Depo Malang, East Java, which the data are coordinate points of each location involved, totals and capacities of the vehicles, and also the current distribution‘s routes. Through this research, compare with latter-day operations, we found out that the method of Capacitated Vehicle Routing Problem using combination of Dijkstra and Sweep Nearest Algorithms is able to optimize the accumulative distance of travels for 105 kilometers from (before) 115 kilometers. Furthermore, the amounts of used vehicles are able to reduce for 1 unit, hence, the total of used vehicles from (before) 15 units become 14 units. Keywords — Capacitated Vehichle Routing Problem; Optimalization of Premium gasoline‘s distribution route; optimilization of utilized vehicles; Dijkstra Algorithm; Sweep Nearest Algorithm.

Item Type:Thesis (Masters)
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:School of Postgraduate > Master Program in Information System
ID Code:64233
Deposited By:Mrs Ekana Perpus Pasca
Deposited On:04 Sep 2018 09:53
Last Modified:04 Sep 2018 09:53

Repository Staff Only: item control page