Most Likely Traffic Equilibrium Route Flows Analysis and Computation

  • T. Larsson
  • J. T. Lundgren
  • C. Rydergren
  • M. Patriksson
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 58)


When analyzing equilibrium traffic flows it is usually the link flows and link travel demands that are of interest, but in some certain cases analyses require the knowledge of route flows. It is well known that the route flows are non-unique in the static and deterministic cases of traffic equilibrium. Furthermore, different assignment methods can generate different route flow output. We show how this non-uniqueness can affect the results in applications such as in the O-D estimation/adjustment problem, in the construction of induced O-D matrices, exhaust fume emission analyses and in link toll usage analyses. We state a model for finding, uniquely, the most likely route flows given the equilibrium link flows, and propose a solution algorithm for the problem based on partial dualization. We present computational results for the proposed algorithm and results from an application to exhaust fume emissions.


Traffic equilibrium route flows entropy maximization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    T. Akamatsu, Y. Tsuchiya, T. Shimazaki, Parallel distributed processing on neural network for some transportation equilibrium assignment problems, In Proceedings of the 11th International Symposium on the Theory of Traffic Flow and Transportation, Ed. M. Koshi, Yokohama, Elsevier, NY, (1990), 369–386.Google Scholar
  2. [2]
    T. Akamatsu, Cyclic flows, Markov process and stochastic traffic assignment, Transportation Research 30 (1996), 369–386.Google Scholar
  3. [3]
    T. Akamatsu, Decomposition of path choice entropy in general transport networks, Transportation Science 31 (1997), 349–362zbMATHGoogle Scholar
  4. [4]
    R.R. Barton, D.W. Hearn, S. Lawphongpanich, The equivalence of transfer and generalized Benders decomposition methods for traffic assignment, Transportation Research 23B (1989), 61–73.MathSciNetGoogle Scholar
  5. [5]
    M.S. Bazaraa, H.D. Sherali, C.M. Shetty, Nonlinear Programming: Theory and Algorithms, John Wiley & Sons, New York, NY, 1993.zbMATHGoogle Scholar
  6. [6]
    M.G.H. Bell, Y. Iida, Transportation Network Analysis, John Wiley & Sons, Chichester, England, 1997.Google Scholar
  7. [7]
    D.P. Bertsekas, Nonlinear Programming. Athena Scientific, Belmont, MA., 1995.zbMATHGoogle Scholar
  8. [8]
    E. Cascetta, S. Nguyen, A unified framework for estimating or updating origin/destination matrices from traffic counts, Transportation Research 22B (1988), 437–455MathSciNetGoogle Scholar
  9. [9]
    Drive project v1054, 1st. Deliverable, Report on model requirements, 1989.Google Scholar
  10. [10]
    S. Erlander, N.F. Stewart, The Gravity Model in Transportation Analysis, VSP BV, Utrecht, The Netherlands, 1990.zbMATHGoogle Scholar
  11. [11]
    H. Edwards, Estimation of excess cold start emissions on links in traffic networks, (In Swedish) Working paper, VTI, S-581 95 Linköing, Sweden, 1998.Google Scholar
  12. [12]
    S.C. Fang, H.S.J. Tsao, A quadratic convergent global algorithm for the linearly-constrained minimum cross-entropy problem, European Journal of Operations Research 79 (1994), 369–378.CrossRefzbMATHGoogle Scholar
  13. [13]
    C.S. Fisk, Some developments in equilibrium traffic assignment, Transportation Research 14B (1980), 243–255.MathSciNetGoogle Scholar
  14. [14]
    C.S. Fisk, On combing maximum entropy trip matrix estimation with user optimal assignment, Transportation Research 22B (1988), 69–79.MathSciNetGoogle Scholar
  15. [15]
    M. Florian, S. Nguyen, An application and validation of equilibrium trip assignment methods, Transportation Science 10 (1976), 374–390.Google Scholar
  16. [16]
    D.W. Hearn, Practical and theoretical aspects of aggregation problems in transportation models, In Transportation Planning Models, Proceedings of the course given at the International Center for Transportation Studies, Amalfi, Italy, October 11–16, 1982, Ed. M. Florian. North-Holland, Amsterdam (1984), 257–287.Google Scholar
  17. [17]
    B.N. Janson, Most likely origin-destination link uses from equilibrium assignment, Transportation Research 27B (1993), 333–350.Google Scholar
  18. [18]
    B. Lamond, N.F. Stewart, Bregman’s balancing method, Transportation Research 15B (1981), 239–248.MathSciNetGoogle Scholar
  19. [19]
    T. Larsson, M. Patriksson, Simplicial decomposition with disaggregate representation for the traffic assignment problem, Transportation Science 26 (1992), 4–17.CrossRefzbMATHGoogle Scholar
  20. [20]
    L.J. LeBlanc, E.K. Morlok, W.P. Pierskalla, An efficient approach to solving the road network equilibrium traffic assignment problem, Transportation Research 9 (1975), 309–318.CrossRefGoogle Scholar
  21. [21]
    M. Patriksson, The Traffic Assignment Problem-Models and Methods, VSP BV, Utrecht, The Netherlands, 1994.Google Scholar
  22. [22]
    B.T. Polyak, Introduction to Optimization, Optimization Software, Inc., Publications Division, N.Y., 1987.Google Scholar
  23. [23]
    T.F. Rossi, S. McNeil, C. Hendrickson, Entropy model for consistent impact fee assessment, Journal of Urban Planning and Development/ ASCE 115 (1989), 51–63.Google Scholar
  24. [24]
    E. Sérié, R. Joumard, Modelling of cold start emissions for road vehicles, INRETS report LEN 9731, 1997.Google Scholar
  25. [25]
    K.A. Small, Using revenues from congestion pricing, Transportation 19 (1992), 359–381.Google Scholar
  26. [26]
    T.E. Smith, A cost-efficiency of spatial interaction behaviour, Regional Science and Urban Economics 8 (1978), 137–168.CrossRefGoogle Scholar
  27. [27]
    T.E. Smith, A cost-efficiency approach to the analysis of congested spatial-interaction behavior, Environment and Planning 15A (1983), 435–464.Google Scholar
  28. [28]
    F. Snickars, J.W. Weibull, A minimum information principle: Theory and practice, Regional Science and Urban Economics 7 (1977), 137–168.CrossRefGoogle Scholar
  29. [29]
    Y. Sheffi, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Prentice-Hall. Englewood Cliffs, NJ, 1985.Google Scholar
  30. [30]
    The Economist, December 6 1997, 21–24.Google Scholar
  31. [31]
    D. Van Vliet, Selected node-pair analysis in Dial’s assignment algorithm, Transportation Research 15B (1981), 65–68.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • T. Larsson
    • 1
  • J. T. Lundgren
    • 1
  • C. Rydergren
    • 1
  • M. Patriksson
    • 2
  1. 1.Department of MathematicsLinköing UniversityLinköingSweden
  2. 2.Department of MathematicsChalmers University of TechnologyGöeborgSweden

Personalised recommendations