Algorithm for equilibrium transit assignment problem

Transportation Research Record

Volumn , Issue 1923, 2005, Pages 227-235

  Babazadeh, Abbas ^a   Aashtiani, Hedayat Z ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HIGHWAY TRAFFIC CONTROL; LINEARIZATION; MOTOR TRANSPORTATION; OPTIMIZATION;

COMPLEMENTARITY FORMULATION; PATH FLOWS; TRANSIT ASSIGNMENT; TRANSIT NETWORKS;

PROBLEM SOLVING;

EID: 33645676539     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1923-24     Document Type: Conference Paper

References (17)

1. Spiess, H. On Optimal Route Choice Strategies in Transit Networks. Publication 286. Centre de Recherche sur Transports, University of Montreal, Quebec, Canada, 1983.
2. Spiess, H., and M. Florian. Optimal Strategies: A New Assignment Model for Transit Networks. Transportation Research Part B, Vol. 23, 1989, pp. 83-102.
3. Nguyen, S., and S. Pallottino. Equilibrium Traffic Assignment for Large Scale Transit Networks. European Journal of Operational Research, Vol. 37, No. 2, 1988, pp. 176-186.
4. Wu, J. H., M. Florian, and P. Marcotte. Transit Equilibrium Assignment: A Model and Solution Algorithms. Transportation Science, Vol. 28, No. 3, 1994, pp. 193-203.
5. Bouzaïene-Ayari, B., M. Gendreau, and S. Nguyen. An Equilibrium Fixed-Point Model for Passenger Assignment in Congested Transit Net works. Publication CRT-95-57. Centre de Recherche sur Transports, University of Montreal, Quebec, Canada, 1995.
6. Cominetti, R., and J. Correa. Common-Line and Passenger Assignment in Congested Transit Networks. Transportation Science, Vol. 35, No. 3, 2001, pp. 250-267.
7. Babazadeh, A. Equilibrium Transit Assignment Problem in Congested Networks: Formulation and Solution Algorithm. Ph.D. dissertation. Sharif University of Technology, Tehran, Iran, 2005.
8. Wardrop, J. G. Some Theoretical Aspects of Road Traffic Research. Proceedings of the Institute of Civil Engineers, Vol. 1, No. 2, 1952, pp. 325-378.
9. EMME/2 User's Manual. Software Release 9. INRO, Montreal, Quebec, Canada, 1999.
10. Kojima, M. Computational Methods for the Nonlinear Complementarity Problem. Department of Administration Engineering and Management Science, Keia University, Yokohama, Japan, 1973.
11. Lüti, H. J. A Simplicial Approximation of a Solution for the Nonlinear Complementarity Problem. Mathematical Programming, Vol. 9, 1975, pp. 278-293.
12. Aashtiani, H. Z., and T. L. Magnanti. A Linearization and Decomposition Algorithm for Computing Urban Traffic Equilibria. Proceedings of IEEE Large Scale System Symposium, 1982, pp. 8-18.
13. Cottle, R. W., and G. B. Dantzig. Complementarity Pivot Theory of Mathematical Programming. Linear Algebra and Its Applications, Vol. 1, 1968, pp. 103-125.
14. Eaves, B. C. The Linear Complementarity Problem. Management Science, Vol. 17, 1971, pp. 612-634.
15. Lemke, C. E. Bimatrix Equilibrium Points and Mathematical Programming. Management Science, Vol. 11, 1965, pp. 681-689.
16. Golden, B. Shortest-Path Algorithms: A Comparison. Operations Research, Vol. 24, 1976, pp. 1164-1168.
17. Aashtiani, H. Z., and H. Iravani. Application of Dwell Time Functions in Transit Assignment Model. In Transportation Research Record: Journal of the Transportation Research Board, No. 1817, Transportation Research Board of the National Academies, Washington, D.C., 2002, pp. 88-92.