Network flow assignment as a~fixed point problem
Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 2, pp. 63-87
Voir la notice de l'article provenant de la source Math-Net.Ru
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 equilibrium and optimal flow assignment is developed. The method is proved to converge geometrically; under some fairly natural conditions the method is proved to converge quadratically. Bibliogr. 30.
Keywords:
user-equilibrium, system optimum, fixed point, network routes.
@article{DA_2016_23_2_a3,
author = {A. Yu. Krylatov},
title = {Network flow assignment as a~fixed point problem},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {63--87},
publisher = {mathdoc},
volume = {23},
number = {2},
year = {2016},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2016_23_2_a3/}
}
A. Yu. Krylatov. Network flow assignment as a~fixed point problem. Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 2, pp. 63-87. http://geodesic.mathdoc.fr/item/DA_2016_23_2_a3/