Stochastic traffic assignment, Lagrangian dual, and unconstrained convex optimization

In this paper, traffic assignment problems with stochastic travel cost perceptions are reformulated and investigated in a new unconstrained nonlinear programming formulation. The objective function of the unconstrained formulation consists of two terms, in which the first term specifies the routing principle of the target problem through a satisfaction function and the sum of the first and second terms denotes the system cost or optimization objective. This formulation proves to be the Lagrangian dual of a generic primal formulation proposed by Maher et al. (2005) for the stochastic system-optimal problem. The primal–dual modeling framework presents such a common functional form that can accommodate a wide range of different traffic assignment problems. Our particular attention is given to the dual formulation in that its unconstrained feature opens the door of applying unconstrained optimization algorithms for its embraced traffic assignment problems. Numerical examples are provided to support the insights and facts derived from applying the primal and dual formulations to model stochastic system-optimal and user-equilibrium problems and justify the conjugate relationship between the primal and dual models.

[1]  Giulio Erberto Cantarella,et al.  A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand , 1997, Transp. Sci..

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

[3]  H. Williams.  On the Formation of Travel Demand Models and Economic Evaluation Measures of User Benefit , 1977 .

[4]  Hong Kam Lo,et al.  Traffic equilibrium problem with route-specific costs: formulation and algorithms , 2000 .

[5]  M. Bell.  Alternatives to Dial's logit assignment algorithm , 1995 .

[6]  Torbjörn Larsson,et al.  A dual scheme for traffic assignment problems , 1997 .

[7]  Hai Yang,et al.  The multi-class, multi-criteria traffic network equilibrium and systems optimum problem , 2004 .

[8]  Suzanne P. Evans,et al.  DERIVATION AND ANALYSIS OF SOME MODELS FOR COMBINING TRIP DISTRIBUTION AND ASSIGNMENT , 1976 .

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

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

[11]  C. Fisk.  Some developments in equilibrium traffic assignment , 1980 .

[12]  Malachy Carey,et al.  The dual of the traffic assignment problem with elastic demands , 1985 .

[13]  Takashi Akamatsu,et al.  Cyclic flows, Markov process and stochastic traffic assignment , 1996 .

[14]  A. Alfa,et al.  Algorithms for solving fisk's stochastic traffic assignment model , 1991 .

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

[16]  Mike Maher.  Stochastic user equilibrium assignment with elastic demand , 2001 .

[17]  D. Hearn,et al.  A DUAL ASCENT ALGORITHM FOR TRAFFIC ASSIGNMENT PROBLEMS , 1990 .

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

[19]  Donald W. Hearn,et al.  The gap function of a convex program , 1982, Operations Research Letters.

[20]  Der-Horng Lee,et al.  Origin-Based Partial Linearization Method for the Stochastic User Equilibrium Traffic Assignment Problem , 2010 .

[21]  M. Fukushima.  On the dual approach to the traffic assignment problem , 1984 .

[22]  P. Hughes,et al.  A PROBIT-BASED STOCHASTIC USER EQUILIBRIUM ASSIGNMENT MODEL , 1997 .

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

[24]  D. Hearn,et al.  CONVEX PROGRAMMING FORMULATIONS OF THE ASYMMETRIC TRAFFIC ASSIGNMENT PROBLEM , 1984 .

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

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

[27]  Qiang Meng,et al.  General stochastic user equilibrium traffic assignment problem with link capacity constraints , 2008 .

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

[29]  Henry X. Liu,et al.  Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium Problem , 2009 .

[30]  S. Nguyen.  An Algorithm for the Traffic Assignment Problem , 1974 .

[31]  Mike Maher,et al.  Stochastic social optimum traffic assignment. , 2005 .

[32]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[33]  Mike Maher,et al.  Algorithms for logit-based stochastic user equilibrium assignment , 1998 .

[34]  David Bernstein,et al.  The Traffic Equilibrium Problem with Nonadditive Path Costs , 1995, Transp. Sci..

[35]  C. Daganzo.  Unconstrained Extremal Formulation of Some Transportation Equilibrium Problems , 1982 .

[36]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[37]  Warren B. Powell,et al.  An algorithm for the equilibrium assignment problem with random link times , 1982, Networks.

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

[39]  M. A. Hall,et al.  Traffic Equilibria Analysed Via Geometric Programming , 1976 .