On the Braess Paradox with Nonlinear Dynamics and Control Theory

We show the existence of the Braess paradox for a traffic network with nonlinear dynamics described by the Lighthill–Whitham–Richards model for traffic flow. Furthermore, we show how one can employ control theory to avoid the paradox. The paper offers a general framework applicable to time-independent, uncongested flow on networks. These ideas are illustrated through examples.

[1]  A. Bressan,et al.  Nash equilibria for a model of traffic flow with several groups of drivers , 2012 .

[2]  Michael T. Gastner,et al.  Erratum: Price of Anarchy in Transportation Networks: Efficiency and Optimality Control [Phys. Rev. Lett. 101, 128701 (2008)] , 2009 .

[3]  A. Nagurney,et al.  ON SOME TRAFFIC EQUILIBRIUM THEORY PARADOXES , 1984 .

[4]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[5]  J. N. Hagstrom,et al.  Characterizing Braess's paradox for traffic networks , 2001, ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585).

[6]  M J Lighthill,et al.  On kinematic waves II. A theory of traffic flow on long crowded roads , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[7]  M J Lighthill,et al.  ON KINEMATIC WAVES.. , 1955 .

[8]  P. I. Richards.  Shock Waves on the Highway , 1956 .

[9]  Richard Steinberg,et al.  PREVALENCE OF BRAESS' PARADOX , 1983 .

[10]  S. Huant,et al.  Transport inefficiency in branched-out mesoscopic networks: an analog of the Braess paradox. , 2011, Physical review letters.

[11]  Anna Nagurney,et al.  Preface to "On a Paradox of Traffic Planning" , 2005, Transp. Sci..

[12]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[13]  Michael T. Gastner,et al.  Price of anarchy in transportation networks: efficiency and optimality control. , 2007, Physical review letters.

[14]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[15]  Walter Knödel,et al.  Graphentheoretische Methoden und ihre Anwendungen , 1969 .

[16]  Mauro Garavello,et al.  Traffic Flow on Networks , 2006 .

[17]  Tim Roughgarden,et al.  On the severity of Braess's Paradox: Designing networks for selfish users is hard , 2006, J. Comput. Syst. Sci..

[18]  J. Wardrop.  ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[19]  Anna Nagurney,et al.  On a Paradox of Traffic Planning , 2005, Transp. Sci..

[20]  Marguerite FRANK,et al.  The Braess paradox , 1981, Math. Program..

[21]  Joel E. Cohen,et al.  Paradoxical behaviour of mechanical and electrical networks , 1991, Nature.

[22]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[23]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[24]  Rinaldo M. Colombo,et al.  A Hölder continuous ODE related to traffic flow , 2003, Proceedings of the Royal Society of Edinburgh: Section A Mathematics.

[25]  H. Holden,et al.  Front Tracking for Hyperbolic Conservation Laws , 2002 .

[26]  Ke Han,et al.  Existence of optima and equilibria for traffic flow on networks , 2012, Networks Heterog. Media.

[27]  K. Small,et al.  The Economics Of Traffic Congestion , 1993 .

[28]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[29]  H. Holden,et al.  A mathematical model of traffic flow on a network of unidirectional roads , 1995 .