TY - GEN
T1 - Incremental recommendation system for large-scale taxi fleet in smart cities
AU - Wan, Xiangpeng
AU - Ghazzai, Hakim
AU - Massoud, Yehia
N1 - Generated from Scopus record by KAUST IRTS on 2022-09-13
PY - 2019/9/1
Y1 - 2019/9/1
N2 - Modern urbanization is demanding high-efficiency taxi services to satisfy the request of taxi users as well as the expectation of drivers. Customers desire to wait the minimum time before finding a taxi, while drivers aim to maximize their profits by speeding up their customer hunting. In this paper, we propose to exploit the benefits of vehicular social network by enabling data exchange and more cooperation among regular taxi drivers. The objective is to design a smart recommendation sys-tem allowing drivers to optimize three key performance metrics: number of pickups, customer waiting time, and vacant travel distance. The proposed recommendation starts by efficiently estimating the future customer demands in the different region of interest. Then, it proposes an optimal taxi-to-region matching according to the current location of each taxi and the requested demand. Finally, an optimized routing algorithm is proposed to allow taxi drivers reach their destinations faster. Our simulation model is applied on the borough of Manhattan, NYC, and is validated with realistic data. The selected results show that significant performance gains can be achieved as compared to the traditional scenario.
AB - Modern urbanization is demanding high-efficiency taxi services to satisfy the request of taxi users as well as the expectation of drivers. Customers desire to wait the minimum time before finding a taxi, while drivers aim to maximize their profits by speeding up their customer hunting. In this paper, we propose to exploit the benefits of vehicular social network by enabling data exchange and more cooperation among regular taxi drivers. The objective is to design a smart recommendation sys-tem allowing drivers to optimize three key performance metrics: number of pickups, customer waiting time, and vacant travel distance. The proposed recommendation starts by efficiently estimating the future customer demands in the different region of interest. Then, it proposes an optimal taxi-to-region matching according to the current location of each taxi and the requested demand. Finally, an optimized routing algorithm is proposed to allow taxi drivers reach their destinations faster. Our simulation model is applied on the borough of Manhattan, NYC, and is validated with realistic data. The selected results show that significant performance gains can be achieved as compared to the traditional scenario.
UR - https://ieeexplore.ieee.org/document/8906451/
UR - http://www.scopus.com/inward/record.url?scp=85076415380&partnerID=8YFLogxK
U2 - 10.1109/ICVES.2019.8906451
DO - 10.1109/ICVES.2019.8906451
M3 - Conference contribution
SN - 9781728134734
BT - 2019 IEEE International Conference on Vehicular Electronics and Safety, ICVES 2019
PB - Institute of Electrical and Electronics Engineers Inc.
ER -