Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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–483
U.S. Bureau of Public Roads (ed) (1964) Traffic assignment manual. U.S. Department of Commerce, Washington, DC
Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall Inc., Englewood Cliffs, NJ
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–398
Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res Logist Q 3:95–110
Zakharov V, Krylatov A, Volf D (2018) Green route allocation in a transportation network. Comput Methods Appl Sci 45:71–86
Zakharov VV, Krylatov AY (2016) Competitive routing of traffic flows by navigation providers. Autom Remote Control 77(1):179–189
Krylatov AY, Zakharov VV (2016) Competitive traffic assignment in a green transit network. Int Game Theory Rev 18(2):1–14
Patriksson M (1994) The traffic assignment problem: models and methods. Dover Publications Inc., New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Krylatov, A., Zakharov, V., Tuovinen, T. (2020). Optimal Transit Network Design. In: Optimization Models and Methods for Equilibrium Traffic Assignment. Springer Tracts on Transportation and Traffic, vol 15. Springer, Cham. https://doi.org/10.1007/978-3-030-34102-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-34102-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34101-5
Online ISBN: 978-3-030-34102-2
eBook Packages: EngineeringEngineering (R0)