A column generation procedure for the side constrained traffic equilibrium problem

We present a column generation procedure for the side constrained traffic equilibrium problem. A dual stabilization scheme is introduced to improve the computational performance. Computational experiments for the case of linear side constraints are presented. The test problems are well known traffic equilibrium instances where side constraints of link flow capacity type and general linear side constraints are added. The computational results are promising especially for instances with a relatively small number of side constraints.

[1]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[2]  P. Ferrari.  Road pricing and network equilibrium , 1995 .

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

[4]  D. Hearn,et al.  Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems , 1981 .

[5]  L. A. Pilipchuk,et al.  Network optimization problems , 2002 .

[6]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[7]  Mustafa Ç. Pinar,et al.  Solving Nonlinear Programs with Embedded Network Structures , 1993 .

[8]  Hai Yang,et al.  Traffic Assignment and Traffic Control in General Freeway-arterial Corridor Systems , 1994 .

[9]  Michel Gendreau,et al.  Transportation and network analysis : current trends : miscellanea in honor of Michael Florian , 2002 .

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

[11]  M. Patriksson,et al.  An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems , 1995 .

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

[13]  S. Mathies,et al.  A hybrid algorithm for solving network flow problems with side constraints , 1998, Comput. Oper. Res..

[14]  Nathan H. Gartner,et al.  Optimal traffic assignment with elastic demands: A Review , 1980 .

[15]  Michael Patriksson,et al.  A Decision Support Methodology for Strategic Traffic Management , 2001 .

[16]  M. Wagner,et al.  Generalized Linear Programming Solves the Dual , 1976 .

[17]  M Patriksson,et al.  SIMPLICIAL DECOMPOSITION WITH DISAGGREGATE REPRESENTATION: AN APPLICATION TO THE TRAFFIC ASSIGNMENT PROBLEM , 1989 .

[18]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[19]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

[20]  M..  Projected Newton Methods and Optimization of Multicommodity Flows , 2022 .

[21]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[23]  Siriphong Lawphongpanich,et al.  Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints , 2000, Oper. Res. Lett..

[24]  Ángel Marín,et al.  Restricted simplicial decomposition with side constraints , 1995, Networks.

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

[26]  Niels O Jorgensen,et al.  Some aspects of the urban traffic assignment problem , 1963 .