Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks
DOI10.1287/opre.2018.1775zbMath1443.90122OpenAlexW2908568365WikidataQ128549614 ScholiaQ128549614MaRDI QIDQ4971585
Publication date: 12 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2018.1775
branch-and-bound algorithmfirst-in-first-outdynamic traffic assignmentlink transmission modelsystem optimumvehicle holding problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (4)
Cites Work
- Dynamic user equilibrium model for combined activity-travel choices using activity-travel supernetwork representation
- Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions
- Link travel times. I: Desirable properties
- A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
- An Analytical Model for Traffic Delays and the Dynamic User Equilibrium Problem
- Optimal Time-Varying Flows on Congested Networks
- An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows
- Shock Waves on the Highway
- Branch-and-Bound Methods: A Survey
- Branch-and-Bound Methods: General Formulation and Properties
- On kinematic waves II. A theory of traffic flow on long crowded roads
This page was built for publication: Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks