Assignment to a transportation network has already been introduced in Chap. 5. Here we continue the analysis of assignment in the absence of within-day dynamics. In Sect. 6.2 we describe assignment with preventive-adaptive path choice, Sect. 6.3 covers the extension to the case of variable demand and/or multimodal assignment, and Sect. 6.4 deals with multiclass assignment models. In Sect. 6.5 we introduce assignment with day-to-day dynamics (dynamic process). As each of these extensions may be combined in banal fashion with each of the others, combined cases are not treated explicitly (e.g., multiclass assignment with variable demand); in Sect. 6.6 we present an overall scheme that allows straightforward comparison of these extensions. Also in this chapter, as in Chap. 5, the algorithms described are only those used more commonly or that are simpler to implement.
Advanced Models for Traffic Assignment to Transportation Networks
Springer Optimization
2009-08-22
72 pages
Article/Chapter (Book)
Electronic Resource
English
Transportation Network , Link Cost , Assignment Model , Path Cost , User Equilibrium Mathematical Modeling and Industrial Mathematics , Operations Research, Management Science , Mathematics and Statistics , Regional/Spatial Science , Civil Engineering , Mathematics , Landscape/Regional and Urban Planning
Stochastic Assignment to Transportation Networks: Models and Algorithms
Springer Verlag | 1998
|Analytical methods in transportation -- Left turn penalties in traffic assignment models
Engineering Index Backfile | 1963
|5 STOCHASTIC ASSIGNMENT TO TRANSPORTATION NETWORKS: MODELS AND ALGORITHMS
British Library Conference Proceedings | 1998
|Dynamic Traffic Assignment Models
Springer Verlag | 1992
|