Time-optimal and privacy preserving route planning for carpool policy

19Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

To alleviate the traffic congestion caused by the sharp increase in the number of private cars and save commuting costs, taxi carpooling service has become the choice of many people. Current research on taxi carpooling services has focused on shortening the detour distances. While with the development of intelligent cities, efficiently match passengers and vehicles and planning routes become urgent. And the privacy between passengers in the taxi carpooling service also needs to be considered. In this paper, we propose a time-optimal and privacy-preserving carpool route planning system via deep reinforcement learning. This system uses the traffic information around the carpooling vehicle to optimize passengers’ travel time, not only to efficiently match passengers and vehicles but also to generate detailed route planning for carpooling vehicles. We conducted experiments on an Internet of Vehicles simulator CARLA, and the results demonstrate that our method is better than other advanced methods and has better performance in complex environments.

Cite

CITATION STYLE

APA

Zhu, C., Ye, D., Zhu, T., & Zhou, W. (2022). Time-optimal and privacy preserving route planning for carpool policy. World Wide Web, 25(3), 1151–1168. https://doi.org/10.1007/s11280-022-01026-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free