Skip to main content

Advertisement

SpringerLink
Log in

A biased random-key genetic algorithm for road congestion minimization

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows—Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Arnott R., Small K.: The economics of traffic congestion. Am. Sci. 82, 446–455 (1994)

    Google Scholar 

  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)

    Google Scholar 

  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)

    MATH  Google Scholar 

  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

    Article  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  13. Dial R.B.: Minimal-revenue congestion pricing part II: an efficient algorithm for the general case. Transp. Res. B 34, 645–665 (1999)

    Article  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lawphongpanich S., Hearn D.W.: An MPEC approach to second-best toll pricing. Math. Program. Ser. B 101, 33–55 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Informática, Universidade Federal do Rio Grande do Sul, Av. Bento Gonçalves, Porto Alegre, 9500, Brazil

    Luciana S. Buriol & Marcus Ritt

  2. Raytheon Company, 300 Sentinel Drive, Annapolis Junction, MD, 20701, USA

    Michael J. Hirsch

  3. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL, 32611, USA

    Panos M. Pardalos

  4. Linear Options Consulting, 7450 SW 86th Way, Gainesville, FL, 32608, USA

    Tania Querido

  5. Algorithms and Optimization Research Department, AT&T Labs Research, 180 Park Avenue, Room C241, Florham Park, NJ, 07932, USA

    Mauricio G. C. Resende

Authors
  1. Luciana S. Buriol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael J. Hirsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tania Querido
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Mauricio G. C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Marcus Ritt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mauricio G. C. Resende.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buriol, L.S., Hirsch, M.J., Pardalos, P.M. et al. A biased random-key genetic algorithm for road congestion minimization. Optim Lett 4, 619–633 (2010). https://doi.org/10.1007/s11590-010-0226-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0226-6

Keywords

Search

Navigation