Optimal Time-Varying Flows on Congested Networks
From MaRDI portal
Publication:3767102
Recommendations
Cited in
(41)- Congested network flows: Time-varying demands and start-time policies
- A variational inequality formulation of the dynamic traffic assignment problem
- A differential game approach to the dynamic mixed behavior traffic network equilibrium problem
- Node and link models for network traffic flow simulation
- A path-based solution algorithm for dynamic traffic assignment
- Temporal network optimization subject to connectivity constraints
- Extending and solving a multiperiod congested network flow model
- An exit-flow model used in dynamic traffic assignment
- 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
- Determining the optimal flows in zero-time dynamic networks
- 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
- Optimum departure times for commuters in congested networks
- Simultaneous departure time/route choices in queuing networks and a novel paradox
- A dynamic network loading model for mesosimulation in transportation systems
- Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum
- A cumulative perceived value-based dynamic user equilibrium model considering the travelers' risk evaluation on arrival time
- 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?)
- Optimizing network flows with congestion-based flow reductions
- Optimization-based, QoS-aware distributed traffic control laws for networks with time-varying link capacities
- Traffic Networks and Flows over Time
- scientific article; zbMATH DE number 1488014 (Why is no real title available?)
- ANALYSIS OF LANE-BLOCKING EVENTS WITH AN ANALYTICAL DYNAMIC TRAFFIC ASSIGNMENT MODEL
- scientific article; zbMATH DE number 758127 (Why is no real title available?)
- Link-based system optimum dynamic traffic assignment problems in general networks
- A critical survey on the network optimization algorithms for evacuation planning problems
- A measure theoretic approach to traffic flow optimisation on networks
- Optimal Flows in Stochastic Dynamic Networks with Congestion
- 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 6783389 (Why is no real title available?)
- scientific article; zbMATH DE number 2223065 (Why is no real title available?)
- Some consistency conditions for dynamic traffic assignment problems
- A comparative study of some macroscopic link models used in dynamic traffic assignment
- A combinatorial user optimal dynamic traffic assignment algorithm
- Time-varying network optimization.
- Optima and equilibria for traffic flow on networks with backward propagating queues
- A survey of dynamic network flows
This page was built for publication: Optimal Time-Varying Flows on Congested Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767102)
