Application of cross-nested logit route choice model in stochastic user equilibrium traffic assignment

Transportation Research Record

Volumn , Issue 2003, 2007, Pages 41-49

  Bekhor, Shlomo ^a   Reznikova, Lena ^a   Toledo, Tomer ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PARAMETER ESTIMATION; PROBLEM SOLVING; STOCHASTIC MODELS;

CROSS-NESTED LOGIT (CNL); NESTING COEFFICIENTS; PATH-BASED ALGORITHMS; STOCHASTIC USER EQUILIBRIUM (SUE) MODELS;

TRANSPORTATION ROUTES;

EID: 38849197889     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2003-06     Document Type: Article

References (28)

1. Daganzo, C. F., and Y. Sheffi. On Stochastic Models of Traffic Assignment. Transportation Science, Vol. 11, 1977, pp. 253-274.
2. Maher, M. Algorithms for Logit-based Stochastic User Equilibrium Assignment. Transportation Research B, Vol. 32, 1998, pp. 539-549.
3. Dial, R. B. Equilibrium Logit Traffic Assignment: Elementary Theory and Algorithm. Presented at 80th Annual Meeting of the Transportation Research Board, Washington, D.C., 2001.
4. Sheffi, Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs, N.J., 1985.
5. Patriksson, M. The Traffic Assignment Problem: Models and Methods. VSP BV, Utrecht, Netherlands, 1994.
6. Bell, M. G. H., and Y. Iida. Transportation Network Analysis. John Wiley and Sons, Chichester, West Sussex, United Kingdom, 1997.
7. Cascetta, E., A. Nuzzolo, F. Russo, and A. Vitetta. A Modified Logit Route Choice Mode! Overcoming Path Overlapping Problems: Specification and Some Calibration Results for Interurban Networks. In Proc., 13th International Symposium on Transportation and Traffic Theory, Pergamon, Lyon, France, 1996, pp. 697-711.
8. Ben-Akiva, M., and M. Bierlaire. Discrete Choice Methods and their Applications to Short Term Travel Decisions. In Handbook of Transportation Science (R. W. Hall, ed.), Kluwer, Dordrecht, Netherlands, 1999, pp. 5-12.
9. Ramming, S. Network Knowledge and Route Choice. PhD thesis. Massachusetts Institute of Technology, Cambridge, 2001.
10. Prashker, J. N., and S. Bekhor. Investigation of Stochastic Network Loading Procedures. In Transportation Research Record 1645, TRB, National Research Council, Washington, D.C., 1998, pp. 94-102.
11. Gliebe, J. P., F. S. Koppelman, and A. Ziliaskopoulos. Route Choice Using Paired Combinatorial Logit Model. Presented at 78th Annual Meeting of the Transportation Research Board, Washington, D.C., 1999.
12. Vovsha, P., and S. Bekhor. Link-Nested Logit Model of Route Choice: Overcoming the Route Overlapping Problem. In Transportation Research Record 1645, TRB, National Research Council, Washington, D.C., 1998, pp. 133-142.
13. Bekhor, S., M. E. Ben-Akiva, and M. S. Ramming. Adaptation of Logit Kernel to Route Choice Situation. In Transportation Research Record: Journal of the Transportation Research Board, No. 1805, Transportation Research Board of the National Academies, Washington, D.C., 2002, pp. 78-85.
14. Bekhor, S., and J. N. Prashker. Formulations of Extended Logit Stochastic User Equilibrium Assignments. In Proc., 14th International Symposium on Transportation and Traffic Theory, Jerusalem, 1999, pp. 351-372.
15. Damberg, O., J. T. Lundgren, and M. Patriksson. An Algorithm for the Stochastic User Equilibrium Problem. Transportation Research B, Vol. 30, 1996, pp. 115-131.
16. Fisk, C. Some Developments in Equilibrium Traffic Assignment. Transportation Research B, Vol. 14, 1980, pp. 243-255.
17. Bekhor, S., and J. N. Prashker. Stochastic User Equilibrium Formulation for Generalized Nested Logit Model. In Transportation Research Record: Journal of the Transportation Research Board, No. 1752, TRB, National Research Council, Washington, D.C., 2001, pp. 84-90.
18. Sheffi, Y., and W. B. Powell. An Algorithm for the Equilibrium Assignment Problem with Random Link Times. Networks, Vol. 12, 1982, pp. 191-207.
19. Chen, A., P. Kasikitwiwat, and Z. Ji. Solving the Overlapping Problem in Route Choice with Paired Combinatorial Logit Model. In Transportation Research Record: Journal of the Transportation Research Board, No. 1857, Transportation Research Board of the National Academies, Washington, D.C., 2003, pp. 65-73.
20. Larsson, T., and M. Patriksson. Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem. Transportation Science, Vol. 26, 1992, pp. 4-17.
21. Armijo, L. Minimization of Functions Having Lipschitz Continuous First Derivatives. Pacific Journal of Mathematics, Vol. 16, 1966, pp. 1-3.
22. Leblanc, L. J. Mathematical Programming Algorithms for Large-Scale Network Equilibrium and Network Design Problems. PhD thesis. IE/MS Department, Northwestern University, Evanston, Ill., 1973.
23. Emme/2 User's Manual: Release 9.2. INRO Consultants, Montreal, Quebec, Canada, 1999.
24. Azevedo, J. A., M. E. O. Santos Costa, J. J. E. R. Silvestre Madera, and E. Q. Vieira Martins. An Algorithm for the Ranking of Shortest Paths. European Journal of Operational Research, Vol. 69, 1993, pp. 97-106.
25. de la Barra, T., B. Perez, and J. Anez. Multidimensional Path Search and Assignment. In Proc., 21st PTRC Summer Annual Meeting, Manchester, United Kingdom, 1993, pp. 307-319.
26. Bar Gera, H. Transportation Network Test Problems. http://www.bgu.ac.il/-bargera/tntp/.
27. Prashker, J. N., and S. Bekhor. Congestion, Stochastic, and Similarity Effects in Stochastic User-Equilibrium Models. In Transportation Research Record: Journal of the Transportation Research Board, No. 1733, TRB, National Research Council, Washington, D.C., 2000, pp. 80-87.
28. Bekhor, S., T. Toledo, and J. N. Prashker. Implementation Issues of Route Choice Models in Path-Based Algorithms. Presented at 11th International Conference on Travel Behaviour Research, Kyoto, Japan, Aug. 16-20, 2006.