Network flow assignment as a fixed point problem
From MaRDI portal
Recommendations
- A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium
- A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
- scientific article; zbMATH DE number 970012
- System optimal and user equilibrium time-dependent traffic assignment in congested networks
- Traffic assignment: equilibrium models
Cites work
- A review of urban transportation network design problems
- A unified description of iterative algorithms for traffic equilibria
- Competitive green-vehicle assignment on a transportation network
- Competitive routing of traffic flows by navigation providers
- Equilibrium, games, and pricing in transportation and telecommunication networks
- Mathematical game theory and applications
- Mathematical modeling of traffic flows
- Nash equilibrium in a transport model with quadratic costs
- Optimization of robust area traffic control with equilibrium flow under demand uncertainty
- Parallel optimization for traffic assignment
- Traffic flow systems equilibria in megapolises and navigators' strategies: a game-theoretic approach
- Transit Network Design for Green Vehicles Routing
- Wardrop equilibrium for networks with the BPR latency function
Cited in
(17)- A globally convergent algorithm for solving special utilization equations
- Efficient implementation of heuristics for the continuous network design problem
- A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium
- Column generation for the equilibrium route-flow traffic assignment problem
- Fixed-point fast sweeping weighted essentially non-oscillatory method for multi-commodity continuum traffic equilibrium assignment problem
- Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium
- scientific article; zbMATH DE number 4167849 (Why is no real title available?)
- Nonlinear cost network models in transportation analysis
- Deterministic flow-demand location problems
- A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
- Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem
- Network Flow in Graph Theory - The Producer’s Problem
- scientific article; zbMATH DE number 1867317 (Why is no real title available?)
- Non-Convex Traffic Assignment on a Rectangular Grid Network
- scientific article; zbMATH DE number 970012 (Why is no real title available?)
- Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network
- Global optimum search in the network design problem
This page was built for publication: Network flow assignment as a fixed point problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186863)
