EFFECTS OF CHOICE SET SIZE AND ROUTE CHOICE MODELS ON PATH-BASED TRAFFIC ASSIGNMENT

Few of the recently developed route choice models have actually been applied in traffic assignment problems. This paper discusses the implementation of selected route choice models in stochastic user equilibrium algorithms. The focus of the paper is on path-based assignment, which is essential in the implementation of route choice models. The paper analyzes the effect of choice set size and selected choice models on problem convergence, running time and selected results. The results presented in the paper indicate that for real-size networks, generation of a large number of alternative routes is needed. Furthermore, convergence properties greatly improve if the generated routes are sufficiently disjointed.

[1]  Dongjoo Park,et al.  Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach , 1997 .

[2]  R Dial.  Equilibrium logit traffic assignment: elementary theory and algorithms , 2001 .

[3]  M. Bierlaire,et al.  Discrete Choice Methods and their Applications to Short Term Travel Decisions , 1999 .

[4]  Shlomo Bekhor,et al.  FORMULATIONS OF EXTENDED LOGIT STOCHASTIC USER EQUILIBRIUM ASSIGNMENTS , 1999 .

[5]  T de la Barra,et al.  Multidimensional path search and assignment , 1993 .

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

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

[8]  S. Bekhor,et al.  Stochastic User Equilibrium Formulation for Generalized Nested Logit Model , 2001 .

[9]  Shlomo Bekhor,et al.  Application of Cross-Nested Logit Route Choice Model in Stochastic User Equilibrium Traffic Assignment , 2007 .

[10]  Shlomo Bekhor,et al.  Effects of choice set composition in route choice modeling , 2006 .

[11]  S. Bekhor,et al.  Route Choice Models Used in the Stochastic User Equilibrium Problem: A Review , 2004 .

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

[13]  Zhaowang Ji,et al.  Solving the Overlapping Problem in Route Choice with Paired Combinatorial Logit Model , 2003 .

[14]  Robert B. Dial,et al.  Bicriterion Traffic Equilibrium: T2 Model, Algorithm, and Software Overview , 2000 .

[15]  S. Lanser,et al.  Modelling Travel Behaviour in Multi-modal Networks , 2005 .

[16]  E. Cascetta,et al.  STOCHASTIC USER EQUILIBRIUM ASSIGNMENT WITH EXPLICIT PATH ENUMERATION: COMPARISON OF MODELS AND ALGORITHMS , 1997 .

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

[18]  C. Chu.  A PAIRED COMBINATORIAL LOGIT MODEL FOR TRAVEL DEMAND ANALYSIS , 1989 .

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

[20]  Le Blanc.  MATHEMATICAL PROGRAMMING ALGORITHMS FOR LARGE SCALE NETWORK EQUILIBRIUM AND NETWORK DESIGN PROBLEMS , 1973 .

[21]  Daniel McFadden,et al.  Modelling the Choice of Residential Location , 1977 .

[22]  Hai-Jun Huang,et al.  A study on logit assignment which excludes all cyclic flows , 1998 .

[23]  E. Martins,et al.  An algorithm for the ranking of shortest paths , 1993 .

[24]  Peter Vovsha,et al.  Application of Cross-Nested Logit Model to Mode Choice in Tel Aviv, Israel, Metropolitan Area , 1997 .

[25]  David Bernstein,et al.  FINDING ALTERNATIVES TO THE BEST PATH , 1997 .

[26]  Shlomo Bekhor,et al.  Evaluation of choice set generation algorithms for route choice models , 2006, Ann. Oper. Res..

[27]  Shlomo Bekhor,et al.  Adaptation of Logit Kernel to Route Choice Situation , 2002 .

[28]  S. Bekhor,et al.  Investigating path-based solution algorithms to the stochastic user equilibrium problem , 2005 .

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

[30]  Warrren B Powell,et al.  The Convergence of Equilibrium Algorithms with Predetermined Step Sizes , 1982 .

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

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

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

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

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

[36]  N. J. V. Zijpp,et al.  Path enumeration by finding the constrained K-shortest paths , 2005 .

[37]  S F Catalano,et al.  A FORECASTING MODEL FOR INLAND NAVIGATION BASED ON ROUTE ENUMERATION , 2001 .

[38]  Shlomo Bekhor,et al.  Investigation of Stochastic Network Loading Procedures , 1998 .

[39]  Anthony Chen,et al.  ADAPTATION OF THE PAIRED COMBINATORIAL LOGIT MODEL TO THE ROUTE CHOICE PROBLEM , 2005 .

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

[41]  Hai-Jun Huang.  A Combined Algorithm for Solving and Calibrating the Stochastic Traffic Assignment Model , 1995 .

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

[43]  E. Cascetta,et al.  A MODIFIED LOGIT ROUTE CHOICE MODEL OVERCOMING PATH OVERLAPPING PROBLEMS. SPECIFICATION AND SOME CALIBRATION RESULTS FOR INTERURBAN NETWORKS , 1996 .

[44]  David E. Boyce,et al.  User-Equilibrium Route Set Analysis of a Large Road Network , 2005 .

[45]  Seiji Iwakura,et al.  Multinomial probit with structured covariance for route choice behavior , 1997 .

[46]  Michael Scott Ramming,et al.  NETWORK KNOWLEDGE AND ROUTE CHOICE , 2002 .

[47]  Piet H. L. Bovy,et al.  STOCHASTIC ROUTE CHOICE SET GENERATION: BEHAVIORAL AND PROBABILISTIC FOUNDATIONS , 2007 .

[48]  F. Koppelman,et al.  The generalized nested logit model , 2001 .