PENYELESAIAN MULTI DEPOT VEHICLE ROUTING PROBLEM WITH TIME WINDOWS MENGGUNAKAN PARTICLE SWARM OPTIMIZATION ALGORITHM : Studi Kasus: Rute Pengambilan Bahan Baku

Khairunnisa Aulia Azzahra, - (2024) PENYELESAIAN MULTI DEPOT VEHICLE ROUTING PROBLEM WITH TIME WINDOWS MENGGUNAKAN PARTICLE SWARM OPTIMIZATION ALGORITHM : Studi Kasus: Rute Pengambilan Bahan Baku. S1 thesis, Universitas Pendidikan Indonesia.

Baca Full Text klik disini
[img] Text
S_MAT_1904435_Title.pdf
Download (311kB)
[img] Text
S_MAT_1904435_Chapter1.pdf
Download (49kB)
[img] Text
S_MAT_1904435_Chapter2.pdf
Restricted to Staf Perpustakaan
Download (271kB)
[img] Text
S_MAT_1904435_Chapter3.pdf
Download (359kB)
[img] Text
S_MAT_1904435_Chapter4.pdf
Restricted to Staf Perpustakaan
Download (265kB)
[img] Text
S_MAT_1904435_Chapter5.pdf
Download (40kB)
[img] Text
S_MAT_1904435_Appendix.pdf
Restricted to Staf Perpustakaan
Download (119kB)
Official URL: https://repository.upi.edu/

Abstract

Penelitian ini membahas Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW), yaitu masalah penentuan rute kendaraan dari sejumlah depot untuk melayani beberapa pelanggan tepat satu kali dan kembali ke depot semula dengan mempertimbangkan batasan time windows dalam setiap rutenya. Tujuan penyelesaian MDVRPTW adalah mendapatkan rute optimal dengan total travel time terpendek tetapi tidak melebihi time windows-nya. Algoritma Particle Swarm Optimization (PSO) digunakan untuk menyelesaikan MDVRPTW. Cara kerja PSO diadaptasi dari perilaku sosial dari tindakan tiap individu dalam sekawanan burung terhadap kawanannya. Algoritma ini bekerja dengan cara melakukan inisialisasi, mengevaluasi, mengonstruksi rute, dan memperbaharui rute hingga optimal. Penelitian di uji pada studi kasus pengambilan bahan baku suatu perusahaan. Implementasi PSO berhasil membentuk 5 rute optimal untuk Depot Pertama dan 8 rute optimal untuk Depot Kedua. Hasil optimisasi menunjukan bahwa total travel time minimum tercapai, time windows tidak dilanggar, dan kapasitas kendaraan terpenuhi. Hasil ini menggambarkan efektivitas Algoritma PSO dalam menyelesaikan permasalahan MDVRPTW dan memberikan kontribusi pada perencanaan rute pengambilan bahan yang efisien dan optimal. This research discusses the Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW), which involves determining vehicle routes from multiple depots to serve several customers exactly once and return to the original depot, considering time window constraints on each route. The objective of solving MDVRPTW is to obtain optimal routes with the shortest total travel time without exceeding their time windows. The Particle Swarm Optimization (PSO) algorithm is employed to address MDVRPTW. The PSO operates by adapting the social behavior observed in the actions of each individual within a flock of birds towards their flock. The algorithm works through initialization, evaluation, route construction, and route updating until an optimal solution is achieved. The research is tested on a case study involving the procurement of raw materials for a company. The implementation of PSO successfully forms 5 optimal routes for the First Depot and 8 optimal routes for the Second Depot. The optimization results indicate that the minimum total travel time is achieved, time windows are not violated, and vehicle capacities are fulfilled. These results illustrate the effectiveness of the PSO algorithm in solving the MDVRPTW and contribute to efficient and optimal route planning for material procurement.

Item Type: Thesis (S1)
Additional Information: ID SINTA Dosen Pembimbing : Khusnul Novianingsih : 258640 Dewi Rachmatin : 5975775
Uncontrolled Keywords: Kata Kunci : Multi Depot Vehicle Routing Problem, Particle Swarm Optimization, Vehicle Routing Problem, Rute, Time Windows. Keywords: Multi Depot Vehicle Routing Problem, Particle Swarm Optimization, Vehicle Routing Problem, Route, Time Windows.
Subjects: H Social Sciences > HE Transportation and Communications
Q Science > QA Mathematics
Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Jurusan Pendidikan Matematika > Program Studi Matematika (non kependidikan)
Depositing User: Khairunnisa Aulia Azzahra
Date Deposited: 24 Apr 2024 03:51
Last Modified: 24 Apr 2024 03:51
URI: http://repository.upi.edu/id/eprint/116732

Actions (login required)

View Item View Item