POSTOPTIMIZING EQUILIBRIUM FLOWS ON LARGE SCALE NETWORKS.

Abstract In a large variety of applications, equilibrium traffic flows corresponding to a set of slightly modified input data must be computed sequentially. Until now, it is believed that only a disaggregate decomposition approach, that works explicitly on the path flow space, offers the postoptimization capability. This note proposes a new postoptimization method to deal with perturbations of the traffic demand input that does not require path information. Numerical experiments on practical size networks show a drastic reduction in the number of iterations with respect to the naive restart approach.

[1]  S Nguyen,et al.  ESTIMATING ORIGIN DESTINATION MATRICES FROM OBSERVED FLOWS , 1984 .

[2]  C. S. Fisk,et al.  Trip matrix estimation from link traffic counts: The congested network case , 1989 .

[3]  Hai Yang,et al.  Estimation of origin-destination matrices from link traffic counts on congested networks , 1992 .

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

[5]  Ennio Cascetta,et al.  Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts , 1993, Transp. Sci..

[6]  Larry J. LeBlanc,et al.  Selection of a trip table which reproduces observed link flows , 1982 .

[7]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[8]  Torbjörn Larsson,et al.  Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem , 1992, Transp. Sci..

[9]  Sang Nguyen,et al.  A Unified Approach to Equilibrium Methods for Traffic Assignment , 1976 .

[10]  D Van Vliet.  SATURN - A MODERN ASSIGNMENT MODEL , 1982 .

[11]  J. A. Ventura,et al.  Restricted simplicial decomposition: computation and extensions , 1987 .

[12]  Michael Florian,et al.  An Application and Validation of Equilibrium Trip Assignment Methods , 1976 .

[13]  M. Florian,et al.  A COORDINATE DESCENT METHOD FOR THE BILEVEL O-D MATRIX ADJUSTMENT PROBLEM , 1992 .

[14]  D. Van Vliet,et al.  A Full Analytical Implementation of the PARTAN/Frank-Wolfe Algorithm for Equilibrium Assignment , 1990, Transp. Sci..

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

[16]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

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

[18]  M C Bell.  TECHNIQUES FOR THE DYNAMIC ESTIMATION OF O-D MATRICES IN TRAFFIC NETWORKS , 1991 .

[19]  Ron S. Dembo,et al.  Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms , 1988, Networks.

[20]  Stefano Pallottino,et al.  Equilibrium traffic assignment for large scale transit networks , 1988 .

[21]  H Spiess.  A GRADIENT APPROACH FOR THE O-D MATRIX ADJUSTMENT PROBLEM , 1990 .

[22]  David E. Boyce,et al.  Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs , 1985, Transp. Sci..

[23]  Michael Florian,et al.  An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem , 1987, Networks.

[24]  M. Florian.  Transportation planning models , 1984 .

[25]  T. Magnanti.  MODELS AND ALGORITHMS FOR PREDICTING URBAN TRAFFIC EQUILIBRIA , 1984 .

[26]  Clermont Dupuis,et al.  An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs , 1984, Transp. Sci..