A biased random-key genetic algorithm for road congestion minimization

Optimization Letters

Volumn 4, Issue 4, 2010, Pages 619-633

  Buriol, Luciana S ^a   Hirsch, Michael J ^b   Pardalos, Panos M ^c   Querido, Tania ^d   Resende, Mauricio G C ^e   Ritt, Marcus ^a  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

^b RAYTHEON COMPANY   (United States)

^c J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

^d Linear Options Consulting   (United States)

^e AT AND T LABS RESEARCH   (United States)

Author keywords

Dynamic shortest paths; Genetic algorithms; System optimal; Transportation networks; User equilibrium

Indexed keywords

CLASSICAL PROBLEMS; DYNAMIC SHORTEST PATH; HIGH-QUALITY SOLUTIONS; LARGE NETWORKS; ROAD CONGESTION; ROAD NETWORK; ROAD SEGMENTS; SHORTEST PATH ALGORITHMS; SYSTEM OPTIMAL; TOLL PRICING; TRAFFIC ASSIGNMENT; TRAFFIC ASSIGNMENT PROBLEM; TRANSPORTATION NETWORK; TRANSPORTATION NETWORKS; TRANSPORTATION PLANNING; TRAVEL DELAYS; USER EQUILIBRIUM;

GRAPH THEORY; HIGHWAY ACCIDENTS; MOTOR TRANSPORTATION; NETWORK PERFORMANCE; OPTIMIZATION; ROADS AND STREETS; TRAFFIC CONTROL;

GENETIC ALGORITHMS;

EID: 77956878113     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-010-0226-6     Document Type: Article

References (25)

1. Ahuja R. K., Magnanti T. L., Orlin J. B.: Network Flows-Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993).
2. Arnott R., Small K.: The economics of traffic congestion. Am. Sci. 82, 446-455 (1994).
3. Bai, L.: Computational methods for toll pricing models. Ph. D. thesis, University of Florida, Gainesville, Florida (2004).
4. Bai L., Hearn D. W., Lawphongpanich S.: Relaxed toll sets for congestion pricing problems. In: Hearn, D., Lawphongpanich, S., Smith, M. (eds) Mathematical and Computational Models for Congestion Charging, Springer, Berlin (2006).
5. Bar-Gera, H.: Transportation networks test problems (2007). http://www. bgu. ac. il/~bargera/tntp.
6. Bean J. C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154-160 (1994).
7. Bureau of Public Roads: Traffic Assignment Manual. Tech. rep., US Dept. of Commerce, Urban Planning Division, Washington, DC (1964).
8. Buriol L., Resende M., Thorup M.: Speeding up dynamic shortest-path algorithms. INFORMS J. Comput. 20, 191-204 (2008). doi: 10. 1287/ijoc. 1070. 0231.
9. Buriol, L. S., Hirsch, M. J., Pardalos, P., Querido, T., Resende, M. G., Ritt, M.: A hybrid genetic algorithm for road congestion minimization. In: Proceedings of the XLI Simpósio Brasileiro de Pesquisa Operacional, pp. 2515-2526 (2009).
10. Buriol L. S., Resende M. G. C., Ribiero C. C., Thorup M.: A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 46, 36-56 (2005).
11. Dahl, J., Landenberghe, L.: CVXOPT (2005). http://abel. ee. ucla. edu/cvxopt.
12. Dial R. B.: Minimal-revenue congestion pricing part I: a fast algorithm for the single origin case. Transp. Res. B 33, 189-202 (1999).
13. Dial R. B.: Minimal-revenue congestion pricing part II: an efficient algorithm for the general case. Transp. Res. B 34, 645-665 (1999).
14. Ericsson M., Resende M. G. C., Pardalos P. M.: A genetic algorithm for the weight setting problem in OSPF routing. J. Combin. Optim. 6, 299-333 (2002).
15. Florian M., Hearn D. et al.: Network equilibrium models and algorithms. In: Ball, M. O. (eds) Network Routing, pp. 485-550. Elsevier Science, Amsterdam (1995).
16. Gonçalves, J., Resende, M.: Biased random-key genetic algorithms for combinatorial optimization. Tech. rep., AT& T Labs Research, Florham Park, NJ (2010). (http://www. research. att. com/~mgcr/doc/srkga. pdf). To appear in J. Heuristics.
17. Hearn, D. W., Ramana, M.: Solving Congestion Toll Pricing Models. Equilibrium and Advances in Transportation Modeling. North-Holland, New York (1988).
18. Hearn, D. W., Ribera, J.: Bounded flow equilibrium by penalty methods. In: Proceedings of the IEEE International Conference on Circuits and Computers, pp. 162-164 (1980).
19. Kim D., Pardalos P.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24, 195-203 (1999).
20. Lawphongpanich S., Hearn D. W.: An MPEC approach to second-best toll pricing. Math. Program. Ser. B 101, 33-55 (2004).
21. LeBlanc L. J., Morlok E. K., Pierskalla W. P.: An efficient approach to solving the road network equilibrium traffic assignment problem. Transp. Res. 9, 309-318 (1975).
22. Reis, R., Ritt M., Buriol, L. S., Resende, M. G. C.: A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. Int. Trans. Oper. Res. (2010, in press).
23. Shepherd S., Sumalee S.: A genetic algorithm based approach to optimal toll level and location problems. Netw. Spatial Econ. 4(2), 161-179 (2004).
24. Spears, W., DeJong, K.: On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230-236 (1991).
25. Tsekeris T., Voß S.: Design and evaluation of road pricing: state-of-the-art and methodological advances. Netnomics 10, 5-52 (2009).