… On the other hand, the experienced taxi driver may not be familiar with one entire big …
cruising route to help taxi drivers find their next passengers in this paper. We not only want the taxi …

… the best route … cruising routes to more than one taxi driver in a small-scale region to the
neighboring pick-up locations. For example, using our method, taxi driver A determined one route …

… For example, [9] revealed that taxi drivers’ local search decisions are significantly affected
… the search route. In the simulation of taxi drivers’ routing choices, [10] accounted for drivers’ …

… have the characteristics of learning, which means that they will update their traffic information
from their day-to-day experience and use the information in route choice of the next trip [5, 6…

… , without systematic routing. This paper … routing. This paper presents a simple yet practical
method for suggesting profitable locations that enable taxicab drivers to reduce cruising miles. …

… , to let taxicab drivers find passengers with a cruising route based … cruising graph, to capture
key ingredients of a taxicab’s … cruising process to select cruising routes for taxicab drivers to …

… , we propose a cruising system, pCruise, for taxicab drivers to … optimal route to pick up a
passenger, thus reducing the cruising … cruising process to select the optimal cruising routes for …

… 2) To find the optimal route for a target taxi driver, we design a data structure Path-Search-Tree
(PS-Tree). Based on the monotonicity of the PCD model, a pruning algorithm to speed up …

… decision planner, where S means the starting location of the taxi driver and R means the
location of the reservation. Our route planning aims to recommend cruising locations for taxi …

… on Shanghai taxi dataset. We identify drivers that wait at airport terminals and those cruise to
seek … from trajectory data, but we focus on using them to recommend routes for taxi drivers. …