A biased random-key genetic algorithm for road congestion minimization

L. S. Buriol, M. J. Hirsch, P. M. Pardalos, T. Querido,  M. G. C. Resende, and M. Ritt

Optimization Letters, vol. 4, pp. 619-633, 2010


One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment problem aims to minimize total travel delay among all travelers.  Based on data derived from the first problem, the toll pricing problem determines the set of tolls and corresponding tariffs that would collectively benefit all travelers and would lead to a user equilibrium solution.  Obtaining high-quality solutions for this framework is a challenge for large networks. In this paper, we propose an approach to solve the two problems jointly, making use of a biased random-key genetic algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links of the road network.  Since a transportation network may have thousands of intersections and hundreds of road segments, our algorithm takes advantage of mechanisms for speeding up shortest-path algorithms.

PDF file of full paper

Go back

Mauricio G.C. Resende's Home Page

Last modified: 21 September 2010

Copyright Notice