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

Stochastic OD demand estimation using stochastic programming

Author

Listed:
  • Sun, Ran
  • Fan, Yueyue

Abstract

Understanding the origin–destination (OD) demand of travelers can help traffic operators and mobility service providers form more efficient mobility planning and operation decisions. Large quantities of high-dimensional spatial and temporal data that are becoming increasingly available for urban transportation systems present opportunities as well as new challenges to this end. Approaching from a fresh angle of stochastic programming, we present a modeling framework for OD demand estimation based on observed traffic flow data in a transportation network. The proposed two-stage stochastic programming-based method is flexible to incorporate various design principles and risk preferences and domain knowledge regarding travel behavioral and physical rules. Additionally, a benefit comes from the scenario representation, where the point estimate can be combined with estimation of the discrete approximation to the demand distribution. As a result, we simultaneously incorporate demand parameter estimation and trip table reconstruction processes. In addition, we demonstrate that under the proposed framework, well-established theories and methods for stochastic programming, including epi-convergence and scenario-decomposition, can be exploited to advance the analytical and computational capabilities of the estimation model. The applicability and efficiency of the proposed method are illustrated through numerical examples based on highway and transit networks of various sizes.

Suggested Citation

  • Sun, Ran & Fan, Yueyue, 2024. "Stochastic OD demand estimation using stochastic programming," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    • Handle: RePEc:eee:transb:v:183:y:2024:i:c:s0191261524000675
    DOI: 10.1016/j.trb.2024.102943
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261524000675
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2024.102943?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Yong Wang & Xiaolei Ma & Yong Liu & Ke Gong & Kristian C Henricakson & Maozeng Xu & Yinhai Wang, 2016. "A Two-Stage Algorithm for Origin-Destination Matrices Estimation Considering Dynamic Dispersion Parameter for Route Choice," PLOS ONE, Public Library of Science, vol. 11(1), pages 1-24, January.
    2. Lisa A. Korf & Roger J.-B. Wets, 2001. "Random LSC Functions: An Ergodic Theorem," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 421-445, May.
    3. 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.
    4. Alan J. King & R. Tyrrell Rockafellar, 1993. "Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 148-162, February.
    5. Azaron, A. & Brown, K.N. & Tarim, S.A. & Modarres, M., 2008. "A multi-objective stochastic programming approach for supply chain design considering risk," International Journal of Production Economics, Elsevier, vol. 116(1), pages 129-138, November.
    6. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    7. Hazelton, Martin L., 2008. "Statistical inference for time varying origin-destination matrices," Transportation Research Part B: Methodological, Elsevier, vol. 42(6), pages 542-552, July.
    8. Santoso, Tjendera & Ahmed, Shabbir & Goetschalckx, Marc & Shapiro, Alexander, 2005. "A stochastic programming approach for supply chain network design under uncertainty," European Journal of Operational Research, Elsevier, vol. 167(1), pages 96-115, November.
    9. Ricardo Collado & Dávid Papp & Andrzej Ruszczyński, 2012. "Scenario decomposition of risk-averse multistage stochastic programming problems," Annals of Operations Research, Springer, vol. 200(1), pages 147-170, November.
    10. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    11. Yueyue Fan & Changzheng Liu, 2010. "Solving Stochastic Transportation Network Protection Problems Using the Progressive Hedging-based Method," Networks and Spatial Economics, Springer, vol. 10(2), pages 193-208, June.
    12. Yang, Yudi & Fan, Yueyue & Royset, Johannes O., 2019. "Estimating probability distributions of travel demand on a congested network," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 265-286.
    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. Joaquín de Cea & Enrique Fernández, 1993. "Transit Assignment for Congested Public Transport Systems: An Equilibrium Model," Transportation Science, INFORMS, vol. 27(2), pages 133-147, May.
    15. Nguyen, S. & Morello, E. & Pallottino, S., 1988. "Discrete time dynamic estimation model for passenger origin/destination matrices on transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 22(4), pages 251-260, August.
    16. Lo, H. P. & Zhang, N. & Lam, W. H. K., 1996. "Estimation of an origin-destination matrix with random link choice proportions: A statistical approach," Transportation Research Part B: Methodological, Elsevier, vol. 30(4), pages 309-324, August.
    17. Jean-Paul Watson & Roger J-B Wets & David L. Woodruff, 2010. "Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 543-554, November.
    18. Cascetta, Ennio, 1984. "Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator," Transportation Research Part B: Methodological, Elsevier, vol. 18(4-5), pages 289-299.
    19. 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.
    20. Sherali, Hanif D. & Sivanandan, R. & Hobeika, Antoine G., 1994. "A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes," Transportation Research Part B: Methodological, Elsevier, vol. 28(3), pages 213-233, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anselmo Ramalho Pitombeira-Neto & Carlos Felipe Grangeiro Loureiro & Luis Eduardo Carvalho, 2020. "A Dynamic Hierarchical Bayesian Model for the Estimation of day-to-day Origin-destination Flows in Transportation Networks," Networks and Spatial Economics, Springer, vol. 20(2), pages 499-527, June.
    2. Yang, Yudi & Fan, Yueyue & Royset, Johannes O., 2019. "Estimating probability distributions of travel demand on a congested network," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 265-286.
    3. Blume, Steffen O.P. & Corman, Francesco & Sansavini, Giovanni, 2022. "Bayesian origin-destination estimation in networked transit systems using nodal in- and outflow counts," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 60-94.
    4. Flurin S. Hänseler & Nicholas A. Molyneaux & Michel Bierlaire, 2017. "Estimation of Pedestrian Origin-Destination Demand in Train Stations," Transportation Science, INFORMS, vol. 51(3), pages 981-997, August.
    5. 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.
    6. Castillo, Enrique & Menéndez, José María & Sánchez-Cambronero, Santos, 2008. "Predicting traffic flow using Bayesian networks," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 482-509, June.
    7. 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.
    8. Li, Guoyuan & Chen, Anthony, 2022. "Frequency-based path flow estimator for transit origin-destination trip matrices incorporating automatic passenger count and automatic fare collection data," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    9. Castillo, Enrique & Menéndez, José María & Jiménez, Pilar, 2008. "Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 455-481, June.
    10. Fu, Hao & Lam, William H.K. & Shao, Hu & Ma, Wei & Chen, Bi Yu & Ho, H.W., 2022. "Optimization of multi-type sensor locations for simultaneous estimation of origin-destination demands and link travel times with covariance effects," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 19-47.
    11. Hazelton, Martin L., 2003. "Some comments on origin-destination matrix estimation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(10), pages 811-822, December.
    12. 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.
    13. Lo, Hing-Po & Chan, Chi-Pak, 2003. "Simultaneous estimation of an origin-destination matrix and link choice proportions using traffic counts," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(9), pages 771-788, November.
    14. Tao Li, 2017. "A Demand Estimator Based on a Nested Logit Model," Transportation Science, INFORMS, vol. 51(3), pages 918-930, August.
    15. Maryam Abareshi & Mehdi Zaferanieh & Bagher Keramati, 2017. "Path Flow Estimator in an Entropy Model Using a Nonlinear L-Shaped Algorithm," Networks and Spatial Economics, Springer, vol. 17(1), pages 293-315, March.
    16. Nie, Yu & Zhang, H.M. & Recker, W.W., 2005. "Inferring origin-destination trip matrices with a decoupled GLS path flow estimator," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 497-518, July.
    17. Seungkyu Ryu, 2020. "A Bicycle Origin–Destination Matrix Estimation Based on a Two-Stage Procedure," Sustainability, MDPI, vol. 12(7), pages 1-14, April.
    18. Guo, Jianhua & Liu, Yu & Li, Xiugang & Huang, Wei & Cao, Jinde & Wei, Yun, 2019. "Enhanced least square based dynamic OD matrix estimation using Radio Frequency Identification data," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 155(C), pages 27-40.
    19. 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.
    20. Hänseler, Flurin S. & Bierlaire, Michel & Scarinci, Riccardo, 2016. "Assessing the usage and level-of-service of pedestrian facilities in train stations: A Swiss case study," Transportation Research Part A: Policy and Practice, Elsevier, vol. 89(C), pages 106-123.

    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:183:y:2024:i:c:s0191261524000675. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.