PENYELESAIAN MULTIOBJECTIVE DYNAMIC VEHICLE ROUTING PROBLEM MENGGUNAKAN ALGORITMA PARTICLE SWARM OPTIMIZATION WITH TIME SEED BASED: Studi Kasus Rute Pengiriman Liquefied Petroleum Gas

    Karina Zahra Aqila, - and Khusnul Novianingsih, - and Dewi Rachmatin, - (2025) PENYELESAIAN MULTIOBJECTIVE DYNAMIC VEHICLE ROUTING PROBLEM MENGGUNAKAN ALGORITMA PARTICLE SWARM OPTIMIZATION WITH TIME SEED BASED: Studi Kasus Rute Pengiriman Liquefied Petroleum Gas. S1 thesis, Universitas Pendidikan Indonesia.

    Abstract

    Penelitian ini membahas Multiobjective Dynamic Vehicle Routing Problem (M-DVRP), yaitu masalah penentuan rute yang beroperasi secara waktu nyata karena, jika terjadi penambahan pelanggan atau permintaan secara mendadak, maka harus segera dilayani apabila memungkinkan. Tujuan penyelesaian M-DVRP adalah meminimalkan jarak tempuh dan meminimalkan waktu jangkauan semua kendaraan dengan memenuhi seluruh kendala operasional. Algoritma Particle Swarm Optimization with Time Seed Based digunakan untuk menyelesaikan M-DVRP. Cara kerja PSO-TS meniru perilaku sosial yang melibatkan tindakan dan pengaruh individu-individu dalam sebuah kawanan. Algoritma ini bekerja dengan cara melakukan inisialisasi, mengevaluasi, mengonstruksi rute, dan memperbaharui rute hingga optimal. Penelitian di uji pada studi kasus pengiriman gas LPG 3 kg pada suatu perusahaan. Implementasi PSO-TS berhasil mendistribusikan kepada 12 pelanggan dengan Kendaraan 1 dan 13 Pelanggan dengan Kendaraan 2 dengan total jarak minimum, waktu operasional yang ditetapkan tidak dilanggar, dan kapasitas kendaraan terpenuhi. Hasil ini menggambarkan efektivitas Algoritma PSO-TS dalam menyelesaikan permasalahan M-DVRP dan memberikan kontribusi pada perencanaan rute pengiriman yang efisien dan optimal. This research investigates the Multi-Objective Dynamic Vehicle Routing Problem (M-DVRP), a real-time route determination problem in dynamic environments. If there is a sudden increase in customers or demand, it must be served promptly. The objective of solving the M-DVRP is to minimize the travel distance and minimize the reach time of all vehicles while meeting all operational constraints. The Particle Swarm Optimization with Time Seed Based (PSO-TS) algorithm is used to solve the M-DVRP. PSO-TS mimics social behavior that involves the actions and influences of individuals within a flock. This algorithm operates by performing initialization, evaluation, route construction, and route updating until an optimal solution is achieved. The implementation results for the LPG 3 kg gas delivery problem in a company demonstrate that PSO-TS successfully solved the distribution problem, achieving the minimum total distance, without violating the operational time limit, and ensuring the vehicle capacity was met. These results illustrate the effectiveness of the PSO-TS Algorithm in solving the M-DVRP problem and contribute to efficient and optimal delivery route planning.

    Baca Full Text klik disini
    [thumbnail of S_MAT_2106522_Title.pdf] Text
    S_MAT_2106522_Title.pdf
    Download (408kB)
    [thumbnail of S_MAT_2106522_Chapter1.pdf] Text
    S_MAT_2106522_Chapter1.pdf
    Download (349kB)
    [thumbnail of S_MAT_2106522_Chapter2.pdf] Text
    S_MAT_2106522_Chapter2.pdf
    Restricted to Staf Perpustakaan
    Download (442kB)
    [thumbnail of S_MAT_2106522_Chapter3.pdf] Text
    S_MAT_2106522_Chapter3.pdf
    Download (556kB)
    [thumbnail of S_MAT_2106522_Chapter4.pdf] Text
    S_MAT_2106522_Chapter4.pdf
    Restricted to Staf Perpustakaan
    Download (666kB)
    [thumbnail of S_MAT_2106522_Chapter5.pdf] Text
    S_MAT_2106522_Chapter5.pdf
    Download (360kB)
    [thumbnail of S_MAT_2106522_Appendix.pdf] Text
    S_MAT_2106522_Appendix.pdf
    Restricted to Staf Perpustakaan
    Download (4MB)
    Official URL: https://repository.upi.edu/
    Item Type: Thesis (S1)
    Additional Information: https://scholar.google.com/citations?hl=en&user=y2IQjkEAAAAJ ID SINTA Dosen Pembimbing: Khusnul Novianingsih: 258640 Dewi Rachmatin: 5975775
    Uncontrolled Keywords: Multiobjective Dynamic Vehicle Routing Problem, Particle Swarm Optimization, Time Seed, Optimisasi Multiobjective Dynamic Vehicle Routing Problem, Particle Swarm Optimization, Time Seed, Optimizaion
    Subjects: Q Science > QA Mathematics
    Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Q Science > QA Mathematics > QA76 Computer software
    Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Program Studi Matematika - S1 > Program Studi Matematika (non kependidikan)
    Depositing User: Karina Zahra Aqila
    Date Deposited: 13 Aug 2025 09:42
    Last Modified: 13 Aug 2025 09:42
    URI: http://repository.upi.edu/id/eprint/135472

    Actions (login required)

    View Item View Item