Solving the traffic assignment problem using real data for a segment of Medellin's transportation network

this paper is based on data obtained from most recent transportation studies done in the metropolitan area of valle de aburra, city of medellin 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 results from 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.