Stattic Traffic Assignment Problem: A comparison between Beckmann (1956) and Nesterov & De Palma (1998) models

Since 1956, the Beckmann model is the reference for the static trafc equilibrium problem not only from a theoretical but also from a practical point of view. In 1998, Nesterov & de Palma developed a new model for the static trafc equilibrium problem. In contrast to the Beckmann model, the travel time on an arc is a variable of an optimization problem and it is not determined only by the o w on this arc. Additionally, road capacity constraints are explicitly modeled. The main objective of this work is to provide clarity on model differences both theoretically and practically. First, we consider qualitative differences between both models. In particular, the notion of delays, congestion, the detection of Braess arcs, and the price of anarchy are presented. Secondly, we study quantitative differences in the solutions of both models using large-scale benchmark instances as well as real data. For the Beckmann model, we solve the corresponding optimization problem using the VISUM software. For the Nesterov & de Palma model, we design algorithms based on non-smooth methods developed by Nesterov in 2005.

[1]  Hillel Bar-Gera,et al.  Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..

[2]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[3]  André de Palma,et al.  Stationary Dynamic Solutions in Congested Transportation Networks: Summary and Perspectives , 2003 .

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

[5]  Yurii Nesterov,et al.  Primal-dual subgradient methods for convex problems , 2005, Math. Program..

[6]  José R. Correa,et al.  Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .

[7]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[8]  Tim Roughgarden,et al.  Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..

[9]  A. Nagurney,et al.  A retrospective on Beckmann, McGuire and Winsten's "Studies in the Economics of Transportation" , 2005 .

[10]  Torbjörn Larsson,et al.  Side constrained traffic equilibrium models: analysis, computation and applications , 1999 .

[11]  A. Palma,et al.  Optimization formulations and static equilibrium in congested transportation networks , 1998 .

[12]  A. Palma,et al.  Stable Dynamics in Transportation Systems , 2000 .

[13]  Tim Roughgarden,et al.  The price of anarchy is independent of the network topology , 2002, STOC '02.

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

[15]  A. Nagurney Network Economics: A Variational Inequality Approach , 1992 .