Name
Title | ||
|---|---|---|
A Sequential Clustering Method for the Taxi-Dispatching Problem Considering Traffic Dynamics |
Abstract | ||
|---|---|---|
Taxis are an important transportation mode in many cities due to their convenience and accessibility. In the taxi-dispatching problem, sometimes it is more beneficial for the supplier if taxis cruise in the network after serving the first request to pick up the next passenger, while sometimes it is better that they wait in stations for new trip requests. In this article, we propose a rolling-horizon scheme that dynamically optimizes taxi dispatching considering the actual traffic conditions. To optimize passenger satisfaction, we define a limitation for passenger waiting time. To be able to apply the method to large-scale networks, we introduce a clustering-based technique that can significantly improve the computation time without harming the solution quality. Finally, we test our method on a real test case considering taxi requests with personal car trips to reproduce actual network loading and unloading congestion during peak hours. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/MITS.2020.3014444 | IEEE Intelligent Transportation Systems Magazine |
Keywords | DocType | Volume |
sequential clustering method,taxi-dispatching problem,traffic dynamics,transportation mode,trip requests,taxi dispatching,traffic conditions,passenger satisfaction,passenger waiting time,clustering-based technique,taxi requests,network loading,unloading congestion,rolling-horizon scheme,dynamic taxi dispatching optimization,personal car trips | Journal | 12 |
Issue | ISSN | Citations |
4 | 1939-1390 | 0 |
PageRank | References | Authors |
0.34 | 23 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Negin Alisoltani | 1 | 0 | 0.34 |
| Mahdi Zargayouna | 2 | 46 | 14.87 |
| Ludovic Leclercq | 3 | 20 | 8.76 |