Penerapan Firefly Algorithm Pada Proses Penentuan Rute Dan Pemberangkatan Kendaraan Di PT Pertamina TBBM Surabaya Group

Rizaldi, Edo (2016) Penerapan Firefly Algorithm Pada Proses Penentuan Rute Dan Pemberangkatan Kendaraan Di PT Pertamina TBBM Surabaya Group. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

[img]
Preview
Text
2212100139-Undergraduate_Thesis.pdf - Accepted Version

Download (3MB) | Preview
[img]
Preview
Text
2212100139-Paperpdf.pdf - Accepted Version

Download (459kB) | Preview
[img]
Preview
Text
2212100139-Presentationpdf.pdf - Presentation

Download (2MB) | Preview

Abstract

Proses vehicle routing and dispatching sangat menentukan ketersediaan Bahan Bakar Minyak (BBM) di tiap-tiap Stasiun Pengisian Bahan Bakar Umum (SPBU). Proses vehicle routing akan membuat rute distribusi tiap SPBU dengan mempertimbangkan permintaan (demand) BBM tiap SPBU, jarak tempuh dari depo ke SPBU, serta jarak tempuh antar SPBU. Rute-rute yang terbentuk akan digunakan sebagai data masukan untuk proses vehicle dispatching, yaitu proses pengalokasian kendaraan per nomor kendaraan untuk menjalankan tiap rute yang terbentuk. Kendaraan yang digunakan dalam proses distribusi terbagi dalam kelompok (cluster) sesuai dengan kapasitas maksimalnya yang menandakan permasalahan ini termasuk capacitated vehicle routing problem. Pada penelitian Tugas Akhir ini, digunakan firefly algorithm untuk menyelesaikan permasalahan vehicle routing and dispatching dengan mempertimbangkan deviasi jarak tempuh tiap kendaraan yang terpakai. Dari hasil perbandingan menggunakan metode nearest neighbor, didapatkan hasil bahwa firefly algorithm mampu menghasilkan jumlah rute dan nilai deviasi jarak tempuh yang lebih baik, yaitu 24 rute dengan deviasi jarak tempuh sebesar 1.677 jam. ======================================================================================================================== Vehicle routing and dispatching process will determine the availability of fuel oil (BBM) in each of the Gas Station. Vehicle routing process will make the distribution route of each gas station by considering the request (demand) for each gas station, the distance from depot to gas stations, and the distance between gas stations. The routes that created by vehicle routing process will be used as input data for vehicle dispatching process, a process that allocate a number of vehicles to take each route. The vehicle that used for distribution process devided into groups (clusters) in accordance with their maximum capacity that indicates this problem into the capacitated vehicle routing problem. In this final assignment research, we used firefly algorithm to solve vehicle routing and dispatching process with considering the deviation of distance for each vehicle were used. From the comparison result with nearest neighbor method, firefly algorithm can produce a minimum number of routes and the deviation of distance, which is 24 routes and 1.677 hour for deviation of distance.

Item Type: Thesis (Undergraduate)
Additional Information: RSE 387.52 Riz p
Uncontrolled Keywords: Capacitated Vehicle Routing Problem, Firefly Algorithm, Proses Distribusi, Vehicle Dispatching.
Subjects: H Social Sciences > HE Transportation and Communications > HE336.R68 Route choice
Divisions: Faculty of Industrial Technology > Electrical Engineering > 20201-(S1) Undergraduate Thesis
Depositing User: ansi aflacha
Date Deposited: 22 Jan 2020 07:51
Last Modified: 22 Jan 2020 07:51
URI: https://repository.its.ac.id/id/eprint/72900

Actions (login required)

View Item View Item