ADAPTATION OF THE PAIRED COMBINATORIAL LOGIT MODEL TO THE ROUTE CHOICE PROBLEM

The paired combinatorial logit (PCL) model is one of the extended logit models recently developed from the generalized extreme value theory to handle the drawbacks of the multinomial logit (MNL) model. The PCL model is considered suitable for adaptation to the route choice problem to resolve the independence from irrelevant alternatives property inherited in the MNL model while keeping the analytical tractability of the logit choice probability function. In this paper, we adapt the PCL model to handle the two drawbacks of MNL in a route choice context: (1) inability to account for overlapping (or correlation) among routes, and (2) inability to account for perception variance with respect to trips of different lengths. Specifically, the effects of congestion, scaling, and overlapping on the PCL choice probabilities are examined using a set of carefully designed experiments and graphical illustrations. The experimental designs and graphical illustrations allow for intuitive explanation and comparison of the different effects on the calculation of the route choice probabilities.

[1]  P. Bovy,et al.  ROUTE CHOICE: WAYFINDING IN TRANSPORT NETWORKS , 1990 .

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

[3]  Antonino Vitetta,et al.  A model of route perception in urban road networks , 2002 .

[4]  Mike Maher,et al.  ALGORITHMS FOR SOLVING THE PROBIT PATH-BASED STOCHASTIC USER EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM WITH ONE OR MORE USER CLASSES , 2002 .

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

[6]  David E. Boyce,et al.  Comparisons of Deterministic and Stochastic Traffic Loading Models , 1997 .

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

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

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

[10]  Mario Binetti,et al.  STOCHASTIC ASSIGNMENT WITH GAMMIT PATH CHOICE MODELS , 2002 .

[11]  Lionel Needleman,et al.  The economics of housing , 1965 .

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

[13]  D. McFadden,et al.  MIXED MNL MODELS FOR DISCRETE RESPONSE , 2000 .

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

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

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

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

[18]  O A Nielsen.  On the distributions of the stochastic components in SUE traffic assignment models , 1997 .

[19]  Pitu Mirchandani,et al.  Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions , 1987, Transp. Sci..

[20]  Henry X. Liu,et al.  Considering Risk-Taking Behavior in Travel Time Reliability , 2005 .

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

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

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

[24]  Mario Binetti,et al.  Stochastic equilibrium traffic assignment with value-of-time distributed among users , 1998 .

[25]  A. Papola.  Some development on the cross-nested logit model , 2004 .

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

[27]  Y. She.  Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods , 1985 .

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

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

[30]  M G H Bell.  STOCHASTIC USER EQUILIBRIUM ASSIGNMENT AND ITERATIVE BALANCING. , 1993 .

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

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

[33]  Shlomo Bekhor,et al.  Congestion, Stochastic, and Similarity Effects in Stochastic: User-Equilibrium Models , 2000 .

[34]  P H L Bovy,et al.  ROUTE CHOICE. WAYFINDING IN TRANSPORT NETWORKS. STUDIES IN OPERATIONAL REGIONAL SCIENCE , 1990 .

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

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

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

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

[39]  F. Russo,et al.  An assignment model with modified Logit, which obviates enumeration and overlapping problems , 2003 .

[40]  Moshe Ben-Akiva,et al.  Discrete Choice Analysis: Theory and Application to Travel Demand , 1985 .

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

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

[43]  Shlomo Bekhor,et al.  Link-Nested Logit Model of Route Choice: Overcoming Route Overlapping Problem , 1998 .

[44]  F. Koppelman,et al.  The paired combinatorial logit model: properties, estimation and application , 2000 .