A Stochastic User Equilibrium (SUE) Path Flow Estimator for the Dedale Database in Lyon

  • Michael G. H. Bell
  • Caroline M. Shield
  • Jean-Jacques Henry
  • Laurent Breheret
Conference paper
Part of the Transportation Analysis book series (TRANSANALY)

Abstract

The paper sets out a path flow estimator suitable for the DEDALE database in Lyon, where traffic flow measurements are available at 6-minute intervals from 71 Traffic Data Collection Units (permanent counting stations). The estimator assumes that traffic assigns itself to paths according to the logit route choice model and that congestion leading to delay only forms on a link when its capacity is reached. An equivalent convex programming problem is formulated and an iterative solution procedure is set out. The estimation of the dispersion factor in, the logit model is discussed, and a column generation method is proposed to avoid the need for path enumeration. A number of propositions are proved.

Keywords

Entropy Transportation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ashok, K. & Ben-Akiva, M.E. (1993) “Dynamic origin-destination matrix estimation and prediction for real-time traffic management systems”,Proceedings of the 12th International Symposium on the Theory of Traffic Flow and Transportation Elsevier: Amsterdam, 465–484.Google Scholar
  2. [2]
    Bazaraa, M.S., Jarvis, J.J. & Sherali, H.D. (1990) “Linear Programming and Network Flows”, John Wiley: New York.Google Scholar
  3. [3]
    Bell, M.G.H. (1991a) “The estimation of generalised least squares by constrained generalised least squares”, Transportation Research Vol. 25B, 13–22.Google Scholar
  4. [4]
    Bell, M.G.H. (1991b) “The real-time estimation of origin-destination flows in the presence of platoon dispersion”, Transportation Research Vol. 25B, 115–125.Google Scholar
  5. [5]
    Bell, M.G.H., Inaudi, D., Lange, J. & Maher, M. (1991) “Techniques for the dynamic estimation of O-D matrices in traffic networks”, Proceedings of the DRIVE Conference, Brussels, 1040–1056.Google Scholar
  6. [6]
    Bell, M.G.H., Lam, H.W.K., Ploss, G. & Inaudi, D. (1993a) “Stochastic user equilibrium assignment and iterative balancing”, Proceedings of the 12th International Symposium on Transportation and Traffic Theory Berkeley, July.Google Scholar
  7. [7]
    Bell, M.G.H. (1995) “Stochastic user equilibrium assignment in networks with queues”,Transportation Research B. In Press.Google Scholar
  8. [8]
    Cascetta, E. (1984) “Estimation of trip matrices from traffic counts and survey data”, Transportation Research Vol. 18B, 289–299.Google Scholar
  9. [9]
    Cremer, M. & Keller, H. (1987) “A new class of dynamic methods for the identification of origin-destination flows”, Transportation Research 21B, 117–132.Google Scholar
  10. [10]
    Di Taranto, C., Inaudi, D., Verlardi, V. (1993) “Traffic monitoring and control: the ELASIS pilot project in Salerno”, Workshop on Integration Problems in Urban Transportation Planning and Management Systems, Capri, October.Google Scholar
  11. [11]
    Erlander, S., Nguyen, S. & Stewart, N.F. (1979) “On the calibration of the combined distribution and assignment model”, Transportation Research Vol. 13B, 259–267.Google Scholar
  12. [12]
    Fisk, C. (1980) “Some developments in equilibrium traffic assignment”, Transportation Research Vol. 14B, 243–255.Google Scholar
  13. [13]
    Florian, M. & Chen, Y. (1991) “A bilevel programming approach to estimating O-D matrix by traffic counts”, Report CRT-750 Centre de recherche sur les transports, Montreal.Google Scholar
  14. [14]
    Leonard, D.R., Tough, J.B. & Baguley, P.C. (1978) “CONTRAM - A traffic assignment model for predicting flows and queues during peak periods”, TRRL Laboratory Report LR841.Google Scholar
  15. [15]
    Maher, M.J. (1983) “Inferences on trip matrices from observations on link volumes: a Bayesian statistical approach”, Transportation Research Vol. 17B, 435–447.Google Scholar
  16. [16]
    Nihan, N.L. & Davis, G.A. (1987) “Recursive estimation of origin-destination matrices from input/output counts”, Transportation Research Vol. 21B, 149–163.Google Scholar
  17. [17]
    Sherali, H.D., Sivanandan, R. & Hobeika, A.G. (1994) “A linear programming approach for synthesising origin-destination trip tables from link traffic volumes”, Transportation Research In Press.Google Scholar
  18. [18]
    Smith, M.J. (1987) “Traffic control and traffic assignment in a signalcontrolled network with queuing”, Proceedings of the 10th Symposium on Transportation and Traffic Theory MIT, July, 61–77.Google Scholar
  19. [19]
    Spiess, H. (1987) “A maximum likelihood model for estimating origin-destination matrices”, Transportation Research Vol.21B, 395–412.Google Scholar
  20. [20]
    Thompson, W.A. & Payne, H.J. (1975) “Traffic assignment on transportation networks with capacity constraints and queuing” Paper presented at the 47th National ORSA/TlMS North American Meeting.Google Scholar
  21. [21]
    Van Zuylen, H.J. & Willumsen, L.G. (1980) “The most likely trip matrix estimated from traffic counts” Transportation Research Vol. 14B,281–293.Google Scholar
  22. [22]
    Wardrop, J.G. (1952) “Some theoretical aspects of road traffic research” Proceedings of the Institution of Civil Engineers II(1), 325-378.Google Scholar
  23. [23]
    Yang, H., Sasaki, T., Iida, Y. & Asakura, Y. (1992) “Estimation of origin-destination matrices from link traffic counts on congested networks”, Transportation Research Vol. 26B, 417–434.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1996

Authors and Affiliations

  • Michael G. H. Bell
    • 1
  • Caroline M. Shield
    • 1
  • Jean-Jacques Henry
    • 2
  • Laurent Breheret
    • 3
  1. 1.Transport Operations Research Group, Department of Civil EngineeringUniversity of Newcastle upon TypeUK
  2. 2.Centre D’Etude Et De Recherche ToulouseToulouseFrance
  3. 3.SODITLabege CedexFrance

Personalised recommendations