Optimal Transit Network Design
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.
- 2.U.S. Bureau of Public Roads (ed) (1964) Traffic assignment manual. U.S. Department of Commerce, Washington, DCGoogle Scholar
- 3.Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall Inc., Englewood Cliffs, NJGoogle Scholar
- 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
- 9.Patriksson M (1994) The traffic assignment problem: models and methods. Dover Publications Inc., New YorkGoogle Scholar