A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks

References

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