Zobraziť v EDS

PRO-MTL: Parameterized Route Optimization Using Multi-Task Learning.

Uložené v:
Podrobná bibliografia
Názov: PRO-MTL: Parameterized Route Optimization Using Multi-Task Learning.
Autori: VYAS, JAYANT, BUDHWANI, JAYESH, DAS, DEBASIS
Zdroj: ACM Transactions on Intelligent Systems & Technology; Jun2025, Vol. 16 Issue 3, p1-23, 23p
Predmety: LONG short-term memory, TRAVEL time (Traffic engineering), TRAFFIC patterns, RIDESHARING services, SOURCE code, DEMAND forecasting
Abstrakt: In the current ridesharing scenario, finding a compatible passenger is highly challenging and largely dependent on chance. Existing algorithms prioritize the shortest route without considering future requests or traffic conditions, which reduces the likelihood of matching with another compatible passenger. This uncertainty leads to increased congestion along shortest routes and fewer ridesharing trips overall. This article proposes a route recommendation strategy that goes beyond the shortest route, aiming to address these issues. The proposed strategy results in higher demand, reduced congestion, broader coverage of points of interest, and an increased probability of finding compatible passengers during a trip. To achieve this, we introduce a time-series forecasting method leveraging a multi-task long short-term memory model to predict demand and traffic patterns in city-zone neighborhoods. These predictions are then used to recommend optimized routes. To evaluate our approach, we tested it on three datasets containing trip and traffic details from New York City, Los Angeles, and Shenzhen. Our model demonstrated 96% accuracy and a 2% RMSE loss in predicting the expected number of passengers. Furthermore, during route recommendations, we observed a 23% increase in passenger count for 97% of trips and a reduction in travel time for the shortest path for 60% of trips. In light of the above experimentation, we believe that while our approach recommends a longer route than the shortest one (for 40% of cases), it helps taxi drivers find compatible passengers on most trips which increases the profit of ridesharing services, and reduces the waiting time for passengers. The source code and dataset used in the paper is available at: https://github.com/vanetlabiitj/PRO-MTL.git [ABSTRACT FROM AUTHOR]
Copyright of ACM Transactions on Intelligent Systems & Technology is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáza: Complementary Index
Popis
Abstrakt:In the current ridesharing scenario, finding a compatible passenger is highly challenging and largely dependent on chance. Existing algorithms prioritize the shortest route without considering future requests or traffic conditions, which reduces the likelihood of matching with another compatible passenger. This uncertainty leads to increased congestion along shortest routes and fewer ridesharing trips overall. This article proposes a route recommendation strategy that goes beyond the shortest route, aiming to address these issues. The proposed strategy results in higher demand, reduced congestion, broader coverage of points of interest, and an increased probability of finding compatible passengers during a trip. To achieve this, we introduce a time-series forecasting method leveraging a multi-task long short-term memory model to predict demand and traffic patterns in city-zone neighborhoods. These predictions are then used to recommend optimized routes. To evaluate our approach, we tested it on three datasets containing trip and traffic details from New York City, Los Angeles, and Shenzhen. Our model demonstrated 96% accuracy and a 2% RMSE loss in predicting the expected number of passengers. Furthermore, during route recommendations, we observed a 23% increase in passenger count for 97% of trips and a reduction in travel time for the shortest path for 60% of trips. In light of the above experimentation, we believe that while our approach recommends a longer route than the shortest one (for 40% of cases), it helps taxi drivers find compatible passengers on most trips which increases the profit of ridesharing services, and reduces the waiting time for passengers. The source code and dataset used in the paper is available at: https://github.com/vanetlabiitj/PRO-MTL.git [ABSTRACT FROM AUTHOR]
ISSN:21576904
DOI:10.1145/3718092