Optimal Transit Network Design

  • Alexander KrylatovEmail author
  • Victor Zakharov
  • Tero Tuovinen
Part of the Springer Tracts on Transportation and Traffic book series (STTT, volume 15)


In this chapter, the optimal transit network design is under investigation. A special kind of transport is assumed to be given the best traffic conditions in a road network (the smallest amount of travel time between origins and destinations). Optimality criteria for transit network design in case of selfish routing are defined in the first section. The Sect. 7.2 is devoted to the estimation of selfish traffic assignment in a network with a transit subnetwork. Optimality criteria for transit network design in case of competitive drivers’ groups routing are defined in the Sect. 7.3. The Sect. 7.4 is devoted to traffic assignment in case of competitive drivers’ groups routing in a network with a transit subnetwork. Explicit illustrative solutions are presented for a single-commodity road network with non-interfering routes.


  1. 1.
    Beltran B, Carrese S, Cipriani E, Petrelli M (2009) Transit network design with allocation of green vehicles: a genetic algorithm approach. Transp Res Part C 17:475–483CrossRefGoogle Scholar
  2. 2.
    U.S. Bureau of Public Roads (ed) (1964) Traffic assignment manual. U.S. Department of Commerce, Washington, DCGoogle Scholar
  3. 3.
    Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall Inc., Englewood Cliffs, NJGoogle Scholar
  4. 4.
    Zakharov V, Krylatov A (2015) Competitive green-vehicle assignment on a transportation network. In: Chapter 13: Game theory and applications. Volume 17: Game-theoretic models in mathematical ecology. Nova Science Publishers Inc., pp 360–398Google Scholar
  5. 5.
    Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res Logist Q 3:95–110MathSciNetCrossRefGoogle Scholar
  6. 6.
    Zakharov V, Krylatov A, Volf D (2018) Green route allocation in a transportation network. Comput Methods Appl Sci 45:71–86CrossRefGoogle Scholar
  7. 7.
    Zakharov VV, Krylatov AY (2016) Competitive routing of traffic flows by navigation providers. Autom Remote Control 77(1):179–189MathSciNetCrossRefGoogle Scholar
  8. 8.
    Krylatov AY, Zakharov VV (2016) Competitive traffic assignment in a green transit network. Int Game Theory Rev 18(2):1–14MathSciNetCrossRefGoogle Scholar
  9. 9.
    Patriksson M (1994) The traffic assignment problem: models and methods. Dover Publications Inc., New YorkGoogle Scholar

Copyright information

© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Institute of Transport ProblemsRussian Academy of SciencesSaint PetersburgRussia
  2. 2.Faculty of Applied Mathematics and Control ProcessesSaint Petersburg State UniversitySaint PetersburgRussia
  3. 3.Faculty of Information TechnologyUniversity of JyväskyläJyväskyläFinland

Personalised recommendations