Optimal Time-Varying Flows on Congested Networks

DOI10.1287/opre.35.1.58zbMath0629.90033OpenAlexW1990246012MaRDI QIDQ3767102

Malachy Carey

Publication date: 1987

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

general congested networkleast-cost flowsoptimal flow controls

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (26)

A cumulative perceived value-based dynamic user equilibrium model considering the travelers' risk evaluation on arrival time ⋮ An exit-flow model used in dynamic traffic assignment ⋮ Optimizing network flows with congestion-based flow reductions ⋮ Simultaneous departure time/route choices in queuing networks and a novel paradox ⋮ A path-based solution algorithm for dynamic traffic assignment ⋮ ANALYSIS OF LANE-BLOCKING EVENTS WITH AN ANALYTICAL DYNAMIC TRAFFIC ASSIGNMENT MODEL ⋮ A dynamic route assignment model for guided and unguided vehicles with a massively parallel computing architecture ⋮ Dynamic traffic assignment: Considerations on some deterministic modelling approaches ⋮ System optimal and user equilibrium time-dependent traffic assignment in congested networks ⋮ Congested network flows: Time-varying demands and start-time policies ⋮ A combinatorial user optimal dynamic traffic assignment algorithm ⋮ A differential game approach to the dynamic mixed behavior traffic network equilibrium problem ⋮ A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem ⋮ A dynamic network loading model for mesosimulation in transportation systems ⋮ A survey of dynamic network flows ⋮ Unnamed Item ⋮ Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum ⋮ Path-based dynamic user equilibrium model with applications to strategic transportation planning ⋮ Order release planning by iterative simulation and linear programming: theoretical foundation and analysis of its shortcomings ⋮ Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks ⋮ Extending and solving a multiperiod congested network flow model ⋮ Traffic Networks and Flows over Time ⋮ Some consistency conditions for dynamic traffic assignment problems ⋮ A comparative study of some macroscopic link models used in dynamic traffic assignment ⋮ A variational inequality formulation of the dynamic traffic assignment problem ⋮ Node and link models for network traffic flow simulation

This page was built for publication: Optimal Time-Varying Flows on Congested Networks