System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion

The design of route guidance systems faces a well-known dilemma. The approach that theoretically yields the system-optimal traffic pattern may discriminate against some users in favor of others. Proposed alternate models, however, do not directly address the system perspective and may result in inferior performance. We propose a novel model and corresponding algorithms to resolve this dilemma. We present computational results on real-world instances and compare the new approach with the well-established traffic assignment model. The essence of this study is that system-optimal routing of traffic flow with explicit integration of user constraints leads to a better performance than the user equilibrium, while simultaneously guaranteeing superior fairness compared to the pure system optimum.

[1]  P.A. Hancock,et al.  Path planning and evaluation in IVHS databases , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[2]  A. Ruszczynski,et al.  Robust Path Choice and Vehicle Guidance in Networks With Failures , 1997 .

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

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[6]  Moshe Ben-Akiva,et al.  Dynamic network equilibrium research , 1985 .

[7]  Tim Roughgarden,et al.  Stackelberg scheduling strategies , 2001, STOC '01.

[8]  L. Armijo.  Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

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

[10]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[11]  Chi-Kang Lee,et al.  A multiple-path routing strategy for vehicle route guidance systems , 1994 .

[12]  YuanDi,et al.  A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation , 2003 .

[13]  R. W. Klessig,et al.  An algorithm for nonlinear multicommodity flow problems , 1974, Networks.

[14]  S. Lafortune,et al.  A dynamical system model for traffic assignment in networks , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[15]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[16]  D.E. Kaufman,et al.  An iterative routing/assignment method for anticipatory real-time route guidance , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[17]  Jean-Loup Farges,et al.  Route Guidance, Individual , 1991 .

[18]  Isam Kaysi,et al.  INTEGRATED APPROACH TO VEHICLE ROUTING AND CONGESTION PREDICTION FOR REAL-TIME DRIVER GUIDANCE , 1993 .

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

[20]  Kurt Mehlhorn,et al.  Resource Constrained Shortest Paths , 2000, ESA.

[21]  Tom van Vuren,et al.  MULTIPLE USER CLASS ASSIGNMENT MODEL FOR ROUTE GUIDANCE , 1991 .

[22]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[23]  David Branston,et al.  LINK CAPACITY FUNCTIONS: A REVIEW , 1976 .

[24]  Isam Kaysi,et al.  The Impact of Predictive Information on Guidance Efficiency: An Analytical Approach , 1996 .

[25]  Hani S. Mahmassani,et al.  Network performance under system optimal and user equilibrium dynamic assignments: Implications for , 1993 .

[26]  Tim Roughgarden,et al.  How unfair is optimal routing? , 2002, SODA '02.

[27]  Hani S. Mahmassani,et al.  System Optimal Dynamic Assignment for Electronic Route Guidance in a Congested Traffic Network: Dynamic Flow Modelling and Control , 1995 .

[28]  David Bernstein,et al.  Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing , 1994, Transp. Sci..

[29]  Randolph W. Hall,et al.  ROUTE CHOICE AND ADVANCED TRAVELER INFORMATION SYSTEMS ON A CAPACITATED AND DYNAMIC NETWORK , 1996 .

[30]  Michael C. Ferris,et al.  Robust path choice in networks with failures , 2000 .

[31]  Andreas S. Schulz,et al.  Efficiency and fairness of system-optimal routing with user constraints , 2006 .

[32]  Jon Alan Bottom,et al.  Consistent anticipatory route guidance , 2000 .

[33]  S.E. Underwood,et al.  Research on anticipatory route guidance , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[34]  Y. Aneja,et al.  The constrained shortest path problem , 1978 .

[35]  A. Nagurney.  Network Economics: A Variational Inequality Approach , 1992 .

[36]  Karsten Weihe,et al.  Pareto Shortest Paths is Often Feasible in Practice , 2001, WAE.

[37]  M. S. Bazaraa,et al.  Nonlinear Programming , 1979 .

[38]  A. Bolelli,et al.  Modelling And Assessment Of Dynamic Route Guidance: The Margot Project , 1992, The 3rd International Conference on Vehicle Navigation and Information Systems,.

[39]  Andreas S. Schulz,et al.  On the performance of user equilibria in traffic networks , 2003, SODA '03.

[40]  Markos Papageorgiou,et al.  Dynamic modeling, assignment, and route guidance in traffic networks , 1990 .

[41]  Robert L. Smith,et al.  Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems , 1998, INFORMS J. Comput..

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

[43]  J. N. Hagstrom,et al.  Characterizing Braess's paradox for traffic networks , 2001, ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585).

[44]  Di Yuan,et al.  A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation , 2003, INFORMS J. Comput..

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

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

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

[48]  Victor J. Blue,et al.  Toward the design of intelligent traveler information systems , 1998 .

[49]  José R. Correa,et al.  Sloan School of Management Working Paper 4447-03 November 2003 Computational Complexity , Fairness , and the Price of Anarchy of the Maximum Latency Problem , 2003 .

[50]  M. Patriksson,et al.  Equilibrium characterizations of solutions to side constrained asymmetric traffic assignment models , 1995 .

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

[52]  Isam Kaysi,et al.  FRAMEWORK AND MODELS FOR THE PROVISION OF REAL-TIME DRIVER INFORMATION , 1992 .

[53]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

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

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

[56]  J. Davenport.  Editor , 1960 .

[57]  L.R. Rilett,et al.  Modelling distributed real-time route guidance strategies in a traffic network that exhibits the Braess paradox , 1991, Vehicle Navigation and Information Systems Conference, 1991.

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

[59]  Y. P. Aneja,et al.  Shortest chain subject to side constraints , 1983, Networks.

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

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

[62]  Robert L. Smith,et al.  User-equilibrium properties of fixed points in dynamic traffic assignment 1 1 This research was supp , 1998 .

[63]  Moshe Ben-Akiva,et al.  AN ON-LINE DYNAMIC TRAFFIC PREDICTION MODEL FOR AN INTER-URBAN MOTORWAY NETWORK , 1995 .

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

[65]  E. Martins,et al.  A bicriterion shortest path algorithm , 1982 .

[66]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[67]  Isam Kaysi,et al.  DESIGN ASPECTS OF ADVANCED TRAVELER INFORMATION SYSTEMS , 1995 .

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

[69]  Terry L. Friesz,et al.  TRANSPORTATION NETWORK EQUILIBRIUM, DESIGN AND AGGREGATION: KEY DEVELOPMENTS AND RESEARCH OPPORTUNITIES. IN: THE AUTOMOBILE , 1985 .

[70]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

[71]  D. Hearn,et al.  Solving Congestion Toll Pricing Models , 1998 .

[72]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[73]  Haris N. Koutsopoulos,et al.  DEVELOPMENT OF A ROUTE GUIDANCE GENERATION SYSTEM FOR REAL-TIME APPLICATION , 1997 .

[74]  Moshe Ben-Akiva,et al.  Dynamic network models and driver information systems , 1991 .

[75]  Andreas S. Schulz,et al.  Efficiency and fairness of system‐optimal routing with user constraints , 2006, Networks.

[76]  C. Daganzo.  On the traffic assignment problem with flow dependent costs—II , 1977 .

[77]  Georgetown Pike,et al.  DEVELOPMENT AND TESTING OF DYNAMIC TRAFFIC ASSIGNMENT AND SIMULATION PROCEDURES FOR ATIS/ATMS APPLICATIONS , 1994 .

[78]  Hani S. Mahmassani,et al.  System performance and user response under real-time information in a congested traffic corridor , 1991 .