Network flow assignment as a fixed point problem

DOI10.1134/S1990478916020095zbMath1349.90195MaRDI QIDQ3186863

Alexander Krylatov

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

fixed pointuser equilibriumsystem optimumnetwork routes

Mathematics Subject Classification ID

Noncooperative games (91A10) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25)

Related Items (3)

Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem ⋮ Column generation for the equilibrium route-flow traffic assignment problem ⋮ Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network

Cites Work

• Competitive routing of traffic flows by navigation providers
• Optimization of robust area traffic control with equilibrium flow under demand uncertainty
• Parallel optimization for traffic assignment
• A unified description of iterative algorithms for traffic equilibria
• Equilibrium, games, and pricing in transportation and telecommunication networks
• Mathematical modeling of traffic flows
• A review of urban transportation network design problems
• Wardrop Equilibrium for Networks with the BPR Latency Function
• Transit Network Design for Green Vehicles Routing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Network flow assignment as a fixed point problem