Origin-Based Algorithm for the Traffic Assignment Problem

References

• Bar-Gera H. Origin-based algorithms for transportation net-work modeling. (1999) . Ph.D. thesis, Civil Engineering, University of Illinois at Chicago, Chicago, ILGoogle Scholar
• Bar-Gera H., Boyce D., Ceder A. Route flow entropy maximization in origin-based traffic assignment. Transportation and Traffic Theory, Proceedings of the 14th International Symposium on Transportation and Traffic Theory, Jerusalem, Israel, 1999 (1999) (Elsevier Science, Oxford, U.K) 397–415Google Scholar
• Beckmann M., McGuire C. B., Winston C. B.Studies in the Economics of Transportation (1956) (Yale University Press, New Haven, CT) Google Scholar
• Bertsekas D. P., Bensoussan A., Lions J. L. Algorithms for nonlinear multicommodity networkflow problems. Proceedings of the International Symposium on Systems Optimization and Analysis (1979) (Springer-Verlag, Berlin, Germany) 210–224Google Scholar
• Bertsekas D. P. Network Optimization—Continuous and Discrete Models. (1999) (Athena Scientific, Belmont, MA) Google Scholar
• Bertsekas D. P., Gafni E. M., Gallager R. G. Second derivative algorithms for minimum delay distributed routing in networks. IEEE Trans. Comm. (1984) COM-32:911–919Crossref, Google Scholar
• Bertsekas D. P., Gafni E. M., Vastola K. S. Validation of algorithms for optimal routing of flow in networks. Proc. 1979 IEEE Conf. Decision and Control (1979) (San Diego, CA)220–227Google Scholar
• Bothner P., Lutter W.Ein Direktes Verfahren Zur Verkehrsum-legung nach dem 1. Prinzip von Wardrop (1982) (Forschungsbere-ich: Verkehrssysteme Arbeitsbericht 1, Universität Bremen, Bremen, Germany) Google Scholar
• Bruynooghe M., Gibert A., Sakarovitch M., Leutzbach W., Baron P. Une méthode d'affectation du traffic. Proceedings of the 4th International Symposium on the Theory of Road Traffic Flow, Karlsruhe, 1968 (1969) 198–204Beiträge zur Theorie des Ver-kehrsflusses, Strassenbau und Strassenverkehrstechnik, Heft 86, Herausgegeben von Bundesminister für Verkehr, Abteilung Strassenbau, Bonn, GermanyGoogle Scholar
• Dafermos S. C. Traffic assignment and resource allocation in transportation networks. (1968) . Ph.D. thesis, Operations Research, Johns Hopkins University, Baltimore, MDGoogle Scholar
• Dafermos S. C., Sparrow F. T. The traffic assignment problem for a general network. J. Res. National Bureau of Standards (1969) 73B:91–118Crossref, Google Scholar
• Dial R. B. A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Res (1971) 5:83–111Crossref, Google Scholar
• Florian M., Hearn D., Ball M. O., et al. Networkequilibrium models and algorithms. Network Routing, Handbooks in OR & MS (1995) 8(Elsevier Science, Oxford, U.K) 485–549Crossref, Google Scholar
• Florian M., Spiess H. Transport networks in practice. Proc. Conf. Oper. Res. Soc. Italy (1983) Napoli, Italy:29–52Google Scholar
• Frank M., Wolfe P. An algorithm for quadratic programming. Naval Res. Logist. Quart. (1956) 3:95–110Crossref, Google Scholar
• Fukushima M. A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Transportation Res (1984) 18B:169–177Crossref, Google Scholar
• Gallager R. G. A minimum delay routing algorithm using distributed computation. IEEE Trans. Comm. (1977a) COM-25:73–85Crossref, Google Scholar
• Gallager R. G. Loops in multicommodity flows. Proceedings of the 10th IEEE Conf. Decision and Control (1977b) New Orleans, TX:819–825Crossref, Google Scholar
• Gibert A. A method for the traffic assignment problem. (1968) . Report LBS-TNT-95. Transportation Network Theory Unit, London Business School, London, U.KGoogle Scholar
• Hagstrom J. N., Tseng P. Traffic equilibrium: Linkflows, path flows and weakly/strongly acyclic solutions. (1998) . Working paper, Department of Information and Decision Sciences, University of Illinois at Chicago, Chicago, ILGoogle Scholar
• Hearn D. W., Lawphongpanich S., Venture J. A. Restricted simplicial decomposition: Computation and extensions. Math. Programming Study (1987) 31:99–118Crossref, Google Scholar
• Jayakrishnan R., Tsai W. K., Prashker J. N., Rajadhyaksha S. A faster path-based algorithm for traffic assignment. Transportation Res. Record (1994) 1443:75–83Google Scholar
• Kupiszewska D., Van Vliet D. 101 uses for path-based assignment. Transportation Planning Methods: Proceedings of Seminar C held at the PTRC Transport and Planning Summer Annual Meeting (1999) University of Sussex, U.K.(no. 434Google Scholar
• Larsson T., Patriksson M. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Sci. (1992) 26:4–17Link, Google Scholar
• Larsson T., Patriksson M., Rydergren C. Application of simplicial decomposition with nonlinear column generation to nonlinear networkflows. Licentiate Thesis (1998) (Linköping Institute of Technology, Linköping, Sweden) . Clas Rydergren, Thesis No. 702Google Scholar
• LeBlanc L. J., Helgason R. V., Boyce D. E. Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transportation Sci (1985) 19:445–462Link, Google Scholar
• LeBlanc L. J., Morlok E. K., Pierskalla W. P. An efficient approach to solving the road networkequilibrium traffic assignment problem. Transportation Res (1975) 9:309–318Crossref, Google Scholar
• Lupi M. Convergence of the Frank-Wolfe algorithm for solving the traffic assignment problem. Civil Engr. Systems (1986) 3:7–15Crossref, Google Scholar
• Pallottino S., Scutella M. G., Marcotte P., Nguyen S. Shortest path algorithms in transportation models: Classical and innovative aspects. Equilibrium and Advanced Transportation Modelling (1998) (Kluwer Academic Publishers, Boston, MA) 245–281Crossref, Google Scholar
• Pape U. Implementation and efficiency of Moore-algorithms for the shortest route problem. Math. Programming (1974) 7:212–222Crossref, Google Scholar
• Patriksson M.The Traffic Assignment Problem—Models and Methods (1994) (VSP, Utrecht, Netherlands) Google Scholar
• Wardrop J.G. Some theoretical aspects of road traffic research. Proc. Institution of Civil Engineers, Part II (1952) 1:325–378Crossref, Google Scholar