Title :
Optimal subnetworks in traffic assignment problem and the Braess paradox
Author :
Askoura, Y. ; Lebacque, J.P. ; Haj-Salem, H.
Author_Institution :
Ecole des Ponts ParisTech, Univ. Paris Est (UMR LVMT), Champs-sur-Marne, France
Abstract :
In this paper, we try to formulate the occurrence of the Braess paradox and the optimal use of networks as optimization problems. We consider the fixed demand case and study some types of static and dynamic assignment. Numerical illustrations are given in the two cases.
Keywords :
traffic engineering computing; transportation; Braess paradox; dynamic traffic assignment; optimal subnetwork; traffic assignment problem; Cost function; Telecommunication traffic; Transportation; Braess Paradox; dynamic traffic assignment; static traffic assignment;
Conference_Titel :
Computers & Industrial Engineering, 2009. CIE 2009. International Conference on
Conference_Location :
Troyes
Print_ISBN :
978-1-4244-4135-8
Electronic_ISBN :
978-1-4244-4136-5
DOI :
10.1109/ICCIE.2009.5223734
