Optimal sub-networks in traffic assignment problem and the Braess paradox

Authors:
Y. Askoura;J. P. Lebacque;H. Haj-Salem
Affiliations:
Gretia, INRETS, Le Descartes 2, 2, rue de la Butte Verte, F-93166 Noisy le Grand cedex, France;Gretia, INRETS, Le Descartes 2, 2, rue de la Butte Verte, F-93166 Noisy le Grand cedex, France;Gretia, INRETS, Le Descartes 2, 2, rue de la Butte Verte, F-93166 Noisy le Grand cedex, France
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 4
Cited 0

A stronger bound on Braess's Paradox

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Braess's paradox in large random graphs

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
On the severity of Braess's paradox: designing networks for selfish users is hard

Journal of Computer and System Sciences - Special issue on FOCS 2001
On a Paradox of Traffic Planning

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is related to the Braess paradox. For a given transportation network, we are interested in the origin-destination (OD) travel costs in its sub-networks. Speaking about the performance of a network in terms of its equilibrium travel costs, we try to select the best sub-network of the original one. In a one OD pair network, by removing arcs, the equilibrium travel cost can decrease. Thus we ask for a sub-network for which the travel cost at equilibrium is minimum. In the case of multiple OD pairs, a multi-criteria comparison concept (Pareto optimality) is used to compare equilibria in sub-networks. The problem is formulated as an optimization problem. Only the fixed demand case is dealt with.