OPTIMISASI CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) MENGGUNAKAN K-MEANS CLUSTERING DAN ALGORITMA PARTICLE SWARM OPTIMIZATION (PSO)

    Adam Siswanto, - and Khusnul Novianingsih, - and Ririn Sispiyati, - (2025) OPTIMISASI CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) MENGGUNAKAN K-MEANS CLUSTERING DAN ALGORITMA PARTICLE SWARM OPTIMIZATION (PSO). S1 thesis, Universitas Pendidikan Indonesia.

    Abstract

    Capacitated Vehicle Routing Problem (CVRP) adalah permasalahan optimasi dalam pendistribusian logistik, di mana sejumlah kendaraan dengan batas kapasitas tertentu harus melakukan perjalanan dari depot ke sejumlah pelanggan lalu kembali ke depot. Penelitian ini bertujuan untuk menentukan rute terpendek perjalanan kendaraan dalam pendistribusian es krim di Kota Bandung. Penelitian ini menggunakan gabungan metode K-Means Clustering dan algoritma Particle Swarm Optimization dengan fungsi tujuan meminimumkan total jarak tempuh kendaraan. Penelitian ini menggunakan data sekunder pada penelitian terdahulu. Proses dimulai dengan pengelompokan pelanggan menjadi beberapa klaster berdasarkan letak geografis menggunakan K-Means Clustering. Selanjutnya, algoritma Particle Swarm Optimization berbasis swap digunakan untuk menentukan rute optimal pada setiap klaster. Setelah Particle Swarm Optimization dilakukan pada setiap klaster, rute yang terbentuk pada setiap klaster kemudian digabungkan dan menjadi rute akhir yang optimal. Uji parameter dilakukan terhadap jumlah klaster, jumlah partikel, iterasi maksimal, dan parameter PSO lainnya untuk mendapatkan konfigurasi terbaik. Pada skenario optimal, total jarak minimum yang diperoleh adalah 185,889 km dengan menggunakan kombinasi parameter PSO yang optimal, yaitu jumlah klaster sebanyak 5, jumlah partikel sebesar 50 partikel, iterasi maksimal sebanyak 200, nilai koefisien c_1 dan c_2 keduanya 2, nilai momen inersia w sebesar 0,7. Hasil implementasi menunjukkan bahwa gabungan metode K-Means Clustering dan algoritma Particle Swarm Optimization dapat digunakan untukl menyelesaikan masalah pendistribusian es krim di Kota Bandung dengan menghasilkan rute distribusi yang optimal. The Capacitated Vehicle Routing Problem (CVRP) is an optimization problem in logistics distribution, where a number of vehicles with specific capacity limits must travel from a depot to several customers and then return to the depot. This study aims to determine the shortest vehicle route for ice cream distribution in the city of Bandung. This study employs a combination of the K-Means Clustering method and the Particle Swarm Optimization algorithm with an objective function to minimize the total distance traveled by vehicles. The study utilizes secondary data from previous research. The process begins with clustering customers into several groups based on their geographical locations using K-Means Clustering. Next, the swap-based Particle Swarm Optimization algorithm is used to determine the optimal route for each cluster. After Particle Swarm Optimization is performed on each cluster, the routes formed in each cluster are then combined to form the final optimal route. Parameter testing is conducted on the number of clusters, number of particles, maximum iterations, and other PSO parameters to obtain the best configuration. In the optimal scenario, the minimum total distance achieved is 185,889 km using the optimal combination of PSO parameters, namely 5 clusters, 50 particles, a maximum of 200 iterations, c_1and c_2coefficients both set to 2, and a moment of inertia w value of 0.7. The implementation results show that the combination of the K-Means Clustering method and the Particle Swarm Optimization algorithm can be used to solve the ice cream distribution problem in Bandung City by generating an optimal distribution route.

    Baca Full Text klik disini
    [thumbnail of S_MAT_2003917_Title.pdf] Text
    S_MAT_2003917_Title.pdf
    Download (1MB)
    [thumbnail of S_MAT_2003917_Chapter1.pdf] Text
    S_MAT_2003917_Chapter1.pdf
    Download (273kB)
    [thumbnail of S_MAT_2003917_Chapter2.pdf] Text
    S_MAT_2003917_Chapter2.pdf
    Restricted to Staf Perpustakaan
    Download (407kB)
    [thumbnail of S_MAT_2003917_Chapter3.pdf] Text
    S_MAT_2003917_Chapter3.pdf
    Download (576kB)
    [thumbnail of S_MAT_2003917_Chapter4.pdf] Text
    S_MAT_2003917_Chapter4.pdf
    Restricted to Staf Perpustakaan
    Download (1MB)
    [thumbnail of S_MAT_2003917_Chapter5.pdf] Text
    S_MAT_2003917_Chapter5.pdf
    Download (373kB)
    [thumbnail of S_MAT_2003917_Appendix.pdf] Text
    S_MAT_2003917_Appendix.pdf
    Restricted to Staf Perpustakaan
    Download (519kB)
    Official URL: https://repository.upi.edu/
    Item Type: Thesis (S1)
    Additional Information: https://scholar.google.com/citations?hl=en&user=nckEgAcAAAAJ ID SINTA Dosen Pembimbing: Khusnul Novianingsih: 258640 Ririn Sispiyati: 5986406
    Uncontrolled Keywords: Capacitated Vehicle Routing Problem, K-Means Clustering, optimisasi rute, distribusi Capacitated Vehicle Routing Problem, K-Means Clustering, route optimization, distribution
    Subjects: L Education > L Education (General)
    Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Program Studi Matematika - S1 > Program Studi Matematika (non kependidikan)
    Depositing User: Adam Siswanto
    Date Deposited: 21 Sep 2025 10:33
    Last Modified: 21 Sep 2025 10:33
    URI: http://repository.upi.edu/id/eprint/139931

    Actions (login required)

    View Item View Item