Determination of Optimal Route for Distribution of Rice Food Assistance in City X using the Cuckoo Search Algorithm
##plugins.themes.academic_pro.article.main##
Abstract
As distribution requirements become more complex, various VRP variants have been developed to address specific challenges. Among them, the Vehicle Routing Problem with Time Windows (VRPTW) adds the constraint that each customer must be served within a predefined time frame, making the routing process considerably more difficult. In this study, we propose a new approach that uses the Cuckoo Search (CS), a metaheuristic algorithm based on Lévy flights. This combination of Lévy flights and CS is designed to maximize exploration of optimal solutions while allowing dynamic route variations. This study aims to evaluate the effectiveness of this approach in optimizing rice food assistance distribution routes in City X. The exact method yielded a global optimum solution consisting of four routes with a minimum total distance of 222 km, requiring 2 hours 36 minutes 27 seconds of computation. In comparison, the cuckoo search algorithm also produced four routes, with a slightly longer total distance of 244 km but a significantly shorter computation time of 1 minute 39 seconds. This represents a difference of about 22 km (9.91%) from the exact solution, demonstrating that for VRPTW, the cuckoo search algorithm can generate near-optimal results with minimal deviation and substantially reduced computational effort.
##plugins.themes.academic_pro.article.details##
This work is licensed under a Creative Commons Attribution 4.0 International License.
Copyright (c): Eri Wirdianto, Muhamad Gustaffo Bintang, Farhan Azhari (2026)References
[2] D. Herdhiansyah, A. Yunissa, W. Gusmiarty, and A. Asriani, "Optimasi penentuan rute distribusi beras komersial Bulog menggunakan metode branch and bound dengan bantuan software lingo," AGROINTEK, vol. 17, no. 2, pp. 353-364, 2023.
[3] J. Nalepa and M. Blocho, "Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows," Soft Computing, vol. 20, pp. 2309–2327, 2016.
[4] I. Lukman, R. Hanafi, and S. M. Parenreng, "Optimasi biaya distribusi pada HFVRP menggunakan algoritma particle swarm optimization," JOSI: Jurnal Optimasi Sistem Industri, vol. 18, no. 2, pp. 164–175, 2019.
[5] P. Toth and D. Vigo, Vehicle routing: problems, methods, and applications, Second ed. Philadelphia: Society for Industrial and Applied Mathematics (SIAM), 2015.
[6] R. A. T. Saputro, Y. U. Kasanah, O. R. Marddani, and K. Niami, "Optimasi rute distribusi unggas berbasis network analysis-GIS menggunakan capacitated vehicle routing problem with time window pickup and delivery," Jurnal INTECH Teknik Industri Universitas Serang Raya, vol. 10, no. 1, pp. 51–60, 2024.
[7] T. D. C. Le, D. D. Nguyen, J. Oláh, and M. Pakurár, "Clustering algorithm for a vehicle routing problem with time windows," TRANSPORT, vol. 37, no. 1, pp. 17–27, 2022.
[8] W. Widayani, D. A. Pratama, R. D. Pratama, E. T. Kusumajaya, and A. Dharma, "Pemanfaatan metode heuristik travelling salesman problem with time windows pada rute antar jemput laundry dengan algoritma genetika," Jurnal Informatika Komputer, Bisnis, dan Manajemen, vol. 17, no. 1, pp. 1-10, 2019.
[9] K. Buhrkal, A. Larsen, and S. Ropke, "The waste collection vehicle routing problem with time windows in a city logistics context," Procedia Social and Behavioral Sciences, vol. 39, pp. 241-254, 2012.
[10] V. S. Kumar, M. R. Thansekhar, R. Saravanan, and S. M. J. Amali, "Solving multi-objective vehicle routing problem with time windows by FAGA," Procedia Engineering, vol. 97, pp. 2176-2185, 2014.
[11] M. Dubillard, X. Lorca, and M. Lauras, "An ant colony system for the skilled, multi-depot VRP with due dates and time windows," IFAC-PapersOnLine, vol. 56, no. 2, pp. 11129-11134, 2023.
[12] M. Alzaqebah, S. Abdullah, and S. Jawarneh, "Modified artificial bee colony for the vehicle routing problems with time windows," SpringerPlus, vol. 5, no. 1298, pp. 1-14, 2016.
[13] D. Muriyatmoko, A. Djunaidy, and A. Muklason, "Heuristics and metaheuristics for solving capacitated vehicle routing problem: an algorithm comparison," Procedia Computer Science, vol. 234, pp. 494-501, 2024.
[14] M. Iqbal, M. Zarlis, T. Tulus, and H. Mawengkang, "Model pendekatan metaheuristik dalam penyelesaian optimisasi kombinatorial," in Seminar Nasional Teknologi Komputer & Sains (SAINTEKS), Medan, 2020, pp. 92-97: STMIK Budi Darma.
[15] A. F. R. Silva, A. T. Pozos, D. A. Martinez, and J. W. Escobar, "An iterated local search based approach for a real rich vehicle routing problem with time windows," Computers & Industrial Engineering, vol. 208, pp. 1-15, 2025.
[16] E. Wirdianto, D. Regenie, and Wisnel, "Aplikasi algoritma hybrid dalam penentuan rute pendistribusian produk (studi kasus: PT. Enseval Putera Megatrading)," Jurnal Optimasi Sistem Industri, vol. 15, no. 2, pp. 171-180, 2016.
[17] I. H. Muna, "Performansi analisis algoritma koloni semut (ant colony optimization) dalam menyelesaikan permasalahan capacitated vehicle routing problem (CVRP)," SCIENCE TECH: Jurnal Ilmu Pengetahuan dan Teknologi, vol. 8, no. 2, pp. 98-112, 2022.
[18] F. Setiawan, N. A. Masruroh, and Z. I. Pramuditha, "On modelling and solving heterogeneous vehicle routing problem with multi-trips and multi-products," Jurnal Teknik Industri, vol. 21, no. 2, pp. 91–104, 2019.
[19] A. Nurhayati, "Perbandingan algoritma cuckoo search krill herd (CSKH) dan levy-flight krill herd (LKH)," in Seminar Nasional Telekomunikasi dan Informatika (SELISIK) Bandung, 2018, pp. 448-453: Sekolah Tinggi Teknologi Bandung.
[20] J. H. Santillan, S. Tapucar, C. Manliguez, and V. Calag, "Cuckoo search via Lévy flights for the capacitated vehicle routing problem," Journal of Industrial Engineering International, vol. 14, pp. 293–304, 2018.
[21] S. Shiralkar, A. Bahulekar, and S. Jawade, "The cuckoo search algorithm: a review," International Research Journal of Engineering and Technology (IRJET), vol. 9, no. 8, pp. 1238-1246, 2022.