This content is not included in
your SAE MOBILUS subscription, or you are not logged in.
An Iterative Routing/Assignment Method for Anticipatory Real-Time Route Guidance
Annotation ability available
Sector:
Language:
English
Abstract
Anticipatory route guidance in traffic networks is based on time-dependent fastest path calculation requiring forecasts of link travel time over a time horizon. These forecasts would be produced by a traffic assignment procedure, which must take into account the behavior of anticipatory vehicles seeking user-optimal route guidance. Thus a conceptual feedback loop occurs. We implement this feedback loop iteratively using simulation for the assignment phase. When the iteration terminates with a fixed-point assignment, user-optimality is achieved. We study the benefits accrued by individual anticipatory vehicles and the system as a whole, as a function of the proportion of vehicles which have anticipatory route guidance, i.e. the market penetration. We observe individual and system benefits at market penetrations up to 40% or higher.
Authors
- David E. Kaufman - Department of Industrial and Operations Engrg., University of Michigan Ann Arbor, MI
- Robert L. Smith - Department of Industrial and Operations Engrg., University of Michigan Ann Arbor, MI
- Karl E. Wunderlich - Department of Industrial and Operations Engrg., University of Michigan Ann Arbor, MI
Topic
Citation
Kaufman, D., Smith, R., and Wunderlich, K., "An Iterative Routing/Assignment Method for Anticipatory Real-Time Route Guidance," SAE Technical Paper 912815, 1991, https://doi.org/10.4271/912815.Also In
References
- Branston, D. 1976 Link capacity functions: a review Transportation Research 10 223 236
- Carey, M. 1987 Optimal time-varying flows on congested networks Operations Research 35 58 69
- Florian, M. 1984 An Introduction to Network Models Used in Transportation Planning Florian M. Transportation Planning Models Elsevier Science Publishers
- Friesz, T.L. Luque J. Tobin R.L. Wie B. 1989 Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem Operations Research 37 893 901
- Janson, B.N. 1991 A Convergent Algorithm for Dynamic Traffic Assignment Transportation Research Board Meeting Washington, D.C.
- Kaufman, D.E. Smith R.L. 1990 Minimum Travel Time Paths in Dynamic Networks with Application to Intelligent Vehicle/Highway Systems Technical Report 90-11, Intelligent Vehicle/Highway Systems Program The University of Michigan
- Lafortune, S. Sengupta R. Kaufman D.E. Smith R.L. 1991 A Dynamical System Model for Traffic Assignment in Networks IVHS Technical Report 91-01 The University of Michigan
- Matsoukis, E.C. 1986 Road Traffic Assignment - A Review: Part I - Non-Equilibrium Methods Transportation Planning and Technology 12 183 199
- Merchant, D.K. Nemhauser G.L. 1978 A Model and an Algorithm for the Dynamic Traffic Assignment Problems Transportation Science 12 183 199
- Van Aerde, M. Yagar, S. 1988 Dynamic Integrated Freeway/Traffic Networks: A Routing-Based Modelling Approach Transportation Research 22A 445 453
- Wunderlich, K.E. 1991 Dynamic Equilibrium in a Successive Approximation Solution Method to the Anticipatory Routing Problem Department of Industrial and Operations Engineering The University of Michigan