A strategic flow model of traffic assignment in static capacitated networks

Operations Research

Volumn 52, Issue 2, 2004, Pages

  Marcotte, Patrice ^a   Nguyen, Sang ^a   Schoeb, Alexandre ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Capacities; Equilibrium; Hyperpath; Traffic assignment; Variational inequalities

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBLEM SOLVING; STRATEGIC PLANNING; TRANSPORTATION ROUTES;

HYPERPATH; TRAFFIC ASSIGNMENT; TRANSPORTATION NETWORKS; VARIATIONAL INEQUALITIES;

TRAFFIC CONTROL;

EID: 19744370704     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1030.0091     Document Type: Article

References (19)

1. Astarita, Vittorio. 1996. A continuous time link model for dynamic network loading based on travel time function. J. B. Lesort, ed. Proc. 13th Internat. Sympos. Transportation Traffic Theory. Pergamon-Elsevier, Tarrytown, New York, 79-102.
2. Braess, D. 1968. Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12 258-268.
3. Daganzo, Carlos F. 1998. Queue spillovers in transportation networks with a route choice. Transportation Sci. 32 3-11.
4. Dial, R. B. 1971. A probabilistic multiparth traffic assignment model which obviates path enumeration. Transportation Res. 5 83-111.
5. Frank, M., P. Wolfe. 1956. An algorithm for quadratic programming. Naval Res. Logist. Quart. 3 95-110.
6. Hearn, D. W. 1980. Bounding flows in traffic assignment models. Research report 80-4, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
7. Konnov, I. 1993. Combined relaxation methods for finding equilibrium points and solving related problems. Mathematika 37 44-51.
8. Korpelevich, G. M. 1977. The extragradient method for finding saddle points and other problems. Matekon 13 35-49.
9. Larsson, T., M. Patriksson. 1998. Side constrained traffic equilibrium models-Traffic management through link tolls. P. Marcotte, S. Nguyen, eds. Equilibrium and Advanced Transportation Modelling. Kluwer Academic Publishers, Boston, MA, 125-151.
10. Lawphongpanich, S., D. W. Hearn. 1984. Simplicial decomposition of the asymmetric traffic assignment problem. Transportation Res. 18B 123-133.
11. Marcotte, P., S. Nguyen. 1998. Hyperpath formulations of traffic assignment problems. P. Marcotte, S. Nguyen, eds. Equilibrium and Advanced Transportation Modelling. Kluwer Academic Publishers, Boston, MA, 175-199.
12. Miller-Hooks, E. 2001. Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 37 35-52.
13. Nguyen, S., S. Pallottino. 1988. Equilibrium traffic assignment for large scale transit network. Eur. J. Oper. Res. 37 176-186.
14. Nguyen, S., S. Pallottino. 1989. Hyperpaths and shortest hyperpaths. (Berlin) B. Simeone, ed. Combinatorial Optimization. Lecture Notes in Mathematics, Vol. 1403. Springer-Verlag, 258-271.
15. Patriksson, M. 1994. The Traffic Assignment Problem-Models and Methods. Utrecht, VSP, BV, The Netherlands.
16. Schoeb, A. 1999. Une étude théorique et algorithmique d'un modèle d'affectation de trafic avec capacités rigides. Master's thesis, Département d'informatique et de recherche opérationnelle, Université de Montréal, Montreal, Quebec, Canada.
17. Spiess, H., M. Florian. 1989. Optimal strategies: A new assignment model for transit networks. Transportation Res. B 23 83-102.
18. Suwansirikul, C., T. L. Friesz, R. L. Tobin. 1987. Equilibrium decomposition optimization: A heuristic for the continuous equilibrium network design problem. Transportation Sci. 21 254-263.
19. Wardrop, J. G. 1952. Some theoretical aspects of road traffic research. Proc. Inst. Civil Engr., Part 2. 325-378.