Comparative tests of multimodal traffic equilibrium methods

In this study we proceeded to test the relative efficiencies of the two main computational techniques now available for calculating the traffic equilibrium in multimodal networks, namely, the relaxation and projection methods. Since both of these methods solve at each step a mathematical programming problem, we first set out to test the Frank-Wolfe algorithm and the Dafermos-Sparrow algorithm and found the latter to be the more efficient algorithm. As expected, this was also the case when these algorithms were used to solve the mathematical programming problem at each step of the relaxation method. We then investigated how different versions of the projection method enhance its performance. Subsequently, we proceeded to our main goal to compare the best projection method with the relaxation method. We tested multimodal networks with three different classes of monotone travel cost functions and found that the form of the travel cost functions affects the performance of the two basic techniques available for computing the multimodal equilibrium.

[1]  Jong-Shi Pang,et al.  Iterative methods for variational and complementarity problems , 1982, Math. Program..

[2]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[3]  George L. Nemhauser,et al.  A Column Generation Algorithm for Optimal Traffic Assignment , 1973 .

[4]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.

[5]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

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

[7]  S. Dafermos.  Relaxation Algorithms for the General Asymmetric Traffic Equilibrium Problem , 1982 .

[8]  Sang Nguyen,et al.  Solution Algorithms for Network Equilibrium Models with Asymmetric User Costs , 1982 .

[9]  Mike Smith,et al.  An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function , 1983 .

[10]  Stella Dafermos,et al.  The general multimodal network equilibrium problem with elastic demand , 1982, Networks.

[11]  Mike Smith,et al.  The existence, uniqueness and stability of traffic equilibria , 1979 .

[12]  G. Stampacchia,et al.  On some non-linear elliptic differential-functional equations , 1966 .

[13]  C. Panne,et al.  The Simplex and the Dual Method for Quadratic Programming , 1964 .

[14]  D. Bertsekas,et al.  Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .

[15]  Stella Dafermos,et al.  Integrated Equilibrium Flow Models for Transportation Planning , 1976 .

[16]  Michael Florian,et al.  Recent Experience with Equilibrium Methods for the Study of a Congested Urban Area , 1976 .

[17]  D. Hearn,et al.  Simplical decomposition of the asymmetric traffic assignment problem , 1984 .

[18]  Stella Dafermos,et al.  An iterative scheme for variational inequalities , 1983, Math. Program..

[19]  R. M. Oliver,et al.  Flows in transportation networks , 1972 .

[20]  Stella Dafermos,et al.  An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .

[21]  S. Dafermos.  The Traffic Assignment Problem for Multiclass-User Transportation Networks , 1972 .

[22]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[23]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .