Optimization of Vehicle Routing Problem with Time Windows (VRPTW) with Hybrid Dragonfly Algorithm Approach on Delivery Routes
DOI:
https://doi.org/10.30871/jaic.v10i2.11937Keywords:
Product distribution, Route Optimization, VRPTW, Nearest Neihgbor, Dragonfly AlgorithmAbstract
Efficient product distribution is a critical component of supply chain management, especially for small-scale business that operate under limited vehicle capacity and strict delivery time constraints. This research focused on solving the Vehicle Routing Problem with Time Windows (VRPTW) by applying a hybrid optimization strategy that integrates the Nearest Neighbor (NN) method and Dragonfly Algorithm (DA) to reduce total travel distance while ensuring compliance with capacity and time windows requirements. In that proposed approach, the Nearest Neighbor method is utilized to construct an initial feasible route based on proximity considerations, whereas the Dragonfly Algorithm is employed to enhance the route configuration through balanced exploration and exploitation processes. The effectiveness of the hybrid method is evaluated using real contribution data obtained from HoneyBee Bakery & Cake, a small-cake bakery enterprise located in Palembang, Indonesia. The experimental results indicate that the Nearest Neighbor method generates an initial route with a total distance of 72.54 km. After applying the hybrid NN–DA optimization, the total travel distance is reduced to 62.65 km, achieving a reduction of 9.89 km or an efficiency improvement of 13.64%, without increasing the number of vehicles used. Furthermore, the parameter sensitivity analysis reveals that variations in the number of dragonflies and iterations have a considerable impact on solution quality and convergence behavior. Overall, the findings confirm that the proposed hybrid method offers an effective and practical solution for VRPTW in real-world distribution contexts. Additionally, a web-based application is developed to support route optimization and data processing, enabling easier adoption by non-technical users in small-scale distribution environments.
Downloads
References
[1] A. H. Mirza and D. Irawan, “Implementasi Metode Saving Matrix Pada Sistem Informasi Distribusi Barang,” Jurnal Ilmiah MATRIK, vol. 22, no. 3.
[2] “Pasaribu & Rizal (2021)”.
[3] A. M. Golmohammadi, H. Abedsoltan, A. Goli, and I. Ali, “Multi-objective dragonfly algorithm for optimizing a sustainable supply chain under resource sharing conditions,” Comput. Ind. Eng., vol. 187, Jan. 2024, doi: 10.1016/j.cie.2023.109837.
[4] P. Alamsyah and J. Arifin, “Analisis Pendistribusian Produk Kepada Konsumen Menggunakan Metode Nearest Neighbor di PT. Bukit Muria Jaya.”
[5] M. Mafarja, A. A. Heidari, H. Faris, S. Mirjalili, and I. Aljarah, “Dragonfly algorithm: Theory, literature review, and application in feature selection,” in Studies in Computational Intelligence, vol. 811, Springer Verlag, 2020, pp. 47–67. doi: 10.1007/978-3-030-12127-3_4.
[6] J. Halim, R. M. Heryanto, and D. T. Liputra, “Penentuan Rute Distribusi Menggunakan Metode Savings Matrix dengan Algoritma Nearest Insert, Nearest Neighbour, dan Farthest Insert pada UMKM Peralatan Plastik,” Go-Integratif : Jurnal Teknik Sistem dan Industri, vol. 4, no. 01, pp. 33–47, May 2023, doi: 10.35261/gijtsi.v4i01.8727.
[7] W. Zulkarnaen, I. Dewi Fitriani, N. Yuningsih, S. Muhammadiyah Bandung, and S. Tasikmalaya, “Pengembangan Supply Chain Management Dalam Pengelolaan Distribusi Logistik Pemilu Yang Lebih Tepat Jenis, Tepat Jumlah Dan Tepat Waktu Berbasis Human Resources Competency Development Di Kpu Jawa Barat,” vol. 4, no. 2, 2020.
[8] M. Lukman, H. Anak, A. Sagung, M. Mahachandra, and J. Mertha, “Analisis Perbaikan Keterlambatan Pengiriman Produk Dengan Metode Six Sigma (Studi Kasus: Dsp Plumpang, Pt Pertamina Lubricant).”
[9] E. Putra Jaya, U. Islam Negeri Sulthan Thaha Saifuddin Jambi Sissah, U. Islam Negeri Sulthan Thaha Saifuddin Jambi Agusriandi, and U. Islam Negeri Sulthan Thaha Saifuddin Jambi, “Analisis Saluran Distribusi Produk Cv. Adila Snack Jambi,” vol. 2, no. 2, pp. 410–422, 2024, doi: 10.61722/jiem.v2i2.981.
[10] D. Nurma Heitasari and M. Kemal Ghifari, “Perbandingan Metode Round Trip Time & Vehicle Routing Problem Time Windows Dalam Pemilihan Supply Point Pada Proses Distribusi Pertashop,” 2022.
[11] Q. Wu et al., “A neighborhood comprehensive learning particle swarm optimization for the vehicle routing problem with time windows,” Swarm Evol. Comput., vol. 84, Feb. 2024, doi: 10.1016/j.swevo.2023.101425.
[12] S. Mirjalili, “Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems,” Neural Comput. Appl., vol. 27, no. 4, pp. 1053–1073, May 2016, doi: 10.1007/s00521-015-1920-1.
[13] H. Li and S. K. Kim, “Efficient Route Planning for Real-Time Demand-Responsive Transit,” Computers, Materials and Continua, vol. 79, no. 1, pp. 473–492, 2024, doi: 10.32604/cmc.2024.048402.
[14] A. Maroof, B. Ayvaz and K. Naeem, "Logistics Optimization Using Hybrid Genetic Algorithm (HGA): A Solution to the Vehicle Routing Problem With Time Windows (VRPTW)," in IEEE Access, vol. 12, pp. 36974-36989, 2024, doi: 10.1109/ACCESS.2024.3373699.
[15] Y. Yunita, D. Stiawan and D. P. Rini, "Vehicle Routing Problem with Time Windows using Hybrid Metaheuristic Dragonfly Algorithm and Variable Neighborhood Search: Work on Progress," 2024 11th International Conference on Electrical Engineering, Computer Science and Informatics (EECSI), Yogyakarta, Indonesia, 2024, pp. 521-525, doi: 10.1109/EECSI63442.2024.10776058.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Muhammad Rizky Ramadhian Putra, Yunta Yunta
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) ) that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
