Abstract
The problem of adjusting (or estimating) an origin-destination (O-D) matrix by using observed flows on the links of a congested traffic network, which we denote DAP, is considered in this paper. After reviewing the previous contributions made in stating models and development solution algorithms for this problem, a nonlinear bilevel programming formulation is proposed to model the DAP. The existence of solutions is proved under relatively mild assumptions on the link cost functions and the property of the continuous dependence of equilibrium link flows on the demand is demonstrated under a fairly weaker condition. By using the general bilevel programming theory, the DAP is reformulated as a single-level like optimization problem, where the marginal function of the lower level equilibrium problem is used explicitly in a constraint. The gradient function of the implicit marginal function is derived in terms of the link cost map** and the link proportions in an equilibrium state. Necessary optimality conditions for the DAP are derived based on the gradient information of the marginal function, of which the significance and application for the DAP are discussed as well.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aiyoshi, E. and Shimizu K., “A Solution method for the static constrained Stackelberg problem via penalty functions”, IEEE Trans. Auto. Control AC-29 (1984), 1111–1114.
Bard, T.F., “Convex two-level optimization”, Mathematical Programming 40 (1988), 15–27.
Bard, J.F. and I.E. Falk, “An explicit solution to the multilevel programming problem”, Computers and Operations Research 9 (1982), 77–100.
Bell, M. G. H., “The estimation of an origin-destination matrix from traffic counts”, Transportation Science 17 (1983),198–217.
Ben-Ayed, O, D.E. Boyce and C.E. Blair, “A General Bilevel Linear Programming Formulation of the Network Design Problem”, Transportation Research B 22 (1988), 311–318.
Bialas, W.F. and M.H. Karwan, “Two-level Linear Programming”, Management Science 30 (1984), 1004–1020.
Brenninger-Göthe, M. K.O. Jörnsten and. LT. Lundgren, “Estimation of origin-destination matrices from counts using multiobjective programming formulations”, Transportation Research B 23 (1989), 257–269.
Candler, W. and R. Townsley, “A Linear Two-level Programming Problem”, Computers and Operations Research 9 (1982), 59–76.
Carey, M., C. Hendrickson and K. Siddarthan, “A method for estimation of origin/destination trip matrices”, Transportation Science 15 (1981), 32–49.
Cascetta, E. and S. Nguyen, “A Unified Framework for Estimating or Updating Origin-Destination Matrices from Traffic Coun ts”, Transportation Research B 22 (1988), 437–455.
Chen, Y., “Bilevel Programming Problems: Analysis, algorithms and applications”, Ph.D. dissertation, Université de Montréal, Montréal, Canada (1993).
Chen, Y. and M. Florian, “The Nonlinear Bilevel Programming: Formulations, Regularity and Optimality Conditions”, to appear in Optimization, Publication CRT-794, Université de Montréal, Montréal, Canada (revised version, 1993).
Dafermos, S., “Traffic equilibrium and variational inequalities”, Transportation Science 14 (1980), 42–54.
Dafermos, S. and A. Nagurney, “Sensitivity Analysis for the Asymmetric Network Equilibrium Problem”, Mathematical Programming 28 (1984),174–184.
Drissi-Kaїouni, O. and J. Lundgren, “Bilevel Origin-destination Matrix Estimation Using a Descent Approach”, Technique Report, LiTH-MA T -R-1992–49, Linkö** University, Linkö**, Sweden (1992).
Fisk, C.S., “On Combining Maximum Entropy Trip Matrix Estimation with User Optimal Assignment”, Transportation Research B 22 (1988), 69–73.
Fisk, C.S., “Trip Matrix Estimation from Link Traffic Counts: The Congested Network Case”, Transportation Research B 23 (1989), 331–336.
Florian, M and Y. Chen, “A coordinate descent method for bilevel O-D matrix adjustment problem”, to appear in International Transactions in Operational Research (1994).
Florian, M and Y. Chen, “A Bilevel Programming Approach to Estimating O-D Matrix by Traffic counts”, Publication CRT-750, Université de Montréal, Montréal, Canada (1991).
Gur, Y.J., M. Turnquist, M. Schneider, L. LeBlanc and D. Kurth, “Estimation of an Origin-Destination Trir Table Based on Observed Link Volumes and Turning Movements’? - Volume 1., Technical Report, FHWA, U.S. Department of Transportation, Washington, D.C., RD-801034, (1980).
Hall, M. A., “Properties of the Equilibrium State in Transportation Networks”, Transportation Science 12 (1978),208–216.
Hansen, P., B. Jaumard and G. Savard, “New Branching and Bounding Rules for Linear Bilevel Programming”, SIAM J. Sci. Stat. Comput.13 (1992)
Hogan, W., “Point-to-set Maps in Mathematical Programming”, SIAM Review 15 (1973), 591–603.
Holm, J., T. Jenson, S.K. Nielsen, A. Christensen, B. Johnsen and G. Ronby, “Calibrating Traffic Models on Traffic Census Results Only”, Traffic Engineering and Control 17 (1976),137–140.
INRO Consultants Inc., “EMMEI2 Users’ Manual”, 735 pp, Montréal, Québec, Canada (1990).
Jornsten, K. and S. Nguyen, “On the estimation of a trip matrix from network data”, Publication No. 153, CRT, Université de Montréal, Montréal, Canada (1979).
Jörnsten, K. and S. Wallace, “Overcoming the (apparent) problems of inconsistency in origin-destination matrix estimations”, Transportation Sciences 27 (1993), 374–380.
Maher, M.J., “Inferences on Trip Matrices from Observations on Link Volumes: A Bayesian Statistical Approach”, Transportation Research 17B (1983),435–447.
Marcotte, P., “Network Design Problem with Congestion Effects: A Case of Bilevel Programming”, Mathematical Programming 34 (1986), 142–162.
McNeil, S. and C. Hendrickson, “A regression formulation of the matrix estimation problem”, Transportation Science 19 (1985), 278–292.
Nguyen, S., “Estimating an O-D Matrix from Network Data: A Network Equilibrium Approach”, Publication No. 60, CRT, Université de Montréal, Montréal, Canada (1977).
Nguyen, S., “Modeles de distribution spatiale tenant compte des itineraires”, INFOR (1983)
Nguyen, S., “Estimating Origin-DestiQation Matrices from Observed Flows”, in Transportation Planning Models (Eds. M. Florian) (1984), 363–380.
Nguyen, S. and C. Dupuis, “An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs”, Transportation Science 18 (1984), 185–232.
Smith, M.J., “Existence, Uniqueness and Stability of Traffic Equilibria”, Transportation Research B 13 (1979),295–304.
Smock, R., “An iterative Assignment approach to capacity restraint on arterial networks”, HRB, Bulletin 347 (1962).
Spiess, H., “A Maximum Likelihood Model for Estimating OriginDestination Matrices”, Transportation Research 21B, 395–412 (1987).
Spiess, H., “A Gradient Approach for the O-D Matrix Adjustment Problem”, Publication No.693, CRT, Université de Montréal, Montréal, Canada (1990)
Tobin, R. and T.Y. Friesz, “Sensitivity Analysis for Equilibrium Network Flow”, Transportation Science 22 (1988), 242–250.
Van Zuylen, T.H., “The information minimizing method: Validity and applicability to transport planning”, in New Developments in Modeling Travel Demand and Urban Systems (Edited by Jansen G. R. H., et al). Saxon, Farnborough (1978).
Van Zuylen, J.H. and D.M. Branston, “Consistent link flow estimation from counts”, Transportation Research 16B (1982),473–476.
Van Zuylen, J.H. and L.G. Willumsen, “The Most Likely Trip Matrix Estimated from Traffic Counts”, Transportation Research B 14 (1980), 281–293.
Wardrop, J.G., “Some Theoretical Aspects of Road Traffic Research”, Proceedings of the lnsititute of Civil Engineers Part II (1952), 325–378.
Will umsen, L. G., “Simplified transport models based on traffic counts”, Transportation Planning 10 (1981), 257–278.
Yang, H., T. Sasaki, Y. Iida and Y. Asakura, “Estimation Origindestination Matrices from Link Traffic Counts on Congested Networks”, Transportation Research 26B (1992), 417–434.
Yang, H., Y. Iida and T. Sasaki, “The Equilibrium-based Origindestination Matrix Estimation Problem”, Transportation Research 28B (1994), 23–33.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Chen, Y., Florian, M. (1996). O-D Demand Adjustment Problem with Congestion: Part I. Model Analysis and Optimality Conditions. In: Bianco, L., Toth, P. (eds) Advanced Methods in Transportation Analysis. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85256-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-85256-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85258-9
Online ISBN: 978-3-642-85256-5
eBook Packages: Springer Book Archive