Route planning and recommendation have attracted much attention for decades. In this paper, we study a continuous optimal route combination problem: Given a dynamic road network and a stream of trip queries, we continuously find an optimal route combination for each new query batch over the query stream such that the total travel time for all routes is minimized. Each route corresponds to a planning result for a particular trip query in the current query batch. Our problem targets a variety of applications, including traffic-flow management, real-time route planning and continuous congestion prevention. The exact algorithm bears exponential time complexity and is computationally prohibitive for application scenarios in dynamic traffic networks. To address this problem, a self-aware batch processing algorithm is developed in this paper. Extensive experiments offer insight into the accuracy and efficiency of our proposed algorithms.
|Original language||English (US)|
|Title of host publication||Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence|
|Publisher||International Joint Conferences on Artificial Intelligence Organization|
|Number of pages||7|
|State||Published - Aug 2021|
Bibliographical noteKAUST Repository Item: Exported on 2022-03-29
Acknowledgements: Ke Li and Shuo Shang were supported by the NSFC (U2001212, 62032001, and 61932004). Bin Yao was supported by the NSFC (61922054, 61872235, 61832017, and 61729202), and the National Key Research and Development Program of China (2020YFB1710202, and 2018YFC1504504).