TY - GEN
T1 - Intelligent distributed customer anticipation approach for taxi routing optimization
AU - Sangtunchai, Pochara
AU - Kim, Kyoung Sook
AU - Kim, Taehoon
AU - Noraset, Thanapon
AU - Tuarob, Suppawong
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/1
Y1 - 2020/1
N2 - The advent of ubiquitous mobile computing technology has opened doors for innovative applications that effectively utilize information from IoT devices in a real-time and seamless manner, disrupting many traditional business procedures. A prevalent example of such applications includes on-demand taxi calling services such as Grab and Uber, which have shown to help taxi drivers to reduce the roaming time to search for customers. Regardless of such technology, taxi drivers still have to idly wait until the customers use the application to request taxi services. The ability to accurately predict the customer spawning at a given time could prove crucial in productive taxi roaming. In this paper, we propose a distributed taxi routing optimization approach that aims to suggest each taxi driver to productively roam to areas where the customers are expected to spawn. Specifically, we propose a machine learning model to forecast taxi customer spawning at a given place and time. Then, such a model is used to compute the probability of customer spawning for each road cluster. Finally, a weighted randomization algorithm is used to suggest a taxi driver to travel to a specific region to optimize his search time and to avoid scramble for customers. Our proposed method is validated in the simulation program (COMSET) and compared with the random walk and random destination baselines. The experiment results suggest that our proposed algorithm is effective and yields promising results that overcome both of the baselines.
AB - The advent of ubiquitous mobile computing technology has opened doors for innovative applications that effectively utilize information from IoT devices in a real-time and seamless manner, disrupting many traditional business procedures. A prevalent example of such applications includes on-demand taxi calling services such as Grab and Uber, which have shown to help taxi drivers to reduce the roaming time to search for customers. Regardless of such technology, taxi drivers still have to idly wait until the customers use the application to request taxi services. The ability to accurately predict the customer spawning at a given time could prove crucial in productive taxi roaming. In this paper, we propose a distributed taxi routing optimization approach that aims to suggest each taxi driver to productively roam to areas where the customers are expected to spawn. Specifically, we propose a machine learning model to forecast taxi customer spawning at a given place and time. Then, such a model is used to compute the probability of customer spawning for each road cluster. Finally, a weighted randomization algorithm is used to suggest a taxi driver to travel to a specific region to optimize his search time and to avoid scramble for customers. Our proposed method is validated in the simulation program (COMSET) and compared with the random walk and random destination baselines. The experiment results suggest that our proposed algorithm is effective and yields promising results that overcome both of the baselines.
KW - Mobile Agent
KW - Route Planning
KW - Spatial Networks
KW - Spatio-temporal Data Mining
UR - https://www.scopus.com/pages/publications/85084033790
U2 - 10.1109/KST48564.2020.9059365
DO - 10.1109/KST48564.2020.9059365
M3 - Conference contribution
AN - SCOPUS:85084033790
T3 - KST 2020 - 2020 12th International Conference on Knowledge and Smart Technology
SP - 149
EP - 154
BT - KST 2020 - 2020 12th International Conference on Knowledge and Smart Technology
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 12th International Conference on Knowledge and Smart Technology, KST 2020
Y2 - 29 January 2020 through 1 February 2020
ER -