Spatiotemporal Ensemble Modeling for Urban Taxi Travel Time Prediction

Authors

  • Krish Bharucha SVKM’sDwarkadas J Sanghvi College of Engineering, Mumbai, India
  • Jeet Mehta SVKM’sDwarkadas J Sanghvi College of Engineering, Mumbai, India
  • Devarshee Thopte SVKM’sDwarkadas J Sanghvi College of Engineering, Mumbai, India
  • Dhruv Gohil
  • Nilesh Patil SVKM’sDwarkadas J Sanghvi College of Engineering, Mumbai, India

Keywords:

KNN, Decision Tree, Random Forest, Hill Climb, Stacking Ensemble.

Abstract

In this paper, we propose to address the challenge in predicting urban taxi travel time through spatiotemporal ensemble modelling techniques. Accurate travel time prediction is very important not just for planning urban mobility but also for running ridesharing platforms with excellent user experience. We compare a stacking model to a ridge meta-regressor optimised through gradient descent, KNN regressor tuned by hill-climbing, decision tree and random forest.The stacking model emerged as the best, underscoring again the efficacy of ensemble methods in coping with the spatiotemporal complexity of the data. KNN regressors, with their hyperparameters optimised through hill climbing yielded competitive results.Our experimental results show that the ensemble approach, especially the stacking model, generally has much higher performance in prediction than individual models for taxi travel time. This proves that the ensemble approach can effectively work as an alternative way to predict real-time urban transportation system states.

Downloads

Published

2024-02-27

How to Cite

Krish Bharucha, Jeet Mehta, Devarshee Thopte, Dhruv Gohil, & Nilesh Patil. (2024). Spatiotemporal Ensemble Modeling for Urban Taxi Travel Time Prediction. Journal of Computational Analysis and Applications (JoCAAA), 32(1), 439–446. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/1411

Issue

Section

Articles

Similar Articles

<< < 1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.