Network flow assignment as a fixed point problem |
| |
Authors: | A. Yu. Krylatov |
| |
Affiliation: | 1.St. Petersburg State University,St. Petersburg,Russia;2.Solomenko Institute of Transport Problems,St. Petersburg,Russia |
| |
Abstract: | This paper deals with the user equilibrium problem (flow assignment with equal journey time by alternative routes) and system optimum (flow assignment with minimal average journey time) in a network consisting of parallel routes with a single origin-destination pair. The travel time is simulated by arbitrary smooth nondecreasing functions. We prove that the equilibrium and optimal assignment problems for such a network can be reduced to the fixed point problem expressed explicitly. A simple iterative method of finding equilibriumand optimal flow assignment is developed. The method is proved to converge geometrically; under some fairly natural conditions the method is proved to converge quadratically. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|