Dynamic Urban Transportation Network Models
Theory and Implications for Intelligent Vehicle-Highway Systems
Published on 27. October 1994
Book
Paperback/Softback
XV, 391 pages
978-3-540-58360-8 (ISBN)
Description
Intelligent Vehicle-Highway Systems are providing a welcome stimulus to research on dynamic urban transportation network models. This book presents a new generation of models for solving dynamic travel choice problems including traveler's destination choice, mode choice, departure/arrival time choice and route choice. These models are expected to function as off-line travel forecasting and evaluation tools, and eventually as on-line prediction and control models in advanced traveler information and traffic management systems. In addition to a rich set of new formulations and solution algorithms, the book provides a summary of the necessary mathematical background and concludes with a discussion of the requirements for model implementation.
More details
Series
Edition
Softcover reprint of the original 1st ed. 1994
Language
English
Place of publication
Heidelberg
Germany
Publishing group
Springer Berlin
Target group
College/higher education
Professional and scholarly
Product notice
Paperback (UK-trade)
Illustrations
1 s/w Abbildung
50 illustrations, 26 tables
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
540 gr
ISBN-13
978-3-540-58360-8 (9783540583608)
DOI
10.1007/978-3-662-00773-0
Schweitzer Classification
Other editions
New editions
Bin Ran | David Boyce
Modeling Dynamic Transportation Networks
An Intelligent Transportation System Oriented Approach
Book
07/1996
2nd Edition
Springer
€85.55
Article exhausted; check different version
Content
I Dynamic Transportation Network Analysis.- 1 Introduction.- 1.1 Requirements for Dynamic Network Modeling.- 1.2 Urban Transportation Network Analysis.- 1.3 Overview of Dynamic Network Models.- 1.4 Hierarchy of Dynamic Network Models.- 1.5 Notes.- II Mathematical Background.- 2 Continuous Optimal Control Problems.- 2.1 Definitions for Optimal Control Theory.- 2.2 Continuous Problems with No Constraints.- 2.2.1 Fixed Beginning and Fixed End Times.- 2.2.2 Fixed Beginning and Free End Times.- 2.3 Continuous Problems with Equality and Inequality Constraints.- 2.3.1 Fixed Beginning and Fixed End Times.- 2.3.2 Fixed Beginning and Free End Times.- 2.4 Continuous Problems with Equality and Nonnegativity Constraints.- 2.4.1 Fixed Beginning and Fixed End Times.- 2.4.2 Fixed Beginning and Free End Times.- 2.5 Hierarchical Optimal Control Problems.- 2.5.1 Static Two-Person Games.- 2.5.2 Dynamic Games.- 2.5.3 Bilevel Optimal Control Problems.- 2.6 Notes.- 3 Discrete Optimal Control, Mathematical Programming and Variational Inequality Problems.- 3.1 Discrete Optimal Control Problems with Fixed Beginning and End Times.- 3.1.1 Fixed End Times: No Constraints.- 3.1.2 Fixed End Times: Equality and Inequality Constraints.- 3.1.3 Fixed End Times: Equality and Nonnegativity Constraints.- 3.2 Mathematical Programming Problems.- 3.2.1 Unconstrained Minimization.- 3.2.2 Nonlinear Programs with General Constraints.- 3.2.3 Discrete Optimal Control and Nonlinear Programs.- 3.2.4 Nonlinear Programs with Linear Equality and Nonnegativity Constraints.- 3.2.5 Bilevel Mathematical Programs.- 3.3 Variational Inequality Problems.- 3.3.1 Definitions for Variational Inequality Problems.- 3.3.2 Existence and Uniqueness Conditions.- 3.4 Solution Algorithms for Mathematical Programs and Variational Inequalities.- 3.4.1 One Dimentional Minimization.- 3.4.2 Frank-Wolfe Algorithm.- 3.4.3 Relaxation Algorithm.- 3.5 Notes.- III Deterministic Dynamic Route Choice.- 4 Network Flow Constraints and Definitions of Travel Times.- 4.1 Flow Conservation Constraints.- 4.2 Definitions of Dynamic Travel Times.- 4.3 Flow Propagation Constraints.- 4.3.1 Type I.- 4.3.2 Type II.- 4.4 First-In-First-Out Constraints.- 4.5 Link Capacity and Oversaturation.- 4.5.1 Maximal Number of Vehicles on a Link.- 4.5.2 Maximal Exit Flow from a Link.- 4.5.3 Constraints for Spillback.- 4.6 Summary of Notation.- 4.7 Notes.- 5 Instantaneous Dynamic User-Optimal Route Choice Models.- 5.1 An Example with Two Parallel Routes.- 5.2 Definition of Instantaneous DUO State.- 5.3 Instantaneous Route Choice Model 1.- 5.3.1 Model Formulation.- 5.3.2 Optimality Conditions.- 5.3.3 DUO Equivalence Analysis.- 5.4 Instantaneous Route Choice Model 2.- 5.4.1 Model Formulation.- 5.4.2 Optimality Conditions.- 5.5 Instantaneous Route Choice Model 3.- 5.6 A Numerical Example.- 5.7 Notes.- 5.7.1 Several Formulation Issues.- 5.7.2 Properties of Models.- 6 A Computational Algorithm for Instantaneous Dynamic User-Optimal Route Choice Models.- 6.1 The Algorithm.- 6.1.1 Discrete Instantaneous DUO Route Choice Model.- 6.1.2 The Diagonalization/Frank-Wolfe Algorithm.- 6.1.3 Solving the LP Subproblem Using an Expanded TimeSpace Network.- 6.2 Time-Space Network Expansion.- 6.3 Flow Propagation Constraints in Minimal-Cost Route Searches.- 6.4 Computational Experience.- 6.5 Notes.- 7 An Ideal Dynamic User-Optimal Route Choice Model.- 7.1 Additional Network Flow Constraints and Definition of the Ideal DUO State.- 7.2 Equivalent Equality Constraints for Ideal DUO Route Choice Conditions.- 7.3 An Optimal Control Model of Ideal DUO Route Choice.- 7.4 Solution Algorithm.- 7.4.1 Discrete Formulation of the Ideal Model.- 7.4.2 The Penalty Method.- 7.4.3 The Diagonalization/Frank-Wolfe Algorithm.- 7.4.4 Summary of the Algorithm.- 7.5 Notes.- IV Stochastic Dynamic Route Choice.- 8 Stochastic Dynamic User-Optimal Route Choice Models.- 8.1 Definitions of Travel Times in Stochastic Situations.- 8.2 Instantaneous SDUO Route Choice Model.- 8.2.1 Model Formulation.- 8.2.2 Optimality Conditions and Equivalence Analysis.- 8.3 Ideal SDUO Route Choice Model.- 8.3.1 Constraints for Mean Actual Route Travel Times.- 8.3.2 Definition of Ideal SDUO and Logit-Based Route Flow Constraints.- 8.3.3 Model Formulation.- 8.3.4 Analysis of Dispersed Route Choice.- 8.4 Notes.- 9 Solution Algorithms for Stochastic Dynamic User-Optimal Route Choice Models.- 9.1 Some New Notation.- 9.2 An Algorithm for the Flow-Independent Instantaneous SDUO Route Choice Model.- 9.2.1 Statement of the Algorithm.- 9.2.2 Proof of the Algorithm.- 9.3 An Algorithm for the Flow-Independent Ideal SDUO Route Choice Model.- 9.3.1. Statement of the Algorithm.- 9.3.2 Proof of the Algorithm.- 9.4 An Algorithm for the Instantaneous SDUO Route Choice Model.- 9.4.1 A Discrete Time Instantaneous Model.- 9.4.2 Solution Algorithm.- 9.5 An Algorithm for the Ideal SDUO Route Choice Model.- 9.5.1 A Discrete Time Ideal Model.- 9.5.2 Solution Algorithm.- 9.6 Numerical Examples.- 9.7 Notes.- V General Dynamic Travel Choices.- 10 Combined Departure Time/Route Choice Models.- 10.1 Additional Network Constraints.- 10.2 Formulation of the Bilevel Program.- 10.2.1 Lower Level Problem: Departure Time Choice.- 10.2.2 Upper Level Problem: Route Choice.- 10.2.3 Bilevel Program Formulation.- 10.3 Optimality Conditions and Equivalence Analysis.- 10.3.1 Optimality Conditions.- 10.3.2 DUO Equivalence Analysis.- 10.4 Solution Algorithm and An Example.- 10.4.1 Solution Algorithm.- 10.4.2 Numerical Example.- 10.5 Notes.- 11 Combined Departure Time/Mode/Route Choice Models.- 11.1 Two-Stage Travel Choice Model.- 11.2 First Stage: Mode Choice Problem.- 11.3 Second Stage: Departure Time/Route Choice for Motorists.- 11.3.1 Lower-Level: Departure Time Choice for Motorists.- 11.3.2 Upper-Level: Route Choice for Motorists.- 11.4 Formulation of the Two-Stage Travel Choice Model.- 11.5 Optimality Conditions.- 11.5.1 Optimality Conditions for First-Stage Program.- 11.5.2 Optimality Conditions for Second-Stage Program.- 11.6 Notes.- VI Variational Inequality Models.- 12 Variational Inequality Models of Instantaneous Dynamic User-Optimal Route Choice Problems.- 12.1 A Route-Time-Based VI Model of Instantaneous Route Choice.- 12.1.1 Route-Time-Based Conditions.- 12.1.2 Dynamic Network Constraints.- 12.1.3 The Route-Time-Based VI Model.- 12.2 A Multi-Group Route-Cost-Based VI Model of Instantaneous Route Choice.- 12.2.1 Multi-Group Route-Cost-Based Conditions.- 12.2.2 Dynamic Network Constraints.- 12.2.3 The Multi-Group Route-Cost-Based VI Model.- 12.3 A Link-Time-Based VI Model of Instantaneous Route Choice.- 12.3.1 Link-Time-Based Conditions.- 12.3.2 The Link-Time-Based VI Model.- 12.4 A Multi-Group Link-Cost-Based VI Model of Instantaneous Route Choice.- 12.4.1 Multi-Group Link-Cost-Based Conditions.- 12.4.2 The Multi-Group Link-Cost-Based VI Model.- 12.5 Relationships Between VI Models and Optimization Models.- 12.6 Notes.- 13 Variational Inequality Models of Ideal Dynamic User-Optimal Route Choice Problems.- 13.1 A Route-Time-Based VI Model of Ideal Route Choice.- 13.1.1 Route-Time-Based Conditions.- 13.1.2 Dynamic Network Constraints.- 13.1.3 The Route-Time-Based VI Model.- 13.2 A Multi-Group Route-Cost-Based VI Model of Ideal Route Choice.- 13.2.1 Multi-Group Route-Cost-Based Conditions.- 13.2.2 Dynamic Network Constraints.- 13.2.3 The Multi-Group Route-Cost-Based VI Model.- 13.3 A Link-Time-Based VI Model of Ideal Route Choice.- 13.3.1 Link-Time-Based Conditions.- 13.3.2 The Link-Time-Based Model.- 13.4 A Multi-Group Link-Cost-Based VI Model of Ideal Route Choice.- 13.4.1 Multi-Group Link-Cost-Based Conditions.- 13.4.2 The Multi-Group Link-Cost-Based VI Model.- 13.5 Relationships Between VI Models and Optimization Models.- 13.6 Notes.- 14 Variational Inequality Models of Dynamic Departure Time/Route Choice Problems.- 14.1 A Route-Based VI Model of Departure Time/Route Choice.- 14.1.1 Route-Based Conditions.- 14.1.2 Dynamic Network Constraints.- 14.1.3 The Route-Based VI Model.- 14.2 A Link-Based VI Model of Departure Time/Route Choice.- 14.2.1 Link-Based Conditions.- 14.2.2 The Link-Based VI Model.- 14.3 VI Models and Optimization Models for Departure Time/Route Choice.- 14.4 Notes.- 15 Dynamic System-Optimal Route Choice and Congestion Pricing.- 15.1 Objective Functions for Dynamic System-Optimal Models.- 15.2 Total Travel Time Minimization.- 15.2.1 The Model.- 15.2.2 Solution Algorithm.- 15.3 DSO Route Choice with Elastic Departure Times.- 15.3.1 Fixed Final Time T.- 15.3.2 Free Final Time T.- 15.4 Dynamic Congestion Pricing.- 15.4.1 Various Dynamic Congestion Pricing Strategies.- 15.4.2 Dynamic Network Constraints.- 15.4.3 Tolls Based on Instantaneous DUO Route Choice.- 15.4.4 Tolls Based on Ideal DUO Route Choice.- 15.5 Notes.- VII Implications for IVHS.- 16 Link Travel Time Functions for Dynamic Network Models.- 16.1 Functions for Various Purposes.- 16.2 Functions for Arterials: Longer-Time Horizons.- 16.3 Functions for Arterials: Short-Time Horizons.- 16.4 Implications of Functions for Arterial Networks.- 16.4.1 Number of Link Flow Variables.- 16.4.2 Notes on Functions for Arterial Links.- 16.5 Functions for Freeway Segments.- 16.6 Notes.- 17 Implementation in IVHS.- 17.1 Implementation Issues.- 17.1.1 Traffic Prediction.- 17.1.2 Traffic Control.- 17.1.3 Incident Management.- 17.1.4 Congestion Pricing.- 17.1.5 Operations and Control for AHS.- 17.1.6 Transportation Planning.- 17.2 Data Requirements.- 17.2.1 Time-Dependent O-D Matrices.- 17.2.2 Network Geometry and Control Data.- 17.2.3 Traffic Flow Data.- 17.2.4 Traveler Information.- 17.3 Notes.- References.- Author Index.- List of Figures.- List of Tables.