Traffic Flow Estimation Using Ant Colony Optimization Algorithms
Algoritmos de optimización basados en colonias de hormigas para la estimación de flujos de tráfico
Antonio Bolufé-Röhler1, Juan Manuel Otero Pereira1, and Sonia Fiol-González1
1 Facultad de Matemática y Computación, Universidad de la Habana, Cuba. bolufe@matcom.uh.cu, otero@matcom.uh.cu, s.fiol@matcom.uh.cu
]]>Abstract
Simulation and optimization of traffic flows in a city or province allow the implementation of correct developing strategies and help the decision making process when using and distributing resources such as mass transit. This estimation can be modeled as a bifurcated multi-commodity network flow problem, where the general flow distribution is dictated by Wardrop's principles. In this paper two different Ant Colony Optimization algorithms are presented for solving this problem. The proposed algorithms are tested with real-life traffic demand in the Havana city. The obtained results are compared to those provided by classical algorithms, showing that the new ant colony algorithms provide good results as well as low running times.
Keywords: Non-linear optimization, metaheuristics, traffic problem, logistics, simulation.
Resumen
La estimación de flujos de tráfico permite implementar buenas estrategias de desarrollo, a la vez que ayuda en el proceso de toma de decisiones cuando se controlan y distribuyen recursos claves como el transporte masivo. La distribución de tráfico puede ser modelada como un problema de Flujo de Costo Mínimo para Múltiples Bienes. Para su solución, la Optimización de Colonia de Hormigas provee un marco de trabajo prometedor. En la presente investigación se presentan dos nuevos algoritmos basados en Colonias de Hormigas, los mismos se aplican a instancias reales del problema de estimación de flujo en Ciudad de La Habana. Los resultados alcanzados se comparan con los provistos por algoritmos clásicos, mostrando la efectividad del método propuesto.
Palabras clave: Optimización no-lineal, metaheurísticas, problema de tráfico, logística, simulación.
DESCARGAR ARTÍCULO EN FORMATO PDF
]]>References
1. Wardrop, J.G. (1952). Some theoretical aspects of road traffic research. Palo Alto: Institution of Civil Engineers. [ Links ]
2. Fratta, L., Gerla, M. & Kleinrock, L. (1973). The flow deviation method: An approach to store-and-forward communication network design. Networks, 3(2), 97-133. [ Links ]
3. Goffin, J., Gondzio, J., & Vial, R. (1997). Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Mathematical Programming, 76(1), 131-154. [ Links ]
4. Gabrel, V., Knippel, A., & Minoux, M. (1999). Exact Solution of Multicommodity Network Optimization Problems with General Step Cost Functions. Operations Research Letters, 25(1), 15-23. [ Links ]
]]>5. Boschetti, M.A., Maniezzo, V., Roffilli, M., & Röhler A.B. (2009). Matheuristics: Optimization, Simulation and Control. Hybrid Metaheuristics. Lecture Notes in Computer Science, 5818, 171-177. [ Links ]
6. Garlick, R.M. & Barr, R.S. (2002). Dynamic wavelength routing in WDM networks via ant colony optimization. Ant Algorithms, Lecture Notes in Computer Science, 2463, 250-255. [ Links ]
7. Walkowiak, K. (2005). Ant algorithm for flow assignment in connection-oriented networks. International Journal on Applied Mathematics and Computer Science, 15(2), 205-220. [ Links ]
8. Maniezzo, V., Roffilli, M., Gabrielli, R., Guidazzi, A., Otero, M., & Trujillo, R. (2008). Regional Traffic Assignment by ACO. Ant Colony Optimization and Swarm Intelligence, Lecture Notes in computer Science, 5217, 409-410. [ Links ]
9. Mohan, C. & Baskaran, R. (2010). Improving network performance using ACO based redundant link avoidance algorithm. International Journal of Computer Science Issues, 7(3), 27-35. [ Links ]
]]>10. Sawadogo, M. & Anciaux, D. (2012). Sustainable supply chain by intermodal itinerary planning: a multiobjective ant colony approach. International Journal of Agile Systems and Management, 5(3), 235-266. [ Links ]
11. Dorigo, M. & Gambardella, L.M. (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transaction on Evolutionary Computation, 1(1), 53-66. [ Links ]
12. Maniezzo, V. (1999). Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal of Computing, 11(4), 358-369. [ Links ]
13. Eppstein, D. (1998). Finding the k Shortest Paths. SIAM Journal on Computing, 28(2), 652-673. [ Links ]
14. Awerbuch, B. & Leighton, T. (1993). A Simple local-control approximation algorithm for multicommodity flow. 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, 459-468. [ Links ]
]]>15. Di Caro, G. & Dorigo, M. (1998). AntNet: distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research, 9(1), 317-365. [ Links ]
16. Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., & Schulenburg, S. (2003). Hyper-heuristics: An emerging direction in modern search technology. Handbook of Metaheuristics, International Series in Operations Research & Management Science, 57, 457-474. [ Links ]
17. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading, Mass.: Addison-Wesley Pub. Co. [ Links ]
18. COIN-OR Foundation. (s.f.). Retrieved from http://www.coin-or.org/foundation.html. [ Links ]
19. Stützle, T. & Hoos, H.H. (2000). MAX-MIN Ant System. Future Generation Computer Systems, 16(8), 88-914. [ Links ]
]]>20. Fernández, C.A. & Bolufé-Röhler, A. (2011). MapTools, Herramienta para la Simulación y Visualización de Problemas de Tráfico. XXV JCJuvenil ICIMAF. [ Links ]
]]>