This work is licensed under a Creative Commons Attribution 4.0 International License
Abstract
This paper aims to identify automotive routing problems using genetic algorithms. It will also find an appropriateroute for the automotive industry to serve customers. Road and distance are very important for a routing problem. Genetic algorithms will reduce the distance, minimize time, and savethe drivers’ working hours. It will play a crucial role in preventing accidents. The automotive routing problem has wide applications in logistics and transportation and is of growingeconomic importance. And reducing distance and time will surely contribute to the economy. There are a variety of heuristics and approach-based solutions accessible for specific conditions and various restrictions of the automotive routing problem, but precise solutions to the problem are not possible because of the high computation time requirement. Meta-heuristic algorithms, as well as genetic algorithms, are selected to solve the introduced problem.
Keywords:Vehicle Routing Problem (VRP), Genetic algorithm, Meta heuristic algorithm, Automotive routing problem.
Author Biographies
References
[1] G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science, vol. 6, no. 1, pp. 80–91, 1959.
[2] L. Wen and R. Eglese, “Minimum cost vrp with time-dependent speed data and congestion charge,” Computers & Operations Research, vol. 56, pp. 41–50, 2015.
[3] H. Kurnia, E. G. Wahyuni, E. C. Pembrani, S. T. Gardini, and S. K. Aditya, “Vehicle routing problem using genetic algorithm with multi-compartment on vegetable distribution,” in IOP Conference Series: Materials Science and Engineering, vol. 325, no. 1. IOP Publishing, 2018, p. 012012.
[4] A. Hannawati et al., “Pencarian rute optimum menggunakan algoritma genetika,” Jurnal Teknik Elektro, vol. 2, no. 2, 2002.
[5] W. F. Mahmudy, “Optimasi fungsi tak berkendala menggunakan algoritma genetika terdistribusi dengan pengkodean real,” in Seminar Nasional Basic Science VI, Universitas Brawijaya, Malang, 2009, pp. 1–5.
[6] Z. Michalewicz, D. Dasgupta, R. G. Le Riche, and M. Schoenauer, “Evolutionary algorithms for constrained engineering problems,” Computers & Industrial Engineering, vol. 30, no. 4, pp. 851–870, 1996.
[7] A. K. Agrawal, S. Yadav, A. A. Gupta, and S. Pandey, “A genetic algorithm model for optimizing vehicle routing problems with perishable products under time-window and quality requirements,” Decision Analytics Journal, vol. 5, p. 100139, 2022.
[8] B. Hermansyah, “Penyelesaian vehicle routing problem (vrp) menggunakan algoritma genetika,” Ph.D. dissertation, Universitas Islam Negeri Sultan Syarif Kasim Riau, 2011.
[9] W. Tanujaya, D. R. S. Dewi, and D. Endah, “Penerapan algoritma genetik untuk penyelesaian masalah vehicle routing di pt. mif,” Widya Teknik, vol. 10, no. 1, pp. 92–102, 2013.
[10] M. Rabbani, Z. Tahaei, H. Farrokhi-Asl, and N. A. Saravi, “Using meta-heuristic algorithms and hybrid of them to solve multi-compartment vehicle routing problem,” in 2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2017, pp. 1022–1026.
[11] Y.-Z. Liu and H.-Y. Xuan, “Overview on the vehicle routing problem model and algorithm [j],” Journal of Management Engineering, vol. 2005, no. 1, pp. 124–127, 2005.
[12] G. Nagy and S. Salhi, “Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries,” European Journal of Operational Research, vol. 162, no. 1, pp. 126–141, 2005.
[13] T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, “Heuristics for multi-attribute vehicle routing problems: A survey and synthesis,” European Journal of Operational Research, vol. 231, no. 1, pp. 1–21, 2013.
[14] G. Laporte, “The vehicle routing problem: An overview of exact and approximate algorithms Mercedes,” European Journal of Operational Research, vol. 59, no. 3, pp. 345–358, 1992.
[15] M. A. Juárez Pérez, R. E. Pérez Loaiza, P. M. Quintero Flores, O. Atriano Ponce, and C. Flores Peralta, “A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in mexico,” Algorithms, vol. 12, no. 5, p. 111, 2019.
[16] A. K. M. Masum, M. Shahjalal, F. Faruque, and I. Sarker, “Solving the vehicle routing problem using genetic algorithm,” International Journal of Advanced Computer Science and Applications, vol. 2, no. 7, pp. 126–131, 2011.
[17] M. A. Mohammed, M. K. Abd Ghani, R. I. Hamed, S. A. Mostafa, M. S. Ahmad, and D. A. Ibrahim, “Solving vehicle routing problem by using improved genetic algorithm for optimal solution Mercedes,” Journal of Computational Science, vol. 21, pp. 255–262, 2017.
[18] H. Nazif and L. S. Lee, “Optimised crossover genetic algorithm for capacitated vehicle routing problem,” Applied Mathematical Modelling, vol. 36, no. 5, pp. 2110–2117, 2012.
[19] W. Ho, G. T. Ho, P. Ji, and H. C. Lau, “A hybrid genetic algorithm for the multi-depot vehicle routing problem,” Engineering Applications of Artificial Intelligence, vol. 21, no. 4, pp. 548–557, 2008.
[20] Z. Ursani, D. Essam, D. Cornforth, and R. Stocker, “Localized genetic algorithm for vehicle routing problem with time windows,” Applied Soft Computing, vol. 11, no. 8, pp. 5375–5390, 2011.
[21] K. Q. Zhu, “A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows,” in Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence. IEEE, 2003, pp. 176–183.
[22] K. Q. Zhu, “A new genetic algorithm for vrptw,” in Proceedings of the International Conference on Artificial Intelligence. Citeseer, 2000.
[23] S. Afifi, R. N. Guibadj, and A. Moukrim, “New lower bounds on the number of vehicles for the vehicle routing problem with time windows,” in International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research Mercedes. Springer, 2014, pp. 422–437.
[24] A. K. M. Masum, M. Shahjalal, F. Faruque, and I. Sarker, “Solving the vehicle routing problem using genetic algorithm,” International Journal of Advanced Computer Science and Applications, vol. 2, no. 7, pp. 126–131, 2011.
[25] M. A. Mohammed, M. K. Abd Ghani, R. I. Hamed, S. A. Mostafa, M. S. Ahmad, and D. A. Ibrahim, “Solving vehicle routing problem by using improved genetic algorithm for optimal solution Mercedes Mercedes,” Journal of Computational Science, vol. 21, pp. 255–262, 2017.
[26] H. Nazif and L. S. Lee, “Optimised crossover genetic algorithm for capacitated vehicle routing problem,” Applied Mathematical Modelling, vol. 36, no. 5, pp. 2110–2117, 2012.
[27] W. Ho, G. T. Ho, P. Ji, and H. C. Lau, “A hybrid genetic algorithm for the multi-depot vehicle routing problem,” Engineering Applications of Artificial Intelligence, vol. 21, no. 4, pp. 548–557, 2008.
[28] Y. Marinakis, A. Migdalas, and P. M. Pardalos, “A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm,” Journal of Global Optimization, vol. 38, no. 4, pp. 555–580, 2007.
[29] A. S. Tasan and M. Gen, “A genetic algorithm based approach to vehicle routing problem with simultaneous pickup and deliveries Mercedes,” Computers & Industrial Engineering, vol. 62, no. 3, pp. 755–761, 2012.
[30] B. M. Baker and M. Ayechew, “A genetic algorithm for the vehicle routing problem,” Computers & Operations Research, vol. 30, no. 5, pp. 787–800, 2003.
[31] J. Ochelska-Mierzejewska, A. Poniszewska-Marańda, and W. Marańda, “Selected genetic algorithms for vehicle routing problem solving,” Electronics, vol. 10, no. 24, p. 3147, 2021.
[32] M. Abbasi, M. Rafiee, M. R. Khosravi, A. Jolfaei, V. G. Menon, and J. M. Koushyar, “An efficient parallel genetic algorithm solution for vehicle routing problem in cloud implementation of the intelligent transportation systems,” Journal of Cloud Computing, vol. 9, pp. 1–14, 2020.
[33] A. S. Slamet, H. H. Siregar, and A. K. TIP, “Vehicle routing problem (vrp) dengan algoritma genetika pada pendistribusian sayuran dataran tinggi,” Jurnal Teknologi Industri Pertanian, vol. 24, no. 1, 2014.
