Implementasi Algoritma Discrete Particle Swarm Optimization Pada Permasalahan CVRP

Aisyahna Nurul Mauliddina (Department of Logistics Engineering, Pertamina University)
Faris Ahmad Saifuddin (Department of Logistics Engineering, Pertamina University)
Adesatya Lentera Nagari (Department of Logistics Engineering, Pertamina University)
Anak Agung Ngurah Perwira Redi (Department of Industrial Engineering-Binus Graduate Program, Binus University)
Adji Candra Kurniawan (Department of Logistics Engineering, Pertamina University)
Nanda Ruswandi (Department of Logistics Engineering, Pertamina University)

Jurnal Sistem dan Manajemen Industri
Vol. 4 No. 2 (2020)

Capacitated Vehicle Routing Problem (CVRP) is known as an NP-hard problem. It is because CVRP problems are very hard for finding optimal solutions, especially in large instances. In general, the NP-hard problem is difficult to solve in the exact method, so the metaheuristic approach is implemented in the CVRP problem to find a near-optimal solution in reasonable computational time. This research uses the DPSO algorithm for solving CVRP with ten instances of benchmark datasets. DPSO implementation uses tuning parameters with the One Factor at Time (OFAT) method to select the best DPSO parameters. The outcome objective function will be compared with several PSO models proposed in previous studies. Statistical test using One Way Reputed Measure ANOVA is needed to compare algorithm performance. First, ANOVA uses for comparing’s results. Then, ANOVA is also used to test DPSO’s performance compared with DPSO-SA, SR-1, and SR-2 algorithm. The computational result shows that the basic DPSO algorithm not competitive enough with other methods for solving CVRP.