Origin-based Network Assignment

  • Hillel Bar-Gera
  • David Boyce
Part of the Applied Optimization book series (APOP, volume 64)


Most solution methods for the traffic assignment problem can be categorized as either link-based or route-based. Only a few attempts have followed the intermediate, origin-base dapproach. This paper describes the main concepts of a new, origin-based method for the static user equilibrium traffic assignment problem. Computational efficiency in time and memory makes this method suitable for large-scale networks of practical interest. Experimental results show that the new method is especially efficient in finding highly accurate solutions.


Origin-based traffic assignment user equilibrium network optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H. Bar-Gera. Origin-based Algorithms for Transportation Network Modeling. PhD thesis, Civil Engineering, University of Illinois at Chicago, 1999.Google Scholar
  2. [2]
    H. Bar-Gera, and D. Boyce. Route flow entropy maximization in originbased traffic assignment. Transportation and Traffic Theory, Proceedings of the 14th international symposium on transportation and traffic theory. Jerusalem, Israel, 20–23 July, 1999, A. Ceder, ed. Elsevier Science, Oxford, UK, 397–415.Google Scholar
  3. [3]
    M. Beckmann, C.B. McGuire, and C.B. Winston. Studies in the Economics of Transportation. Yale University Press, New Haven, CT, 1956.Google Scholar
  4. [4]
    D. P. Bertsekas. Algorithms for nonlinear multicommodity network flow problems. in Proceedings of the International Symposium on Systems Optimization and Analysis. A. Bensoussan and J. L. Lions, eds., Springer-Verlag, New-York, 210–224, 1979.Google Scholar
  5. [5]
    D. P. Bertsekas, E. M. Gafni, and K. S. Vastola. Validation of algorithms for optimal routing of flow in networks. in Proceedings of the 1979 IEEE conference on Decision and Control, San Diego, CA, January 10–12, 1979, 220–227, 1979.Google Scholar
  6. [6]
    D. P. Bertsekas, E. M. Gafni, and R. G. Gallager. Second derivative algorithms for minimum delay distributed routing in networks. IEEE Transactions on Communications, COM-32:911–919, 1984.MathSciNetGoogle Scholar
  7. [7]
    D. P. Bertsekas. Network Optimization — continuous and discrete models, Athena Scientific, Belmont, Massachusetts, USA, 1998.Google Scholar
  8. [8]
    P. Bothner and W. Lutter. Eindirektes verfahren zur verkehrsumlegung nach dem 1. prinzip von wardrop. Forschungsbereich: Verkehrssysteme Arbeitsbericht 1, Universitaet Bremen, 1982.Google Scholar
  9. [9]
    M. Bruynooghe, A. Gibert, and M. Sakarovitch. Une méthode ďaffectation du trafic. In Proceedings of the 4th International Symposium on the Theory of Road Traffic Flow, Karlsruhe, 1968, W. Leutzbach and P. Baron, editors, Beiträgezur Theorie des Verkehrsflusses Strassenbau und Strassenverkehrstechnik, Heft 86, Herausgegeben von Bundesminis-er für Verkehr, Abteilung Strassenbau, Bonn, pp. 198–204, 1969.Google Scholar
  10. [10]
    S.C. Dafermos. Traffic Assignment and Resource Allocation in Transportation Networks. PhD thesis, Johns Hopkins University, Baltimore, MD, 1968.Google Scholar
  11. [11]
    S.C. Dafermosand F.T. Sparrow. The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, 73B:91–118, 1969.Google Scholar
  12. [12]
    M. Florian and H. Spiess. Transport networks in practice. In Proceedings of the Conference of the Operations Research Society of Italy, Napoli, pp. 29–52, 1983.Google Scholar
  13. [13]
    M. Fukushima. A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Transportation Research, 18B:169–177, 1984.MathSciNetGoogle Scholar
  14. [14]
    R.G. Gallager. Aminimum delay routing algorithm using distributed computation. IEEE Transactions on Communications, COM-25:73–85, 1977.MathSciNetGoogle Scholar
  15. [15]
    A. Gibert. A method for the traffic assignment problem. Report LBS-TNT-95, Transportation Network Theory Unit, London Business School, London, 1968.Google Scholar
  16. [16]
    J.N. Hagstrom. Computing tolls and checking equilibrium for traffic flows. University of Illinois at Chicago, preprint, 1997.Google Scholar
  17. [17]
    D.W. Hearn, S. Lawphongpanich, and J.A. Venture. Restricted simplicial decomposition: computation and extensions. Math. Program. Study, 31:99–118, 1987.Google Scholar
  18. [18]
    B.N. Janson. Most likely origin-destination link uses from equilibrium assignment. Transportation Research, 27B:333–350, 1993.Google Scholar
  19. [19]
    R. Jayakrishnan, W.K. Tsai, J.N. Prashker, and S. Rajadhyaksha. A faster path-based algorithm for traffic assignment. Transportation Research Record, 1443:75–83, 1994.Google Scholar
  20. [20]
    T. Larsson and M. Patriksson. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Science, 26:4–17, 1992.CrossRefGoogle Scholar
  21. [21]
    T. Larsson, M. Patriksson, and C. Rydergren. Application of simplicial decomposition with nonlinear column generation to nonlinear network flows. In licentiate thesis by Clas Rydergren, Thesis No. 702, Linköping Institute of Technology, Linköping, Sweden, 1998.Google Scholar
  22. [22]
    L.J. LeBlanc, R.V. Helgason, and D.E. Boyce. Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transportation Science, 19:445–462, 1985.MathSciNetGoogle Scholar
  23. [23]
    L.J. LeBlanc, E.K. Morlok, and W.P. Pierskalla. An efficient approach to solving the road network equilibrium traffic assignment problem. Transportation Research, 9:309–318, 1975.Google Scholar
  24. [24]
    M. Lupi. Convergence of the Frank-Wolfe algorithm for solving the traffic assignment problem. Civil Engineering Systems, 3:7–15, 1986.CrossRefGoogle Scholar
  25. [25]
    S. Pallottino and M.G. Scutella. Shortest path algorithms in transportation models: classical and innovative aspects. In P. Marcotte and S. Nguyen, editors, Equilibrium and Advanced Transportation Modelling. Kluwer Academic Publishers, Boston, 1998.Google Scholar
  26. [26]
    U. Pape. Implementation and efficiency of moore-algorithms for the shortest route problem. Mathematical Programming, 7:212–222, 1974.CrossRefMathSciNetzbMATHGoogle Scholar
  27. [27]
    M. Patriksson. The Traffic Assignment Problem, Models and Methods. VSP, Utrecht, Netherlands, 1994.Google Scholar
  28. [28]
    T. F. Rossi, S. McNeil, and C. Hendrickson. Entropy model for consistent impact fee assessment. Journal of Urban Planning and Development/ASCE, 115:51–63, 1989.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Hillel Bar-Gera
  • David Boyce
    • 1
  1. 1.Department of Civil and Materials EngineeringUniversity of Illinois at ChicagoChicagoUSA

Personalised recommendations