Stochastic User Equilibrium with Equilibrated Choice Sets: Part I – Model Formulations under Alternative Distributions and Restrictions.

The aim of this paper is to remove the known limitations of Deterministic and Stochastic User Equilibrium (DUE and SUE), namely that only routes with the minimum cost are used in DUE, and that all permitted routes are used in SUE regardless of their costs. We achieve this by combining the advantages of the two principles, namely the definition of unused routes in DUE and of mis-perception in SUE, such that the resulting choice sets of used routes are equilibrated. Two model families are formulated to address this issue: the first is a general version of SUE permitting bounded and discrete error distributions; the second is a Restricted SUE model with an additional constraint that must be satisfied for unused paths. The overall advantage of these model families consists in their ability to combine the unused routes with the use of random utility models for used routes, without the need to pre-specify the choice set. We present model specifications within these families, show illustrative examples, evaluate their relative merits, and identify key directions for further research.

[1]  F. Leurent.  Curbing the computational difficulty of the logit equilibrium assignment model , 1997 .

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

[3]  Andrea Papola,et al.  Random utility models with implicit availability/perception of choice alternatives for the simulation of travel demand , 2001 .

[4]  Otto Anker Nielsen,et al.  Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family , 2015 .

[5]  Enrique Castillo,et al.  Closed form expressions for choice probabilities in the Weibull case , 2008 .

[6]  O. A. Nielsen,et al.  Stochastic User Equilibrium with equilibrated choice sets , 2015 .

[7]  Lars Lundqvist,et al.  National Transport Models : Recent Developments and Prospects , 2002 .

[8]  Otto Anker Nielsen,et al.  Report on Scenario, Traffic Forecast and Analysis of Traffic on the TEN-T, taking into Consideration the External Dimension of the Union: trans-Tools Version 2; Model and Data Improvements , 2009 .

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

[10]  Carlos F. Daganzo,et al.  Multinomial Probit: The Theory and its Application to Demand Forecasting. , 1980 .

[11]  Y. Nie,et al.  Update Strategies for Restricted Master Problems for User Equilibrium Traffic Assignment Problem , 2012 .

[12]  Takamasa Iryo,et al.  Multiple equilibria in a dynamic traffic network , 2011 .

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

[14]  Michael Patriksson,et al.  An algorithm for the stochastic user equilibrium problem , 1996 .

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

[16]  Y Iida,et al.  Transportation Network Analysis , 1997 .

[17]  Carlos F. Daganzo,et al.  On Stochastic Models of Traffic Assignment , 1977 .

[18]  Anthony Chen,et al.  Unconstrained weibit stochastic user equilibrium model with extensions , 2014 .

[19]  Hillel Bar-Gera,et al.  User-equilibrium route flows and the condition of proportionality , 2012 .

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

[21]  Anthony Chen,et al.  Computational study of state-of-the-art path-based traffic assignment algorithms , 2002, Math. Comput. Simul..

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

[23]  D. Watling.  Asymmetric problems and stochastic process models of traffic assignment , 1996 .

[24]  Shlomo Bekhor,et al.  Path-Based Algorithms to Solve C-Logit Stochastic User Equilibrium Assignment Problem , 2012 .

[25]  Markus Friedrich,et al.  Timetable-Based Transit Assignment Using Branch and Bound Techniques , 2001 .

[26]  Malachy Carey,et al.  Comparison of Methods for Path Flow Reassignment for Dynamic User Equilibrium , 2011, Networks and Spatial Economics.

[27]  Yang Wen,et al.  A dynamic traffic assignment model for highly congested urban networks , 2012 .

[28]  Shlomo Bekhor,et al.  Applying Branch-and-Bound Technique to Route Choice Set Generation , 2006 .

[29]  M. Bierlaire,et al.  Sampling of Alternatives for Route Choice Modeling , 2009 .

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

[31]  Michael G.H. Bell,et al.  A STOCHASTIC USER EQUILIBRIUM PATH FLOW ESTIMATOR , 1997 .

[32]  M. Ben-Akiva,et al.  MODELLING INTER URBAN ROUTE CHOICE BEHAVIOUR , 1984 .

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

[34]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[35]  Keechoo Choi,et al.  Computation and application of the paired combinatorial logit stochastic user equilibrium problem , 2014, Comput. Oper. Res..

[36]  M. Ehrgott,et al.  Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model , 2013 .

[37]  Piet H. L. Bovy,et al.  On Modelling Route Choice Sets in Transportation Networks: A Synthesis , 2009 .

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

[39]  S. Waller,et al.  Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures , 2012 .

[40]  S. Nakayama.  q-Generalized Logit Route Choice an Network Equilibrium Model , 2013 .

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

[42]  Pitu B. Mirchandani,et al.  Shortest distance and reliability of probabilistic networks , 1976, Comput. Oper. Res..