A Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem

References

• Bar-Gera H. Origin-based algorithms for transportation network modeling. (1999) . Ph.D. thesis, University of Illinois at Chicago, ChicagoGoogle Scholar
• Bar-Gera H. Origin-based algorithm for the traffic assignment problem. Transportation Sci. (2002) 36(4):398–417Link, Google Scholar
• Beckmann M., McGuire C. B., Winsten C. B.Studies in the Economics of Transportation (1956) (Yale University Press, New Haven, CT) Google Scholar
• Bertsekas D. P. On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Automatic Control (1976) AC-21(2):174–184Crossref, Google Scholar
• Bertsekas D. P., Gafni E. M. Projected Newton methods and optimization of multicommondity flows. IEEE Trans. Automatic Control (1983) AC-28(12):1090–1096Crossref, 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) 32(8):911–919Crossref, Google Scholar
• Dafermos S. C. Traffic assignment and resource allocation in transportation networks. (1968) . Ph.D. thesis, Johns Hopkins University, BaltimoreGoogle Scholar
• Dafermos S. C., Sparrow F. T. The traffic assignment problem for a general network. J Res. National Bureau Standards (1969) 73B:91–118Crossref, Google Scholar
• Dial R. B. A probabilistic multipath assignment model that obviates path enumeration. Transportation Res. (1971) 5(2):83–111Crossref, Google Scholar
• Dial R. B. A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transportation Res. Part B (2006) 40(10):917–936Crossref, Google Scholar
• Frank M., Wolfe P. An algorithm for quadratic programming. Naval Res. Logist. Quart. (1956) 3(1–2):95–110Crossref, Google Scholar
• Fukushima M. A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Transportation Res. Part B (1985) 18(2):169–177Crossref, Google Scholar
• Gallager R. G. A minimum delay routing algorithm using distributed computation. IEEE Trans. Comm. (1977) 25(1):73–85Crossref, Google Scholar
• Gibert A. A method for the traffic assignment problem. (1968) . Report LBS-TNT-95, London Business School, LondonGoogle Scholar
• Hearn D. W., Lawphongranich S., Ventura J. A. Finiteness in restricted simplicial decomposition. Oper. Res. Lett. (1985) 4(3):125–130Crossref, 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
• Larsson T., Patriksson M. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Sci. (1992) 26(1):4–17Link, Google Scholar
• LeBlanc L. J., Morlok E. K., Pierskalla W. P. An efficient approach to solving the road network equilibrium traffic assignment problem. Transportation Res. (1975) 9(5):309–318Crossref, Google Scholar
• Leventhal T., Nemhauser G., Trotter L. A column generation algorithm for optimal traffic assignment. Transportation Sci. (1973) 7(2):168–176Link, Google Scholar
• Newell G. F.Traffic Flow on Transportation Networks (1980) 5(MIT Press, Cambridge, MA) Transportation StudiesGoogle Scholar
• Nie Y.A Programmer's Manual for Toolkit of Network Modeling (TNM) (2006) (University of California, Davis, CA) Google Scholar
• Nie Y. A class of bush-based algorithms for the traffic assignment problem. Transportation Res. Part B (2010) 44(1):73–89Crossref, Google Scholar
• Wardrop J. G. Some theoretical aspects of road traffic research. Proc. Institut. Civil Engineers, Part II (1952) 1:325–378Crossref, Google Scholar