Capacitated transit assignment with loading priorities

Mathematical Programming

Volumn 101, Issue 1, 2004, Pages 205-230

  Hamdouch, Younes ^a   Marcotte, Patrice ^a   Nguyen, Sang ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Capacities; Equilibrium assignment; Hyperpath; Priorities; Strategy; Transit networks; Variational inequalities

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES; RIGIDITY; VEHICLES;

CAPACITIES; EQUILIBRIUM ASSIGNMENT; HYPERPATH; STRATEGY; TRANSIT NETWORKS; VARIATIONAL INEQUALITIES;

MATHEMATICAL PROGRAMMING;

EID: 23944518238     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0542-7     Document Type: Conference Paper

References (28)

1. Aubin, J.P.: Optima and equilibria: An introduction to nonlinear analysis. Springer-Verlag, 1993
2. Border, K.: Fixed point theorems with applications to economics and game theory. Cambridge University Press, Cambridge, 1985
3. Cepeda, M.: Modèle d'équilibre dans les réseaux de transport en commun: le cas des capacités explicites des services. Ph.D dissertation, Département d'informatique et de recherche opérationnelle, Université de Montréal, 2002
4. Chriqui, C., Robillard, P.: Commun bus lines, Transportation Sci. 9, 115-121 (1975)
5. Cominetti, R., Correa, J.: Common-lines and passenger assignment in congested transit networks. Transportation Sci 35, 250-267 (2001)
6. De Cea, J., Fernández, J.E.: Transit assignment to minimal routes: an efficient new algorithm. Traffic Eng. Contr 30, 491-494 (1989)
7. De Cea, J., Fernández, J.E.: Transit assignment for congested public transport systems: an equilibrium model. Transportation Sci 27, 133-147 (1993)
8. Dial, R.B.: Transit pathfinder algorithm. Highway Res. Record 205, 67-85 (1967)
9. Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logistic Q. 3, 95-110 (1956)
10. Gendreau, M.: Une étude approfondie d'un modèle d'équilibre pour l'affectation des passagers dans les réseaux de transport en commun. Ph.D dissertation, Département d'informatique et de recherche opérationnelle, Université de Montréal, 1984
11. Hamdouch, Y.: Affectation statique et dynamique des usagers dans un réseau de transport avec capacités rigides. Ph.D dissertation, Département d'informatique et de recherche opérationnelle, Université de Montréal, 2002
12. Hearn, D.W.: Bounding flows in traffic assignment models. Research report 80-4, Department of Industrial and Systems Engineering, University of Florida, Gainesville, 1980
13. Konnov, I.: Combined relaxation methods for finding equilibrium points and solving related problems. Mathematika 37, 44-51 (1993)
14. Korpelevitch, G.M.: The extragradient method for finding saddle points and other problems. Matekon 13, 35-49 (1977)
15. Le Clercq, F.: A public transport assignment method. Traffic Eng. Contr. 14, 91-96 (1972)
16. Lawphongpanich, S., Hearn, D.W.: Simplicial decomposition of the asymmetric traffic assignment problem. Transportation Res. 18B, 123-133 (1984)
17. Marcotte, P., Nguyen, S.: Hyperpath formulations of traffic assignment problems. In: Equilibrium and Advanced Transportation Modelling. P. Marcotte, S. Nguyen (eds.), Kluwer Academic Publisher, 1998, pp. 175-199
18. Marcotte, P., Nguyen, S., Schoeb, A.: A strategic flow model of traffic assignment in capacitated networks. Forthcoming in Operations Research, 2000
19. Nguyen, S., Pallottino, S.: Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. 37, 176-186 (1988)
20. Nguyen, S., Pallottino, S.: Hyperpaths and shortest hyperpaths. In: B. Simeone (ed.), Combinatorial Optimization, volume 1403 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1989, pp. 258-271
21. Nguyen, S., Pallottino, S., Malucelli, P.: A modeling framework for the passenger assignment on a transport network with time-tables. Transportation Sci. 55, 238-249 (2001)
22. Patriksson, M.: The Traffic Assignment Problem-Models and Methods. Topics in Transportation, VSP BV, The Netherlands, 1994
23. Sheffi, U.: Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice Hall, New Haven, Connecticut, 1985
24. Spiess, M.: On optimal route choice strategies in transit networks. Publication 286, Centre de recherche sur les transports, Université de Montréal, 1983
25. Spiess, H., Florian, M.: Optimal strategies: a new assignment model for transit networks. Transportation Res. B 23, 83-102 (1989)
26. Suwansirikul, C., Friesz, T.L., Tobin, R.L.: Equilibrium decomposition optimization: a heuristic for the continuous equilibrium network design problem. Transportation Sei 21, 254-263 (1987)
27. Wu, J.H., Florian, M., Marcotte, P.: Transit equilibrium assignment: a model and solutions algorithms. Transportation Sci 28, 193-203 (1994)
28. Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Institution of Civil Engineers, Part 11, 325-378 (1952)