| Modeling Transportation Systems: Preliminary Concepts and Application Areas | p. 1 |
| Introduction | p. 1 |
| Transportation Systems | p. 1 |
| Transportation System Identification | p. 5 |
| Relevant Spatial Dimensions | p. 6 |
| Relevant Temporal Dimensions | p. 9 |
| Relevant Components of Travel Demand | p. 13 |
| Modeling Transportation Systems | p. 17 |
| Model Applications and Transportation Systems Engineering | p. 20 |
| Transportation Systems Design and the Decision-Making Process | p. 20 |
| Some Areas of Application | p. 24 |
| Reference Notes | p. 27 |
| Transportation Supply Models | p. 29 |
| Introduction | p. 29 |
| Fundamentals of Traffic Flow Theory | p. 29 |
| Uninterrupted Flows | p. 30 |
| Fundamental Variables | p. 30 |
| Model Formulation | p. 32 |
| Queuing Models | p. 36 |
| Fundamental Variables | p. 37 |
| Deterministic Models | p. 39 |
| Stochastic Models | p. 43 |
| Congested Network Models | p. 45 |
| Network Structure | p. 45 |
| Flows | p. 46 |
| Performance Variables and Transportation Costs | p. 48 |
| Link Performance and Cost Functions | p. 53 |
| Impacts and Impact Functions | p. 54 |
| General Formulation | p. 55 |
| Applications of Transportation Supply Models | p. 56 |
| Supply Models for Continuous Service Transportation Systems | p. 59 |
| Graph Models | p. 59 |
| Link Performance and Cost Functions | p. 61 |
| Supply Models for Scheduled Service Transportation Systems | p. 82 |
| Line-based Graph Models | p. 83 |
| Link Performance and Cost Functions | p. 83 |
| Reference Notes | p. 87 |
| Random Utility Theory | p. 89 |
| Introduction | p. 89 |
| Basic Assumptions | p. 90 |
| Some Random Utility Models | p. 95 |
| The Multinomial Logit Model | p. 95 |
| The Single-Level Hierarchical Logit Model | p. 100 |
| The Multilevel Hierarchical Logit Model* | p. 107 |
| The Cross-nested Logit Model* | p. 115 |
| The Generalized Extreme Value (GEV) Model* | p. 118 |
| The Probit Model | p. 121 |
| The Mixed Logit Model* | p. 130 |
| Expected Maximum Perceived Utility and Mathematical Properties of Random Utility Models | p. 133 |
| Choice Set Modeling | p. 139 |
| Direct and Cross-elasticities of Random Utility Models | p. 143 |
| Aggregation Methods for Random Utility Models | p. 148 |
| Derivation of Logit Models from the GEV Model | p. 152 |
| Derivation of the Multinomial Logit Model | p. 153 |
| Derivation of the Single-Level Hierarchical Logit Model | p. 154 |
| Derivation of the Multilevel Hierarchical Logit Model | p. 156 |
| Derivation of the Cross-nested Logit Model | p. 159 |
| Random Variables Relevant for Random Utility Models | p. 161 |
| The Gumbel Random Variable | p. 161 |
| The Multivariate Normal Random Variable | p. 164 |
| Reference Notes | p. 166 |
| Travel-Demand Models | p. 169 |
| Introduction | p. 169 |
| Trip-based Demand Model Systems | p. 172 |
| Random Utility Models for Trip Demand | p. 176 |
| Examples of Trip-based Demand Models | p. 181 |
| Models of Spatial and Temporal Characteristics | p. 181 |
| Trip Production or Trip Frequency Models | p. 181 |
| Distribution Models | p. 185 |
| Mode Choice Models | p. 192 |
| Path Choice Models | p. 195 |
| Path Choice Models for Road Networks | p. 197 |
| Path Choice Models for Transit Systems | p. 207 |
| A System of Demand Models | p. 215 |
| Trip-Chaining Demand Models | p. 219 |
| Activity-Based Demand Models | p. 228 |
| A Theoretical Reference Framework | p. 231 |
| Weekly Household Activity Model | p. 232 |
| Daily Household Activity Model | p. 233 |
| Daily Individual Activity List Model | p. 234 |
| Activity Pattern and Trip-Chain Models | p. 234 |
| Applications of Demand Models | p. 235 |
| Freight Transportation Demand Models | p. 238 |
| Multiregional Input-Output (MRIO) models | p. 240 |
| Freight Mode Choice Models | p. 253 |
| Reference Notes | p. 255 |
| Basic Static Assignment to Transportation Networks | p. 259 |
| Introduction | p. 259 |
| Classification of Assignment Models | p. 259 |
| Fields of Application of Assignment Models | p. 263 |
| Definitions, Assumptions, and Basic Equations | p. 265 |
| Supply Model | p. 266 |
| Demand Model | p. 269 |
| Feasible Path and Link Flow Sets | p. 274 |
| Network Performance Indicators | p. 275 |
| Uncongested Networks | p. 278 |
| Models for Stochastic Assignment | p. 280 |
| Models for Deterministic Assignment | p. 283 |
| Algorithms Without Explicit Path Enumeration | p. 286 |
| Congested Networks: Equilibrium Assignment | p. 304 |
| Models for Stochastic User Equilibrium | p. 307 |
| Algorithms for Stochastic User Equilibrium | p. 313 |
| Models for Deterministic User Equilibrium | p. 318 |
| Algorithms for Deterministic User Equilibrium | p. 324 |
| Relationship Between Stochastic and Deterministic Equilibrium | p. 329 |
| System Optimum Assignment* | p. 331 |
| Result Interpretation and Parameter Calibration | p. 338 |
| Specification and Calibration of Assignment Models | p. 341 |
| Optimization Models for Stochastic Assignment | p. 341 |
| Uncongested Network: Stochastic Assignment | p. 342 |
| Congested Network: Stochastic User Equilibrium | p. 342 |
| Reference Notes | p. 344 |
| Assignment Models | p. 344 |
| Assignment Algorithms | p. 346 |
| Advanced Models for Traffic Assignment to Transportation Networks | p. 349 |
| Introduction | p. 349 |
| Assignment with Pre-trip/En-route Path Choice | p. 349 |
| Definitions, Assumptions, and Basic Equations | p. 349 |
| Uncongested Networks | p. 357 |
| Congested Networks: Equilibrium Assignment | p. 363 |
| Equilibrium Assignment with Variable Demand | p. 367 |
| Single-Mode Assignment | p. 368 |
| Models for Stochastic User Equilibrium | p. 372 |
| Models for Deterministic User Equilibrium | p. 375 |
| Algorithms | p. 379 |
| Multimode Equilibrium Assignment | p. 385 |
| Multiclass Assignment | p. 389 |
| Undifferentiated Congestion Multiclass Assignment | p. 392 |
| Differentiated Congestion Multiclass Assignment | p. 394 |
| Interperiod Dynamic Process Assignment | p. 396 |
| Definitions, Assumptions, and Basic Equations | p. 398 |
| Supply Model | p. 398 |
| Demand Model | p. 399 |
| Approaches to Dynamic Process Modeling | p. 402 |
| Deterministic Process Models | p. 403 |
| Stochastic Process Models | p. 410 |
| Synthesis and Application Issues | p. 419 |
| Reference Notes | p. 419 |
| Intraperiod (Within-Day) Dynamic Models* | p. 421 |
| Introduction | p. 421 |
| Supply Models for Transport Systems with Continuous Service | p. 423 |
| Space-Discrete Macroscopic Models | p. 426 |
| Variables and Consistency Conditions | p. 426 |
| Network Flow Propagation Model | p. 435 |
| Link Performance and Travel Time Functions | p. 438 |
| Dynamic Network Loading | p. 439 |
| Path Performance and Travel Time Functions | p. 440 |
| Formalization of the Whole Supply Model | p. 442 |
| Mesoscopic Models | p. 443 |
| Variables and Consistency Conditions | p. 444 |
| Link Performance and Travel Time Functions | p. 447 |
| Path Performance and Travel Time Functions | p. 448 |
| Dynamic Network Loading | p. 449 |
| Formalization of the Whole Supply Model | p. 450 |
| Demand Models for Continuous Service Systems | p. 451 |
| Demand-Supply Interaction Models for Continuous Service Systems | p. 455 |
| Uncongested Network Assignment Models | p. 455 |
| User Equilibrium Assignment Models | p. 458 |
| Dynamic Process Assignment Models | p. 461 |
| Dynamic Traffic Assignment with Nonseparable Link Cost Functions and Queue Spillovers | p. 464 |
| Network Performance Model | p. 467 |
| Exit Capacity Model | p. 472 |
| Exit Flow and Travel Time Model | p. 473 |
| Entry Capacity Model | p. 475 |
| Fixed-Point Formulation of the NPM | p. 477 |
| Network Loading Map and Fixed-Point Formulation of the Equilibrium Model | p. 477 |
| Models for Transport Systems with Scheduled Services | p. 480 |
| Models for Regular Low-Frequency Services | p. 482 |
| Supply Models | p. 482 |
| Demand Models | p. 487 |
| Demand-Supply Interaction Models | p. 489 |
| Models for Irregular High-Frequency Services | p. 489 |
| Supply Models | p. 489 |
| Demand Models | p. 490 |
| Demand-Supply Interaction Models | p. 495 |
| The Simplified Theory of Kinematic Waves Based on Cumulative Flows: Application to Macroscopic Link Performance Models | p. 497 |
| Bottlenecks | p. 499 |
| Segments | p. 501 |
| Reference Notes | p. 510 |
| Estimation of Travel Demand Flows | p. 513 |
| Introduction | p. 513 |
| Direct Estimation of Present Demand | p. 514 |
| Sampling Surveys | p. 514 |
| Sampling Estimators | p. 516 |
| Disaggregate Estimation of Demand Models | p. 520 |
| Model Specification | p. 521 |
| Model Calibration | p. 522 |
| Model Validation | p. 530 |
| Disaggregate Estimation of Demand Models with Stated Preference Surveys* | p. 536 |
| Definitions and Types of Survey | p. 537 |
| Survey Design | p. 538 |
| Model Calibration | p. 545 |
| Estimation of O-D Demand Flows Using Traffic Counts | p. 549 |
| Maximum Likelihood and GLS Estimators | p. 555 |
| Bayesian Estimators | p. 560 |
| Application Issues | p. 562 |
| Solution Methods | p. 564 |
| Aggregate Calibration of Demand Models Using Traffic Counts | p. 569 |
| Estimation of Within-Period Dynamic Demand Flows Using Traffic Counts | p. 574 |
| Simultaneous Estimators | p. 578 |
| Sequential Estimators | p. 579 |
| Real-Time Estimation and Prediction of Within-Period Dynamic Demand Flows Using Traffic Counts | p. 580 |
| Applications of Demand Estimation Methods | p. 582 |
| Estimation of Present Demand | p. 582 |
| Estimation of Demand Variations (Forecasting) | p. 584 |
| Reference Notes | p. 586 |
| Transportation Supply Design Models | p. 589 |
| Introduction | p. 589 |
| General Formulations of the Supply Design Problem | p. 592 |
| Applications of Supply Design Models | p. 595 |
| Models for Road Network Layout Design | p. 596 |
| Models for Road Network Capacity Design | p. 598 |
| Models for Transit Network Design | p. 602 |
| Models for Pricing Design | p. 604 |
| Models for Mixed Design | p. 606 |
| Some Algorithms for Supply Design Models | p. 607 |
| Algorithms for the Discrete SDP | p. 607 |
| Algorithms for the Continuous SDP | p. 614 |
| Reference Notes | p. 619 |
| Methods for the Evaluation and Comparison of Transportation System Projects | p. 621 |
| Introduction | p. 621 |
| Evaluation of Transportation System Projects | p. 622 |
| Identification of Relevant Impacts | p. 623 |
| Identification and Estimation of Impact Indicators | p. 626 |
| Computation of Users' Surplus Changes | p. 628 |
| Methods for the Comparison of Alternative Projects | p. 641 |
| Benefit-Cost Analysis | p. 641 |
| Revenue-Cost Analysis | p. 647 |
| Multi-criteria Analysis | p. 648 |
| Noncompensatory Methods* | p. 658 |
| Multiattribute Utility Theory Method (MAUT)* | p. 660 |
| Linear Additive Methods* | p. 665 |
| The Analytical Hierarchy Process (AHP)* | p. 667 |
| Outranking Methods* | p. 673 |
| Constrained Optimization Method* | p. 677 |
| Reference Notes | p. 680 |
| Appendix A Review of Numerical Analysis | p. 683 |
| Sets and Functions | p. 683 |
| Elements of Set Topology | p. 683 |
| Continuous and Differentiable Functions | p. 685 |
| Convex Functions | p. 689 |
| Solution Algorithms | p. 690 |
| Fixed-Point Problems | p. 691 |
| Properties of Fixed-Points | p. 693 |
| Solution Algorithms for Fixed-Point Problems | p. 695 |
| Optimization Problems | p. 697 |
| Properties of Minimum Points | p. 697 |
| Properties of Minimum Points on Open Sets | p. 697 |
| Properties of Minimum Points on Closed Sets | p. 698 |
| Solution Algorithms for Optimization Problems | p. 699 |
| Monodimensional Optimization Algorithms | p. 699 |
| Unconstrained Multidimensional Optimization Algorithms | p. 703 |
| Bounded Variables Multidimensional Optimization Algorithms | p. 706 |
| Linearly Constrained Multidimensional Optimization Algorithms | p. 707 |
| Variational Inequality Problems | p. 709 |
| Properties of Variational Inequalities | p. 711 |
| Solution Algorithms for Variational Inequality Problems | p. 712 |
| Index | p. 715 |
| References | p. 725 |
| Table of Contents provided by Ingram. All Rights Reserved. |