Estimating Time of Driver Arrival with Gradient Boosting Algorithms and Deep Neural Networks
Author(s) -
Henrik Sergoyan
Publication year - 2020
Publication title -
mathematical problems of computer science
Language(s) - English
Resource type - Journals
eISSN - 2738-2788
pISSN - 2579-2784
DOI - 10.51408/1963-0050
Subject(s) - computer science , boosting (machine learning) , artificial neural network , algorithm , task (project management) , gradient boosting , mean squared error , service (business) , routing algorithm , machine learning , routing (electronic design automation) , artificial intelligence , data mining , computer network , engineering , routing protocol , mathematics , statistics , economy , systems engineering , random forest , economics
Customer experience and resource management determine the degree to which transportation service providers can compete in today’s heavily saturated markets. The paper investigates and suggests a new methodology to optimize calculations for Estimated Time of Arrival (from now on ETA, meaning the time it will take for the driver to reach the designated location) based on the data provided by GG collected from rides made in 2018. GG is a transportation service providing company, and it currently uses The Open Source Routing Machine (OSRM) which exhibits significant errors in the prediction phase. This paper shows that implementing algorithms such as XGBoost, CatBoost, and Neural Networks for the said task will improve the accuracy of estimation. Paper discusses the benefits and drawbacks of each model and then considers the performance of the stacking algorithm that combines several models into one. Thus, using those techniques, final results showed that Mean Squared Error (MSE) was decreased by 54% compared to the current GG model.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom