IDEAS home Printed from https://ideas.repec.org/a/spr/pubtra/v17y2025i1d10.1007_s12469-024-00370-x.html
   My bibliography  Save this article

Proposing a model for predicting passenger origin–destination in online taxi-hailing systems

Author

Listed:
  • Pouria Golshanrad

    (University of Tehran)

  • Hamid Mahini

    (University of Tehran)

  • Behnam Bahrak

    (University of Tehran)

Abstract

Due to the significance of transportation planning, traffic management, and dispatch optimization, predicting passenger origin–destination has emerged as a crucial requirement for intelligent transportation systems management. In this study, we present a model designed to forecast the origin and destination of travels within a specified time window. To derive meaningful travel flows, we employ K-means clustering in a four-dimensional space with a maximum cluster size constraint for origin and destination zones. Given the large number of clusters, we utilize non-negative matrix factorization to reduce the number of travel clusters. Furthermore, we implement a stacked recurrent neural network model to predict the travel count in each cluster. A comparison of our results with existing models reveals that our proposed model achieves a 5–7% lower mean absolute percentage error (MAPE) for 1-h time windows and a 14% lower MAPE for 30-min time windows.

Suggested Citation

  • Pouria Golshanrad & Hamid Mahini & Behnam Bahrak, 2025. "Proposing a model for predicting passenger origin–destination in online taxi-hailing systems," Public Transport, Springer, vol. 17(1), pages 121-151, March.
    • Handle: RePEc:spr:pubtra:v:17:y:2025:i:1:d:10.1007_s12469-024-00370-x
    DOI: 10.1007/s12469-024-00370-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12469-024-00370-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12469-024-00370-x?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. Masood Jafari Kang & Shervin Ataeian & S. M. Mahdi Amiripour, 2021. "A procedure for public transit OD matrix generation using smart card transaction data," Public Transport, Springer, vol. 13(1), pages 81-100, March.
    2. Zhenbao Wang & Sicheng Wang & Haitao Lian, 2021. "A route-planning method for long-distance commuter express bus service based on OD estimation from mobile phone location data: the case of the Changping Corridor in Beijing," Public Transport, Springer, vol. 13(1), pages 101-125, March.
    3. Felipe Zúñiga & Juan Carlos Muñoz & Ricardo Giesen, 2021. "Estimation and prediction of dynamic matrix travel on a public transport corridor using historical data and real-time information," Public Transport, Springer, vol. 13(1), pages 59-80, March.
    4. Zwick, Felix & Axhausen, Kay W., 2022. "Ride-pooling demand prediction: A spatiotemporal assessment in Germany," Journal of Transport Geography, Elsevier, vol. 100(C).
    5. Tang, Jinjun & Liu, Fang & Wang, Yinhai & Wang, Hua, 2015. "Uncovering urban human mobility from large scale taxi GPS data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 438(C), pages 140-153.
    6. Karthik Devarajan, 2008. "Nonnegative Matrix Factorization: An Analytical and Interpretive Tool in Computational Biology," PLOS Computational Biology, Public Library of Science, vol. 4(7), pages 1-12, July.
    7. Daniel D. Lee & H. Sebastian Seung, 1999. "Learning the parts of objects by non-negative matrix factorization," Nature, Nature, vol. 401(6755), pages 788-791, October.
    8. Berry, Michael W. & Browne, Murray & Langville, Amy N. & Pauca, V. Paul & Plemmons, Robert J., 2007. "Algorithms and applications for approximate nonnegative matrix factorization," Computational Statistics & Data Analysis, Elsevier, vol. 52(1), pages 155-173, September.
    9. 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.
    10. Spiess, Heinz, 1987. "A maximum likelihood model for estimating origin-destination matrices," Transportation Research Part B: Methodological, Elsevier, vol. 21(5), pages 395-412, October.
    11. Liping Ge & Malek Sarhani & Stefan Voß & Lin Xie, 2021. "Review of Transit Data Sources: Potentials, Challenges and Complementarity," Sustainability, MDPI, vol. 13(20), pages 1-37, October.
    12. Cecilia Viggiano & Haris N. Koutsopoulos & Nigel H. M. Wilson & John Attanucci, 2017. "Journey-based characterization of multi-modal public transportation networks," Public Transport, Springer, vol. 9(1), pages 437-461, July.
    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. Jingu Kim & Yunlong He & Haesun Park, 2014. "Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework," Journal of Global Optimization, Springer, vol. 58(2), pages 285-319, February.
    2. M. Moghadam & K. Aminian & M. Asghari & M. Parnianpour, 2013. "How well do the muscular synergies extracted via non-negative matrix factorisation explain the variation of torque at shoulder joint?," Computer Methods in Biomechanics and Biomedical Engineering, Taylor & Francis Journals, vol. 16(3), pages 291-301.
    3. Paul Fogel & Yann Gaston-Mathé & Douglas Hawkins & Fajwel Fogel & George Luta & S. Stanley Young, 2016. "Applications of a Novel Clustering Approach Using Non-Negative Matrix Factorization to Environmental Research in Public Health," IJERPH, MDPI, vol. 13(5), pages 1-14, May.
    4. Jianfei Cao & Han Yang & Jianshu Lv & Quanyuan Wu & Baolei Zhang, 2023. "Estimating Soil Salinity with Different Levels of Vegetation Cover by Using Hyperspectral and Non-Negative Matrix Factorization Algorithm," IJERPH, MDPI, vol. 20(4), pages 1-15, February.
    5. Takehiro Sano & Tsuyoshi Migita & Norikazu Takahashi, 2022. "A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence," Journal of Global Optimization, Springer, vol. 84(3), pages 755-781, November.
    6. 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.
    7. Duy Khuong Nguyen & Tu Bao Ho, 2017. "Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization," Journal of Global Optimization, Springer, vol. 68(2), pages 307-328, June.
    8. GILLIS, Nicolas & GLINEUR, François, 2011. "Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization," LIDAM Discussion Papers CORE 2011030, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Yoshi FUJIWARA & Hiroyasu INOUE & Takayuki YAMAGUCHI & Hideaki AOYAMA & Takuma TANAKA & Kentaro KIKUCHI, 2021. "Money Flow Network Among Firms' Accounts in a Regional Bank of Japan," Discussion papers 21005, Research Institute of Economy, Trade and Industry (RIETI).
    10. Flavia Esposito, 2021. "A Review on Initialization Methods for Nonnegative Matrix Factorization: Towards Omics Data Experiments," Mathematics, MDPI, vol. 9(9), pages 1-17, April.
    11. Michel Bierlaire & Frank Crittin, 2006. "Solving Noisy, Large-Scale Fixed-Point Problems and Systems of Nonlinear Equations," Transportation Science, INFORMS, vol. 40(1), pages 44-63, February.
    12. Bastian Schaefermeier & Gerd Stumme & Tom Hanika, 2021. "Topic space trajectories," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(7), pages 5759-5795, July.
    13. Hazelton, Martin L., 2001. "Inference for origin-destination matrices: estimation, prediction and reconstruction," Transportation Research Part B: Methodological, Elsevier, vol. 35(7), pages 667-676, August.
    14. Yoshi Fujiwara & Rubaiyat Islam, 2021. "Bitcoin's Crypto Flow Network," Papers 2106.11446, arXiv.org, revised Jul 2021.
    15. Yin Liu & Sam Davanloo Tajbakhsh, 2023. "Stochastic Composition Optimization of Functions Without Lipschitz Continuous Gradient," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 239-289, July.
    16. Hiroyasu Abe & Hiroshi Yadohisa, 2019. "Orthogonal nonnegative matrix tri-factorization based on Tweedie distributions," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 13(4), pages 825-853, December.
    17. Benedetto Barabino & Mauro Coni & Massimo Francesco & Andrea Obino & Roberto Ventura, 2024. "Origin–destination matrices from smartphone apps for bus networks," Public Transport, Springer, vol. 16(2), pages 505-549, June.
    18. Seungkyu Ryu, 2020. "A Bicycle Origin–Destination Matrix Estimation Based on a Two-Stage Procedure," Sustainability, MDPI, vol. 12(7), pages 1-14, April.
    19. GILLIS, Nicolas & GLINEUR, François, 2008. "Nonnegative factorization and the maximum edge biclique problem," LIDAM Discussion Papers CORE 2008064, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. Guowei Yang & Lin Zhang & Minghua Wan, 2022. "Exponential Graph Regularized Non-Negative Low-Rank Factorization for Robust Latent Representation," Mathematics, MDPI, vol. 10(22), pages 1-20, November.

    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:spr:pubtra:v:17:y:2025:i:1:d:10.1007_s12469-024-00370-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.