A decomposition approach to the static traffic assignment problem

This paper describes a spatial parallelization scheme for the static traffic assignment problem. In this scheme, which we term a decomposition approach to the static traffic assignment problem (DSTAP), the network is divided into smaller networks, and the algorithm alternates between equilibrating these networks as subproblems, and master iterations using a simplified version of the full network. The simplified network used for the master iterations is based on linearizations to the equilibrium solution for each subnetwork obtained using sensitivity analysis techniques. We prove that the DSTAP method converges to the equilibrium solution on the full network, and demonstrate computational savings of 35–70% on the Austin network. Natural applications of this method are statewide or national assignment problems, or cities with rivers or other geographic features where subnetworks can be easily defined.

[1]  G. Gentile.  Local User Cost Equilibrium: a bush-based algorithm for traffic assignment , 2014 .

[2]  Michael Florian,et al.  A New Look at Projected Gradient Method for Equilibrium Assignment , 2009 .

[3]  Stephen D Boyles.  Improved Bush-Based Sensitivity Analysis in Network Equilibrium , 2013 .

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

[5]  Yu Nie,et al.  A class of bush-based algorithms for the traffic assignment problem , 2009 .

[6]  Kara M. Kockelman,et al.  Maximum Entropy Method for Subnetwork Origin–Destination Trip Matrix Estimation , 2010 .

[7]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[8]  D W Hearn.  PRACTICAL AND THEORETICAL ASPECTS OF AGGREGATION PROBLEMS IN TRANSPORTATION PLANNING MODELS , 1984 .

[9]  L. M. Dubkin,et al.  Iterative aggregation theory , 1987 .

[10]  E. M. L. Beale,et al.  Nonlinear Programming: A Unified Approach. , 1970 .

[11]  S. Travis Waller,et al.  Influence of Demand Uncertainty and Correlations on Traffic Predictions and Decisions , 2011, Comput. Aided Civ. Infrastructure Eng..

[12]  Athanasios Migdalas,et al.  Distributed Disaggregate Simplicial Decomposition : A Parallel Algorithm for Traffic Assignment , 1997 .

[13]  Hong Zheng.  Adaptation of Network Simplex for the Traffic Assignment Problem , 2015, Transp. Sci..

[14]  Y. J. Lee,et al.  Equilibrium Traffic Assignment on an Aggregated Highway Network for Sketch Planning , 2022 .

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

[16]  Robert B. Dial,et al.  A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration , 2006 .

[17]  Alan J Horowitz.  Statewide Travel Forecasting Models , 2006 .

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

[19]  Per Olov Lindberg,et al.  The Stiff Is Moving - Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment , 2013, Transp. Sci..

[20]  Russell R. Barton,et al.  The equivalence of transfer and generalized benders decomposition methods for traffic assignment , 1989 .

[21]  M. Patriksson,et al.  Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design , 2007 .

[22]  Michael Patriksson,et al.  The Traffic Assignment Problem: Models and Methods , 2015 .

[23]  David E. Boyce,et al.  IMPLEMENTATION AND EVALUATION OF COMBINED MODELS OF URBAN TRAVEL AND LOCATION ON A SKETCH PLANNING NETWORK , 1985 .

[24]  Pablo A. Lotito,et al.  Issues in the implementation of the DSD algorithm for the traffic assignment problem , 2006, Eur. J. Oper. Res..

[25]  D. Bertsekas.  On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[26]  Hillel Bar-Gera,et al.  Traffic Assignment by Paired Alternative Segments , 2010 .

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

[28]  Athanasios Migdalas,et al.  Efficient minimization over products of simplices and its application to nonlinear multicommodity network problems , 2004, Oper. Res..

[29]  R. Jayakrishnan,et al.  A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENT , 1994 .

[30]  Stephen D. Boyles,et al.  Bush-based sensitivity analysis for approximating subnetwork diversion , 2012 .

[31]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[32]  Hani S. Mahmassani,et al.  Dynamic origin-destination trip demand estimation for subarea analysis , 2006 .

[33]  Terry L. Friesz,et al.  A reduction method for local sensitivity analyses of network equilibrium arc flows , 2000 .

[34]  Terry L. Friesz,et al.  Sensitivity Analysis for Equilibrium Network Flow , 1988, Transp. Sci..

[35]  Srinivas Peeta,et al.  Cost Scaling Based Successive Approximation Algorithm for the Traffic Assignment Problem , 2014 .

[36]  Michael Patriksson,et al.  Sensitivity Analysis of Traffic Equilibria , 2004, Transp. Sci..

[37]  Hai Yang,et al.  Sensitivity Analysis of Network Traffic Equilibrium Revisited: The Corrected Approach , 2007 .

[38]  Robert R. Meyer,et al.  Parallel optimization for traffic assignment , 1988, Math. Program..

[39]  Hillel Bar-Gera,et al.  Primal Method for Determining the Most Likely Route Flows in Large Road Networks , 2006, Transp. Sci..

[40]  Kara M. Kockelman,et al.  A Maximum Entropy-least Squares Estimator for Elastic Origin-Destination Trip Matrix Estimation , 2011 .

[41]  Yupo Chan,et al.  A method to simplify network representation in transportation planning , 1976 .

[42]  Stephen D. Boyles,et al.  Improved bush-based methods for network contraction , 2016 .

[43]  Mark S. Daskin,et al.  NETWORK DESIGN APPLICATION OF AN EXTRACTION ALGORITHM FOR NETWORK AGGREGATION. , 1983 .

[44]  C. B. Mcguire,et al.  Studies in the Economics of Transportation , 1958 .

[45]  James R. Evans,et al.  Aggregation and Disaggregation Techniques and Methodology in Optimization , 1991, Oper. Res..