Abstract
This paper presents the development of a hybrid approach as a solution to the multiple Traveling Salesman Problem (mTSP) applied to the route scheduling for self-drive cars. First, we use k-means to generate routes that equality distribute delivery locations among the cars. Then, these routes are set as the initial population for bio-inspired algorithms, such as Genetic Algorithm (GA) and Ant Colony System (ACS), that perform an evolutionary process in order to find a route which minimizes the overall distance while keeping the balance of individual tours of each car. The experiments were conducted with our route scheduling system in real and virtual environments. We compared our hybrid approaches using k-means in conjunction with GA and ACS against GA, ACS and Particle Swarm Optimization (PSO) initialized with random population. The results showed that, as the number of cars and target locations increase, the hybrid approaches outperform GA, ACS and PSO without any pre-processing.
Supported by the University of São Paulo, Federal University of Uberlândia, and by the CNPq under Grant 400699/2016-8.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Alves, R.M.F., Lopes, C.R.: Using genetic algorithms to minimize the distance and balance the routes for the multiple traveling salesman problem. In: Congress on Evolutionary Computation (CEC). IEEE (2015)
Angel, R.D., Caudle, W.L., Noonan, R., Whinston, A.: Computer-assisted school bus scheduling. Manag. Sci. 18(6), 279–288 (1972)
Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. J. Oper. Res. Soc. 20(3), 309–318 (1969)
Clerc, M.: Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, vol. 141. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-39930-8_8
Davendra, D.: Traveling Salesman Problem. Theory and Applications (2010). https://doi.org/10.5772/547
Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1, 53–66 (1997)
Fernandes, L.C., et al.: Carina intelligent robotic car: architectural design and applications. J. Syst. Archit. - Embedded Syst. Des. 60, 372–392 (2014)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Boston (1989)
Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651–666 (2010). https://doi.org/10.1016/j.patrec.2009.09.011
Kocyigit, E., Sahingoz, O.K., Diri, B.: An evolutionary approach to multiple traveling salesman problem for efficient distribution of pharmaceutical products. In: 2020 International Conference on Electrical Engineering (ICEE), pp. 1–7. IEEE (2020)
Orloff, C.S.: Routing a fleet of m vehicles to/from a central facility. Networks 4(2), 147–162 (1974)
Ozmen, M., Sahin, H.: Real-time optimization of school bus routing problem in smart cities using genetic algorithm. In: 2021 6th International Conference on Inventive Computation Technologies (ICICT), pp. 1152–1158. IEEE (2021)
Sathya, N., Muthukumaravel, A.: Two phase hybrid AI-heuristics for multiple travelling salesman problem. Int. J. Appl. Eng. Res. 12, 12659–12664 (2017)
Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29, 17–29 (1995)
Xu, X., Yuan, H., Liptrott, M., Trovati, M.: Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Comput. 22, 6567–6581 (2018)
Yang, C., Szeto, K.Y.: Solving the traveling salesman problem with a multi-agent system. In: Congress on Evolutionary Computation (CEC). IEEE (2019)
Acknowledgements
This work was supported by the University of São Paulo, Federal University of Uberlândia, and by the CNPq under Grant 400699/2016-8.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Silva, C.E. et al. (2022). Route Scheduling System for Multiple Self-driving Cars Using K-means and Bio-inspired Algorithms. In: Iliadis, L., Jayne, C., Tefas, A., Pimenidis, E. (eds) Engineering Applications of Neural Networks. EANN 2022. Communications in Computer and Information Science, vol 1600. Springer, Cham. https://doi.org/10.1007/978-3-031-08223-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-08223-8_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-08222-1
Online ISBN: 978-3-031-08223-8
eBook Packages: Computer ScienceComputer Science (R0)