- Transportation Networks: Planning and Modeling
- Transportation Systems Analysis
- Transport Networks in Travel Forecasting
- The OR Transportation Problem
- Networks, Performance, Transshipment
- Data Structures, Programs, and Algorithms
- Performance Procedures
- The Transshipment Problem
- The Shortest Path Problem
- Label Correcting and Label Setting Algorithms
- One to All Shortest Path Algorithms
- All Nodes to All Nodes Algorithms
- The Trip Assignment Problem
- Conceptual Formulations
- Heuristic Methods
- Wardrop's Principles: User Equilibrium (UE) and System Optimal (SO)
- Multipath / Probabilistic Assignment
- Deterministic Network Loading: Non-Equilibrium (Heuristic) Methods
- All-or-Nothing Loading
- Capacity Restraint Assignment
- Incremental Assignment
- Deterministic Network Loading: Equilibration Methods
- Beckmann Transformation and User Equilibration (UE)
- Equivalency and Uniqueness Conditions
- System Optimal (SO) Formulation
- Iterative Assignment: MSA
- Iterative Assignment: Frank-Wolfe Algorithms
- The Braess Paradox
- Stochastic Network Loading
- Dial's Algorithm
- Stochastic User Equilibrium
- Variable Demand
- Advanced Network Topics (as time allows):
- Alternate Assignment Formulations (path-based and origin-based)
- Dynamic Traffic Assignment
- Other Topics (O/D Table Generation Methods, Network Design)
|