Skip to main content
SpringerLink
Log in

Travel Times Equilibration Procedure for Route-Flow Traffic Assignment Problem

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12096))

Included in the following conference series:

Abstract

The present paper is devoted to travel time equilibration procedure for solving traffic assignment problem with respect to route flows. We prove that equilibrium route-flow assignment can be easily obtained by implementing equilibration procedure together with simple rules for sequential extension and/or by reducing the set of active routes. Accurate route-flow solution for the small Sioux Falls network is found via the developed algorithm and demonstrates some important points related with visualization issues, decision making support and scenario analysis in the sphere of transportation planning.

The work was jointly supported by a grant from the Russian Science Foundation (No. 19-71-10012 Multi-agent systems development for automatic remote control of traffic flows in congested urban road networks).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bar-Gera, H.: Traffic assignment by paired alternative segments. Transp. Res. Part B 44(8–9), 1022–46 (2010)

    Article  Google Scholar 

  2. Beckmann, M., McGuire, C., Winsten, C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)

    Google Scholar 

  3. Devarajan, S.: A note on network equilibrium and noncooperative games. Transp. Res. Part B 15(6), 421–426 (1981)

    Article  MathSciNet  Google Scholar 

  4. Dial, R.: A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transp. Res. Part B 40, 917–936 (2006)

    Article  Google Scholar 

  5. Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3, 95–110 (1956)

    Article  MathSciNet  Google Scholar 

  6. Galligari, A., Sciandrone, M.: A computational study of path-based mathods for optimal traffic assignment with both inelastic and elastic demand. Comput. Oper. Res. 103, 158–166 (2019)

    Article  MathSciNet  Google Scholar 

  7. Krylatov, A.Y.: Network flow assignment as a fixed point problem. J. Appl. Ind. Math. 10(2), 243–256 (2016). https://doi.org/10.1134/S1990478916020095

    Article  MathSciNet  MATH  Google Scholar 

  8. Krylatov, A.: Reduction of a minimization problem for a convex separable function with linear constraints to a fixed point problem. J. Appl. Ind. Math. 12(1), 98–111 (2018)

    Article  MathSciNet  Google Scholar 

  9. Krylatov, A., Shirokolobova, A.: Projection approach versus gradient descent for network’s flows assignment problem. Lect. Notes Comput. Sci. 10556, 345–350 (2017)

    Article  Google Scholar 

  10. LeBlanc, L.: Mathematical programming algorithms for large scale network equilibrium and network design problem. Northwestern University, Department of Industrial Engineering and Management Science (1973)

    Google Scholar 

  11. Lupi, M.: Convergence of the Frank-Wolfe algorithm in transportation networks. Civ. Eng. Syst. 19, 7–15 (1985)

    Google Scholar 

  12. Nguyen, S.: A mathematical programming approach to equilibrium methods of traffic assignment with fixed demands. Publication 138, Départment d’Informatique et de Recherche Opérationelle, Université de Montréal, Montréal (1973)

    Google Scholar 

  13. Patriksson, M.: The Traffic Assignment Problem: Models and Methods. VSP, Utrecht (1994)

    MATH  Google Scholar 

  14. Perederieieva, O., Ehrgott, M., Raith, A., Wang, J.: A framework for and empirical study of algorithms for traffic assignment. Comput. Oper. Res. 54, 90–107 (2015)

    Article  MathSciNet  Google Scholar 

  15. Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. 2, 325–378 (1952)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saint Petersburg State University, Saint Petersburg, Russia

    Alexander Krylatov & Anastasiya Raevskaya

  2. Institute of Transport Problems RAS, Saint Petersburg, Russia

    Alexander Krylatov

Authors
  1. Alexander Krylatov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anastasiya Raevskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Krylatov .

Editor information

Editors and Affiliations

  1. CARGO Lab., Wilfrid Laurier University, Waterloo, ON, Canada

    Ilias S. Kotsireas

  2. Center for Applied Optimization, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Krylatov, A., Raevskaya, A. (2020). Travel Times Equilibration Procedure for Route-Flow Traffic Assignment Problem. In: Kotsireas, I., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2020. Lecture Notes in Computer Science(), vol 12096. Springer, Cham. https://doi.org/10.1007/978-3-030-53552-0_9

Download citation

Publish with us

Policies and ethics

Search

Navigation