Evacuation Route Choice Based on C-logit Model: Survey Analysis Utilizing a Two-route Scenario

2015 ◽  
Vol 12 (4) ◽  
pp. 1629-1638
Author(s):  
Zhengfeng Huang
Keyword(s):  
Logit Model ◽  
Route Choice ◽  
Survey Analysis ◽  
Evacuation Route

Solving the Overlapping Problem in Route Choice with Paired Combinatorial Logit Model

2003 ◽  
Vol 1857 (1) ◽  
pp. 65-73 ◽  
Author(s):  
Anthony Chen ◽  
Panatda Kasikitwiwat ◽  
Zhaowang Ji
Keyword(s):  
Mathematical Programming ◽  
Logit Model ◽  
Choice Model ◽  
Route Choice ◽  
Similarity Index ◽  
User Equilibrium ◽  
Transportation Systems ◽  
Programming Formulation ◽  
Stochastic User Equilibrium ◽  
Mathematical Programming Formulation

Recently, there has been renewed interest in improving the logit-based route choice model because of the importance of the route choice model in intelligent transportation systems applications, particularly the applications of advanced traveler information systems. The paired combinatorial logit (PCL) model and its equivalent mathematical programming formulation for the route choice problem have been studied. An algorithm based on the partial linearization method is presented for solving the PCL stochastic user equilibrium problem. Detailed examples are provided to explain how this hierarchical logit model resolves the overlapping problem through the similarity index while still accounting for both congestion and stochastic effects in the mathematical programming formulation.

scholarly journals A nested recursive logit model for route choice analysis

2015 ◽  
Vol 75 ◽  
pp. 100-112 ◽  
Author(s):  
Tien Mai ◽  
Mogens Fosgerau ◽  
Emma Frejinger
Keyword(s):  
Logit Model ◽  
Route Choice ◽  
Choice Analysis

Investigation of Stochastic Network Loading Procedures

1998 ◽  
Vol 1645 (1) ◽  
pp. 94-102 ◽  
Author(s):  
J. N. Prashker ◽  
S. Bekhor
Keyword(s):  
Logit Model ◽  
Route Choice ◽  
Multinomial Logit Model ◽  
Multinomial Logit ◽  
Nested Logit ◽  
Stochastic Network ◽  
Nested Logit Model ◽  
Network Loading ◽  
Stochastic Loading ◽  
The Cross

The network loading process of stochastic traffic assignment is investigated. A central issue in the assignment problem is the behavioral assumption governing route choice, which concerns the definition of available routes and the choice model. These two problems are addressed and reviewed. Although the multinomial logit model can be implemented efficiently in stochastic network loading algorithms, the model suffers from theoretical drawbacks, some of them arising from the independence of irrelevant alternatives property. As a result, the stochastic loading on routes that share common links is overloaded at the overlapping parts of the routes. Other logit-family models recently have been proposed to overcome some of the theoretical problems while maintaining the convenient analytical structure. Three such models are investigated: the C-logit model, which was specifically defined for route choice; and two general discrete-choice models, the cross-nested logit model and the paired combinatorial logit model. The two latter models are adapted to route choice, and simple network examples are presented to illustrate the performance of the models with respect to the overlapping problem. The results indicate that all three models perform better than does the multinomial logit model. The cross-nested logit model has an advantage over the two other generalized models because it enables performing stochastic loading without route enumeration. The integration of this model with the stochastic equilibrium problem is discussed, and a specific algorithm using the cross-nest logit model is presented for the stochastic loading phase.

Sign in / Sign up

Export Citation Format

Share Document