Optimal Flows in Stochastic Dynamic Networks with Congestion

DOI10.1287/OPRE.41.1.203MaRDI QIDQ5288152zbMATH OpenOpenAlexFDO

Authors John R. Birge, James K. Ho

Publication date 9 August 1993

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.41.1.203

zbMATH Keywords

decomposition algorithmdynamic networkdynamic traffic assignmentjob shop routingoptimal flowsrandom inputs

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Recommendations

• Optimal Time-Varying Flows on Congested Networks
• Optimal flows in dynamic networks and algorithms for their finding
• scientific article; zbMATH DE number 5129471
• scientific article; zbMATH DE number 934458
• Determining the optimal flows in zero-time dynamic networks
• Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation
• The maximum flow in dynamic networks
• Optimal control of dynamic routing in networks with randomly perturbed flows
• Facets of the stochastic network flow problem
• Existence of optima and equilibria for traffic flow on networks

Cited in

(28)

• Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions
• Optimizing flow rates in a queueing network with side constraints
• Postoptimizing equilibrium flows on large scale networks
• Modelling and analysis of multistage stochastic programming problems: A software environment
• Optimal stochastic switching of dynamic routing in networks
• Intelligent transportation systems -- Enabling technologies
• Determining the optimal flows in zero-time dynamic networks
• Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
• Probabilistic constrained optimization on flow networks
• Single-path routing of stochastic flows in networks
• The analysis of Braess' paradox and robustness based on dynamic traffic assignment models
• Dynamic traffic network model and time-dependent Braess' paradox
• A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
• scientific article; zbMATH DE number 1594568 (Why is no real title available?)
• Optimal routing for minimizing the maximal link congestion
• scientific article; zbMATH DE number 5129471 (Why is no real title available?)
• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 3972592 (Why is no real title available?)
• scientific article; zbMATH DE number 3976729 (Why is no real title available?)
• scientific article; zbMATH DE number 4072676 (Why is no real title available?)
• Optimal control of dynamic routing in networks with randomly perturbed flows
• A measure theoretic approach to traffic flow optimisation on networks
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• AN INDIVIDUAL AND SOCIALLY OPTIMAL POLICY MINIMIZING EXPECTED FLOW TIMES
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• Mean‐standard deviation model for minimum cost flow problem
• Optimal placement of extrapolators for random flow prediction
• Optima and equilibria for traffic flow on networks with backward propagating queues

Describes a project that uses

Uses Software

• MSLiP

This page was built for publication: Optimal Flows in Stochastic Dynamic Networks with Congestion

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