Aplicación del algoritmo de optimización por colonia de hormigas (aco) en la optimización de rutas urbanas: un estudio de caso in silico

Simple item page
dc.contributor.authorMarcillo Vera , Fabricio Rolando
dc.contributor.authorMeza Vizuete , Anderson Joel
dc.contributor.authorVelez Villagomez , Argel Antonio
dc.contributor.authorToscano Araque , Sebastián
dc.contributor.authorCevallos Cedeño , Kenneth Alava
dc.contributor.authorGómez Andy , Gustavo Roldan
dc.contributor.authorPosligua , Andy Daniel
dc.date.accessioned2026-07-15T15:50:16Z
dc.date.available2026-07-15T15:50:16Z
dc.date.issued2026
dc.date.issued25/12/2025
dc.description.abstractThis study examined how the Ant Colony Optimization (ACO) algorithm could be used to improve urban route planning, using a simulation based on the classic Traveling Salesman Problem (TSP). Four city locations were represented using Cartesian coordinates, and the distances between them were calculated with the Euclidean formula. The experiment was conducted in Python 3.13.0, applying NetworkX and Matplotlib for modeling and visualization. The ACO algorithm was configured with four ants and ten iterations, using standard parameters such as pheromone importance, evaporation rate, and heuristic influence. The results showed that the ants generated distinct routes. The Argel Velez Villagomez Escuela de Hábitat, Infraestructura y Creatividad Pontificia Universidad Católica del Ecuador, sede Santo Domingo Santo Domingo, Ecuador aavelezv@pucesd.edu.ec Andy Alava Gomez Escuela de Hábitat, Infraestructura y Creatividad Pontificia Universidad Católica del Ecuador, sede Santo Domingo Santo Domingo, Ecuador agalava@pucesd.edu.ec Optimization, Traveling Salesman Problem (TSP) and Urban Transportation Planning. I. INTRODUCTION most efficient path—C4, C3, C1, C2, C4—was identified early in the process, with a total length of 241.45 km. The variability in the solutions highlighted ACO’s ability to explore multiple possibilities within the search space. Compared to other heuristic techniques like Genetic Algorithms, Tabu Search, or Simulated Annealing, ACO showed a more flexible and stable performance, particularly in dynamic urban environments. These qualities suggest that ACO could be a valuable approach for tackling routing problems in cities, especially when conditions such as traffic or delivery constraints are in constant change. While results were promising, future research is encouraged to evaluate ACO in more complex urban scenarios and explore how tuning its parameters might enhance its performance in real-world applications.
dc.id.author1715772354
dc.id.author2351074105
dc.id.author1317750949
dc.id.author2300411549
dc.id.author2350192205
dc.identifier.citationVera, F. M., Vizuete, A. M., Villagomez, A. V., Araque, S. T., Cedeño, K. C., Gomez, A. A., & Posligua, A. R. (2025). Application of the Ant Colony Optimization algorithm (ACO) in urban route optimization: An in silico case study. In ETCM 2025 - 9th Ecuador Technical Chapters Meeting (ETCM 2025 - 9th Ecuador Technical Chapters Meeting). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ETCM67548.2025.11304304
dc.identifier.doi10.1109/ETCM67548.2025.11304304
dc.identifier.issn2025
dc.identifier.urihttps://repositorio.puce.edu.ec/handle/123456789/49334
dc.indexed.databaseScopus
dc.language.isoen
dc.magazine.pageRange1-5
dc.magazine.titleCódigo Científico Revista de Investigación
dc.magazine.volumeChapter2025
dc.statePublished
dc.subjectColony
dc.subjectOptimization
dc.subjectMetaheuristic
dc.titleAplicación del algoritmo de optimización por colonia de hormigas (aco) en la optimización de rutas urbanas: un estudio de caso in silico
dc.title.alternativeApplication of the ant colony optimization algorithm (aco) in Urban route optimization: an in silico case study
dc.typeArtículo científico
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Aplicación del algoritmo de optimización de colonias de hormigas (ACO) en la optimización de rutas urbanas un estudio de caso in silico.pdf
Size:
313.46 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download
Collections
Artículos científicos