Visualisasi Rute Vehicle Routing Problem Menggunakan Open Route Service sebagai Platform Geospasial
Keywords:
Open Route Service, Visualisasi Geospasial, Vehicle Routing Problem, Optimasi RuteAbstract
Vehicle Routing Problem (VRP) merupakan permasalahan logistik klasik yang berfokus pada penentuan rute optimal untuk armada kendaraan guna memenuhi permintaan pelanggan dengan efisiensi maksimum. Meskipun berbagai algoritma telah digunakan untuk menyelesaikan permasalahan ini, integrasi teknologi visualisasi rute berbasis geospasial masih belum banyak diterapkan secara komprehensif. Penelitian ini mengusulkan pemanfaatan OpenRouteService (ORS) sebagai platform visualisasi geospasial yang terintegrasi dalam model VRP multi-kendaraan. Dengan menggunakan data permintaan pelanggan dan jarak antar titik, solusi rute yang dihasilkan oleh algoritma optimasi diubah ke dalam bentuk visual interaktif berbasis peta menggunakan API dari ORS. Studi kasus dilakukan pada sistem distribusi PT Pos Indonesia wilayah Boyolali, yang mencakup 19 titik pengantaran. Hasil penelitian menunjukkan bahwa integrasi ORS tidak hanya mempercepat interpretasi hasil optimasi rute oleh pengambil keputusan, tetapi juga meningkatkan akurasi spasial dan komunikasi logistik di lapangan. Visualisasi rute ini mendukung proses validasi operasional serta mempermudah penyesuaian terhadap kendala nyata di medan. Penelitian ini berkontribusi dalam pengembangan solusi logistik berbasis teknologi terbuka dan menyarankan integrasi platform visualisasi seperti ORS dalam sistem perencanaan distribusi modern.References
[1] P. Toth and D. Vigo, “An Overview of Vehicle Routing Problems,” in The Vehicle Routing Problem, Society for Industrial and Applied Mathematics, 2002, pp. 1–26.
[2] S. Wang, F. Tao, Y. Shi, and H. Wen, “Optimization of Vehicle Routing Problem with Time Windows for Cold Chain Logistics Based on Carbon Tax,” Sustainability, vol. 9, no. 5, p. 694, Apr. 2017, doi: 10.3390/su9050694.
[3] P. Lou, Z. Zhou, Y. Zeng, and C. Fan, “Vehicle routing problem with time windows and carbon emissions: a case study in logistics distribution,” Environ. Sci. Pollut. Res., vol. 31, no. 29, pp. 41600–41620, Feb. 2024, doi: 10.1007/s11356-024-31927-9.
[4] K. Danach, L. Saker, and H. Harb, “Integrating Metaheuristics and Machine Learning for Enhanced Vehicle Routing: A Comparative Study of Hyperheuristic and VAE-Based Approaches,” World Electr. Veh. J., vol. 16, no. 5, p. 258, May 2025, doi: 10.3390/wevj16050258.
[5] M. EL YADARI, F. JAWAB, and I. MOUFAD, “A Supervised Learning and Metaheuristic Approach for Energy-Efficient Vehicle Routing Problem: Model Development and Empirical Case Validation.” 2024, doi: 10.2139/ssrn.5072833.
[6] J. Vinueza-Martinez, M. Correa-Peralta, R. Ramirez-Anormaliza, O. Franco Arias, and D. Vera Paredes, “Geographic Information Systems (GISs) Based on WebGIS Architecture: Bibliometric Analysis of the Current Status and Research Trends,” Sustainability, vol. 16, no. 15, p. 6439, Jul. 2024, doi: 10.3390/su16156439.
[7] Heidelberg Institute for Geoinformation Technology (HeiGIT), “OpenRouteService (Version 9.1.1),” 2024. https://openrouteservice.org (accessed Jun. 23, 2025).
[8] X. dong Chen and G. Kalra, “Research on regional spatial logistics information integration method based on big data,” Int. J. Inf. Technol. Manag., vol. 20, no. 3, p. 234, 2021, doi: 10.1504/IJITM.2021.116049.
[9] M. Ary, “Optimasi Vehicle Routing Problem Pada Rute Pendistribusian Menggunakan Metode Ant Colony Optimization,” J. Tekno Insentif, vol. 16, no. 2, pp. 139–149, Dec. 2022, doi: 10.36787/jti.v16i2.897.
[10] H. Ishibuchi, N. Akedo, H. Ohyanagi, and Y. Nojima, “Behavior of EMO algorithms on many-objective optimization problems with correlated objectives,” 2011 IEEE Congr. Evol. Comput. CEC 2011, no. 20300084, pp. 1465–1472, 2011, doi: 10.1109/CEC.2011.5949788.
[11] P. Toth and D. Vigo, “An Overview of Vehicle Routing Problems,” in The Vehicle Routing Problem, vol. 2007-Janua, P. Toth and D. Vigo, Eds. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2002, pp. 1–26.
[12] M. Dorigo and G. Di Caro, “Ant colony optimization: A new meta-heuristic,” in Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, 1999, vol. 2, pp. 1470–1477, doi: 10.1109/CEC.1999.782657.
[13] J. Jo and K.-W. Lee, “High-Performance Geospatial Big Data Processing System Based on MapReduce,” ISPRS Int. J. Geo-Information, vol. 7, no. 10, p. 399, Oct. 2018, doi: 10.3390/ijgi7100399.
[14] S. H. Huang, Y. H. Huang, H. C. Lee, and Y. Y. Tong, “A new hybrid algorithm for solving the vehicle routing problem with route balancing,” Int. J. Ind. Eng. Manag., vol. 14, no. 1, pp. 51–62, 2023, doi: 10.24867/IJIEM-2023-1-324.
[15] E. Osaba, X.-S. Yang, F. Diaz, P. Lopez-Garcia, and R. Carballedo, “An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems,” Eng. Appl. Artif. Intell., vol. 48, pp. 59–71, Feb. 2016, doi: 10.1016/j.engappai.2015.10.006.
[16] G. Srivastava, A. Singh, and R. Mallipeddi, “NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows,” Expert Syst. Appl., vol. 176, p. 114779, Aug. 2021, doi: 10.1016/j.eswa.2021.114779.
[2] S. Wang, F. Tao, Y. Shi, and H. Wen, “Optimization of Vehicle Routing Problem with Time Windows for Cold Chain Logistics Based on Carbon Tax,” Sustainability, vol. 9, no. 5, p. 694, Apr. 2017, doi: 10.3390/su9050694.
[3] P. Lou, Z. Zhou, Y. Zeng, and C. Fan, “Vehicle routing problem with time windows and carbon emissions: a case study in logistics distribution,” Environ. Sci. Pollut. Res., vol. 31, no. 29, pp. 41600–41620, Feb. 2024, doi: 10.1007/s11356-024-31927-9.
[4] K. Danach, L. Saker, and H. Harb, “Integrating Metaheuristics and Machine Learning for Enhanced Vehicle Routing: A Comparative Study of Hyperheuristic and VAE-Based Approaches,” World Electr. Veh. J., vol. 16, no. 5, p. 258, May 2025, doi: 10.3390/wevj16050258.
[5] M. EL YADARI, F. JAWAB, and I. MOUFAD, “A Supervised Learning and Metaheuristic Approach for Energy-Efficient Vehicle Routing Problem: Model Development and Empirical Case Validation.” 2024, doi: 10.2139/ssrn.5072833.
[6] J. Vinueza-Martinez, M. Correa-Peralta, R. Ramirez-Anormaliza, O. Franco Arias, and D. Vera Paredes, “Geographic Information Systems (GISs) Based on WebGIS Architecture: Bibliometric Analysis of the Current Status and Research Trends,” Sustainability, vol. 16, no. 15, p. 6439, Jul. 2024, doi: 10.3390/su16156439.
[7] Heidelberg Institute for Geoinformation Technology (HeiGIT), “OpenRouteService (Version 9.1.1),” 2024. https://openrouteservice.org (accessed Jun. 23, 2025).
[8] X. dong Chen and G. Kalra, “Research on regional spatial logistics information integration method based on big data,” Int. J. Inf. Technol. Manag., vol. 20, no. 3, p. 234, 2021, doi: 10.1504/IJITM.2021.116049.
[9] M. Ary, “Optimasi Vehicle Routing Problem Pada Rute Pendistribusian Menggunakan Metode Ant Colony Optimization,” J. Tekno Insentif, vol. 16, no. 2, pp. 139–149, Dec. 2022, doi: 10.36787/jti.v16i2.897.
[10] H. Ishibuchi, N. Akedo, H. Ohyanagi, and Y. Nojima, “Behavior of EMO algorithms on many-objective optimization problems with correlated objectives,” 2011 IEEE Congr. Evol. Comput. CEC 2011, no. 20300084, pp. 1465–1472, 2011, doi: 10.1109/CEC.2011.5949788.
[11] P. Toth and D. Vigo, “An Overview of Vehicle Routing Problems,” in The Vehicle Routing Problem, vol. 2007-Janua, P. Toth and D. Vigo, Eds. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2002, pp. 1–26.
[12] M. Dorigo and G. Di Caro, “Ant colony optimization: A new meta-heuristic,” in Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, 1999, vol. 2, pp. 1470–1477, doi: 10.1109/CEC.1999.782657.
[13] J. Jo and K.-W. Lee, “High-Performance Geospatial Big Data Processing System Based on MapReduce,” ISPRS Int. J. Geo-Information, vol. 7, no. 10, p. 399, Oct. 2018, doi: 10.3390/ijgi7100399.
[14] S. H. Huang, Y. H. Huang, H. C. Lee, and Y. Y. Tong, “A new hybrid algorithm for solving the vehicle routing problem with route balancing,” Int. J. Ind. Eng. Manag., vol. 14, no. 1, pp. 51–62, 2023, doi: 10.24867/IJIEM-2023-1-324.
[15] E. Osaba, X.-S. Yang, F. Diaz, P. Lopez-Garcia, and R. Carballedo, “An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems,” Eng. Appl. Artif. Intell., vol. 48, pp. 59–71, Feb. 2016, doi: 10.1016/j.engappai.2015.10.006.
[16] G. Srivastava, A. Singh, and R. Mallipeddi, “NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows,” Expert Syst. Appl., vol. 176, p. 114779, Aug. 2021, doi: 10.1016/j.eswa.2021.114779.
