Optimizing network flows with congestion-based flow reductions

DOI10.1007/S11067-012-9181-3MaRDI QIDQ300323zbMATH OpenOpenAlexFDO

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

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

cell transmission model (CTM)congestionevacuation planning/modelingmixed binary programmingtime-expanded network flows

Mathematics Subject Classification ID

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

Recommendations

• Flow optimization on traffic networks
• Optimal Time-Varying Flows on Congested Networks
• Congestion minimization for multipath routing via multiroute flows
• Improving the Performance of Network Congestion Control Algorithms
• Optimization Problems Related to Internet Congestion Control
• Optimal Congestion Control in Single Destination Networks
• Network flow control under capacity constraints: a case study
• Network flow optimization with minimum quantities

Cites work

• A Cell-Based Traffic Control Formulation: Strategies and Benefits of Dynamic Timing Plans
• A linear programming model for the single destination system optimum dynamic traffic assignment problem
• Aggregate-level demand management in evacuation planning
• Dynamic traffic assignment under uncertainty: a distributional robust chance-constrained approach
• 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
• On kinematic waves I. Flood movement in long rivers
• Optimal Time-Varying Flows on Congested Networks
• Robust optimization model for a dynamic network design problem under demand uncertainty
• Shock waves on the highway
• Still Flowing: Approaches to Traffic Flow and Traffic Jam Modeling

Cited in

(5)

• Sustainability SI: bundling of outbound freight flows: analyzing the potential of internal horizontal collaboration to improve sustainability
• Routing strategies under demand uncertainty
• Finding optimal non-datapath caching strategies via network flow
• Dynamic resource allocation problem for transportation network evacuation
• Algorithm for Reducing the Number of Forwarding Rules Created by SDN Applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300323)