Optimizing network flows with congestion-based flow reductions

DOI10.1007/s11067-012-9181-3zbMath1339.90077OpenAlexW2028489660MaRDI QIDQ300323

Douglas R. Bish, Hesham A. Rakha, Edward P. Chamberlayne

Publication date: 27 June 2016

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-012-9181-3

zbMATH Keywords

congestioncell transmission model (CTM)evacuation planning/modelingmixed binary programmingtime-expanded network flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (3)

Sustainability SI: bundling of outbound freight flows: analyzing the potential of internal horizontal collaboration to improve sustainability ⋮ Routing strategies under demand uncertainty ⋮ Dynamic resource allocation problem for transportation network evacuation

Cites Work

• Dynamic traffic assignment under uncertainty: a distributional robust chance-constrained approach
• Robust optimization model for a dynamic network design problem under demand uncertainty
• Evacuation transportation planning under uncertainty: A robust optimization approach
• Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions
• Aggregate-level demand management in evacuation planning
• A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
• Still Flowing: Approaches to Traffic Flow and Traffic Jam Modeling
• Optimal Time-Varying Flows on Congested Networks
• A Cell-Based Traffic Control Formulation: Strategies and Benefits of Dynamic Timing Plans
• Shock Waves on the Highway
• On kinematic waves I. Flood movement in long rivers

This page was built for publication: Optimizing network flows with congestion-based flow reductions