IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v28y1994i1p23-33.html
   My bibliography  Save this article

The equilibrium-based origin-destination matrix estimation problem

Author

Listed:
  • Yang, Hai
  • Iida, Yasunori
  • Sasaki, Tsuna

Abstract

This paper examines a model due to Nguyen for estimating origin-destination (O-D) matrices from observed traffic flows on each network link. It is shown that the previous bilevel optimization models for choosing an O-D matrix can be transformed into single convex programs. Under the condition that the observed link flow pattern is an equilibrium, Nguyen's model is demonstrated to be equivalent to an underspecified system of linear equations with non-negative variables. By exploiting the properties of the system's feasible region, simpler methods, such as a least squares technique, can be used to obtain an O-D matrix that, when user-optimally assigned to the network, reproduces the observed link flows.

Suggested Citation

  • Yang, Hai & Iida, Yasunori & Sasaki, Tsuna, 1994. "The equilibrium-based origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 28(1), pages 23-33, February.
  • Handle: RePEc:eee:transb:v:28:y:1994:i:1:p:23-33
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(94)90029-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hazelton, Martin L., 2000. "Estimation of origin-destination matrices from link flows on uncongested networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(7), pages 549-566, September.
    2. Yang, Hai, 1995. "Heuristic algorithms for the bilevel origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 231-242, August.
    3. Lo, H. P. & Zhang, N. & Lam, W. H. K., 1999. "Decomposition algorithm for statistical estimation of OD matrix with random link choice proportions from traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 33(5), pages 369-385, June.
    4. Zhao, Yong & Kockelman, Kara Maria, 2006. "On-line marginal-cost pricing across networks: Incorporating heterogeneous users and stochastic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 40(5), pages 424-435, June.
    5. Hai Yang & Qiang Meng & Michael G. H. Bell, 2001. "Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium," Transportation Science, INFORMS, vol. 35(2), pages 107-123, May.
    6. Yang, Yudi & Fan, Yueyue, 2015. "Data dependent input control for origin–destination demand estimation using observability analysis," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 385-403.
    7. Shen, Wei & Wynter, Laura, 2012. "A new one-level convex optimization approach for estimating origin–destination demand," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1535-1555.
    8. Bera, Sharminda & Rao, K. V. Krishna, 2011. "Estimation of origin-destination matrix from traffic counts: the state of the art," European Transport \ Trasporti Europei, ISTIEE, Institute for the Study of Transport within the European Economic Integration, issue 49, pages 2-23.
    9. Xie, Chi & Kockelman, Kara M. & Waller, S. Travis, 2011. "A maximum entropy-least squares estimator for elastic origin–destination trip matrix estimation," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1465-1482.
    10. Sherali, Hanif D. & Narayanan, Arvind & Sivanandan, R., 2003. "Estimation of origin-destination trip-tables based on a partial set of traffic link volumes," Transportation Research Part B: Methodological, Elsevier, vol. 37(9), pages 815-836, November.
    11. Wong, S. C. & Tong, C. O., 1998. "Estimation of time-dependent origin-destination matrices for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(1), pages 35-48, January.
    12. Louis Grange & Felipe González & Shlomo Bekhor, 2017. "Path Flow and Trip Matrix Estimation Using Link Flow Density," Networks and Spatial Economics, Springer, vol. 17(1), pages 173-195, March.
    13. Yang, Yudi & Fan, Yueyue & Wets, Roger J.B., 2018. "Stochastic travel demand estimation: Improving network identifiability using multi-day observation sets," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 192-211.
    14. Yang, Hai & Meng, Qiang & Lee, Der-Horng, 2004. "Trial-and-error implementation of marginal-cost pricing on networks in the absence of demand functions," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 477-493, July.
    15. Shao, Hu & Lam, William H.K. & Sumalee, Agachai & Chen, Anthony & Hazelton, Martin L., 2014. "Estimation of mean and covariance of peak hour origin–destination demands from day-to-day traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 52-75.
    16. T. Abrahamsson, 1998. "Estimation of Origin-Destination Matrices Using Traffic Counts- A Literature Survey," Working Papers ir98021, International Institute for Applied Systems Analysis.
    17. Yang, Hai & Zhou, Jing, 1998. "Optimal traffic counting locations for origin-destination matrix estimation," Transportation Research Part B: Methodological, Elsevier, vol. 32(2), pages 109-126, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:28:y:1994:i:1:p:23-33. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.