The ant colony metaheuristic in solving a route problem. case study
Main Article Content
Abstract
The research study is oriented to a routing problem on the collection of visitors installed in hotels in the city of Huaraz from a parking place, it will be transported to tourist destinations in the Ancash region using the metaheuristic ant colony inspired by the behavior of ants and the emission of the pheromone substance when they leave in search of their food, it allows to simulate with artificial ants and the probability, in order to design a minimum route system by means the length. A descriptive, non-experimental and quantitative study was carried out based on 6 vertex points, between the parking place and 5 hotels. The analysis of the study resulting from the application to a practical case reveals that considering all the vertex points starting salesman problem, 720 routes were generated, as possibilities study, and if a vertex point were established 120 possible routes were generated, even so, it is relatively arduous; 46 routes in the latter case would all turn out to be different. The result of the minimum travel route is the combination 1234561 with 3909 m.
Article Details
References
Garrido, A. (2010). Planeamiento del transporte de clientes turísticos en Huaraz bajo un enfoque multicriterio. Escuela de Postgrado. Universidad Nacional Santiago Antúnez de Mayolo, 72-73. Disponible en: http://repositorio.unasam.edu.pe/handle/UNASAM/884.
Juvvala, R., & Sarmah, S. P. (2021). Evaluation of policy options supporting electric vehicles in city logistics: a case study. Sustainable Cities and Society, 74, 103209. https://doi.org/10.1016/j.scs.2021.103209.
Li-Chih L., Tai-Wen Y. (2019). Missionoriented ant-team ACO for min-max MTSP. Department of Computer Science and Engineering, Tatung University, N°40. Taipei, Taiwan. https://doi.org/10.1016/j.asoc.2018.11.048.
Lin, P., Contreras, M., Dai, R., Zhang, J. (2016). A multinivel ACO approach for solving forest transportation planning problems with environmental constraints. Department of Mathematics, Statistic and Computer Science, University of Wisconsin-Stout, Menomonie, USA. DOI: 10.1016/j.swevo.2016.01.003.
Nguyen, T., Jung, J. (2021). Ant colony optimization-based traffic routing with intersection negotiation for connected vehicles. Department of Computer Engineering, Chung-Ang University, Dongjak, Republico of Korea. https://doi.org/10.1016/j.asoc.2021.107828.
T Srinivas Rao (2018). An Evaluation of ACO and GA TSP in a Supply Chain Network. School of Engineering, Amrita Vishwavidyapeetham, India. https://doi.org/10.1016/j.matpr.2018.10.338.