Primal Method for Determining the Most Likely Route Flows in Large Road Networks

References

• Bar-Gera H. Transportation network test problems. (2001) . www.bgu.ac.il/∼bargera/tntpGoogle Scholar
• Bar-Gera H. Origin-based algorithm for the traffic assignment problem. Transportation Sci. (2002) 36(4):398–417Link, Google Scholar
• Bar-Gera H., Boyce D., Ceder A. Route flow entropy maximization in origin-based traffic assignment. Transportation and Traffic Theory. Proc. 14th Internat. Sympos. Transportation Traffic Theory (1999) (Elsevier Science, Oxford, UK) 397–415Google Scholar
• Bar-Gera H., Boyce D., Mahmassani H. S. User-equilibrium route set analysis of a large road network. Transportation and Traffic Theory. Proc. 16th Internat. Sympos. Transportation Traffic Theory (2005) (Elsevier Science, Oxford, UK) 673–692Crossref, Google Scholar
• Beckmann M., McGuire C. B., Winston C. B.Studies in the Economics of Transportation (1956) (Yale University Press, New Haven, CT) Google Scholar
• Bell M. G. H., Iida Y.Transportation Network Analysis (1997) (Wiley, New York) Crossref, Google Scholar
• Boyce D., Xiong Q. User-optimal and system-optimal route choices for a large road network. Rev. Network Econom. (2004) 3:371–380Google Scholar
• Gallager R. G. Loops in multicommodity flows. Proc. 10th IEEE Conf. Decision Control (1977) New Orleans, LA:819–825Crossref, Google Scholar
• Harris B. Multiple paths through a network. 42nd Congress Eur. Regional Sci. Assoc. (2002) (Dortmund, Germany)Google Scholar
• Hearn D. W., Florian M. Practical and theoretical aspects of aggregation problems in transportation planning models. Transportation Planning Models (1984) (North-Holland, Amsterdam, The Netherlands) 257–287Google Scholar
• Janson B. N. Most likely origin-destination link uses from equilibrium assignment. Transportation Res. B (1993) 27:333–350Crossref, Google Scholar
• Larsson T., Lundgren J., Patriksson M., Rydergren C. Most likely traffic equilibrium route flows—Analysis and computation. (1998) . Optimization methods for analysis of transportation networks. Thesis No. 702, Linkopings Universitet, SwedenGoogle Scholar
• Oppenheim N.Urban Travel Demand Modeling (1995) (Wiley, Chichester, UK) Google Scholar
• Paige C. C., Saunders M. A. LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Software (1982a) 8(1):43–71Crossref, Google Scholar
• Paige C. C., Saunders M. A. Algorithm 583. LSQR: Sparse linear equations and least squares problems. ACM Trans. Math. Software (1982b) 8(2):195–209Crossref, Google Scholar
• Patriksson M.The Traffic Assignment Problem (1994) (VSP, Utrecht, The Netherlands) Google Scholar
• Rossi T. F., McNeil S., Hendrickson C. Entropy model for consistent impact fee assessment. J. Urban Planning Development/ASCE (1989) 115:51–63Crossref, Google Scholar
• Saunders M. A. Solution of sparse rectangular systems using LSQR and CRAIG. BIT (1995) 35:588–604Crossref, Google Scholar
• Xiong Q. Comparison of user-optimal and system-optimal traffic assignments for the Chicago regional road network. (2002) . M.Sc. thesis, Civil Engineering, University of Illinois at Chicago, Chicago, ILGoogle Scholar