Solving the traffic assignment problem using real data for a segment of Medellin’s transportation network
AbstractThis paper is based on data obtained from most recent transportation studies done in the Metropolitan Area of Valle de Aburrá, city of Medellín and other 9 municipalities. The studies were based on an Origin/Destination Survey (2005), Analysis of bus routes (2006), and Mobility Master Plan (2006). This paper explains the process of writing a software application for a given network (Network of Medellin) that solves the deterministic user equilibrium problem. The software code was implemented in Visual Basic .NET®,supported by some operations using Microsoft Excel®, and hardcoded for a segment of the Medellin network. The user equilibrium distribution of flow was found by using the Frank-Wolfe algorithm. The applied algorithm was analyzed in some aspects such as number of iterations, convergence patterns, response time, as well as changes in network demand. The traffic assignment models were analyzed by using the algorithm during the P.M. peak hour (hour of highest traffic congestion). The analysis was compared with the resultsfrom the traffic assignment procedure using TransCAD® (well-known and used transportation demand software) for the 2005 database and it was found that the software is somewhat faster than the algorithm, but the latter could be a good tool for practitioners and students for modeling small networks.
Área Metropolitana del Valle de Aburrá (AMVA) - Consorcio Movilidad Regional Colombia-Chile. Formulación del Plan Maestro de Movilidad para la Región Metropolitana del Valle de Aburrá. Medellín. 2007. Informe Final. Capítulo 2: Diagnóstico. pp. 102- 188
Y. Sheffi. Urban Transportation Networks: Equilibrium analysis with mathematical programming
methods. Ed. Prentice-Hall Inc. New Jersey. 1985. pp. 111- 132
M. Patriksson. The traffic Assignment Problem– Models and Methods. Ed. VSP. Utrecht. 1994. pp. 131- 135.
M. Frank, P. H. Wolfe. “An algorithm for quadratic programming”. Naval Res. Logist. Quart. Vol. 3. 1956. pp. 95-110.
S. Arrache, R. Ouafi, “Improved Frank-Wolfe method: application to the traffic assignment problem”. Proceedings of the International Congress of Mathematicians, Section 15. Madrid. 2006. pp. 8-9. http://www.icm2006.org/v_f/AbsDef/Posters/abs_1702.pdf. Consultada el 8 de septiembre de 2009
S. Arrache, R. Ouafi. “Accelerating Convergence of the Frank-Wolfe Algorithm for Solving the Traffic Assignment Problem”. IJCSNS International Journal of Computer Science and Network Security. Vol.8. 2008. pp. 181-186.
X. Meng, Q. Yunchao, G. Ziyou. “Implementing Frank-Wolfe Algorithm under Different Flow Update Strategies and Line Search Technologies”. Journal of Transportation Systems Engineering and Information Technology. Vol. 8. 2008. pp. 14-22.
S. Nguyen. “An Algorithm for the Traffic Assignment Problem”. Transportation Science. Vol. 8. 1974. pp. 203-216.
M. Florian, S. Nguyen. “An Application and Validation of Equilibrium. Trip Assignment Methods”. Transportation Science Vol. 10. 1976. pp. 374-390.
E. W. Dijkstra. “A note on two problems in connexion with graphs”. Numerische Mathematik. Vol. 1. 1959. pp. 269-271.
Copyright (c) 2018 Revista Facultad de Ingeniería
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
All the texts included in the Revista Facultad de Ingenieria Universidad de Antioquia -redin- are protected by copyrights. According to the law, their reproduction through any means, physical or electronic, without written consent by the Editorial Committee is forbidden. Complete texts of the articles will be fully and publically available, which means that they can be read, downloaded, copied, distributed, printed, searched for, or linked to. The opinions expressed in the published articles specifically belong to the authors and are not necessarily the same of the Editorial Committee or of the School of Engineering Management.