DocumentCode
3142671
Title
pCruise: Reducing Cruising Miles for Taxicab Networks
Author
Desheng Zhang ; Tian He
Author_Institution
Dept. of Comput. Sci. & Eng., Univ. of Minnesota, Minneapolis, MN, USA
fYear
2012
fDate
4-7 Dec. 2012
Firstpage
85
Lastpage
94
Abstract
In taxicab industry, a long standing challenge is how to reduce taxicab´s mileage spent without a fare, i.e., cruising mile. The current solution for this challenge usually requires the participation of the passengers. To solve the issue without the passengers involved, in this paper, we propose a cruising system, pCruise, for taxicab drivers to maximize theirs profits by finding the optimal route to pick up a passenger, thus reducing the cruising mile. In pCruise, base on collected GPS records about other near taxicabs, a taxicab characterizes its cruising process with a cruising graph. When a taxicab becomes vacant and tries to find a passenger, cruising graph will provide the shortest cruising route with at least one expected available passengers for this taxicab. With the shortest cruising routes, taxicabs will significantly reduce theirs cruising miles. We evaluate pCruise based on a 7 days 10 GB real world GPS dataset from a city with more than 15,000 taxicabs. The evaluation results show that pCruise can assist taxicab drivers to reduce cruising miles by 41% on average.
Keywords
Global Positioning System; automobiles; driver information systems; graph theory; GPS; cruising graph; cruising mile reduction; optimal route; pCruise; profit maximization; shortest cruising route; taxicab industry; taxicab mileage reduction; taxicab network; Availability; Cities and towns; Dispatching; Global Positioning System; Joining processes; Roads; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems Symposium (RTSS), 2012 IEEE 33rd
Conference_Location
San Jan
ISSN
1052-8725
Print_ISBN
978-1-4673-3098-5
Type
conf
DOI
10.1109/RTSS.2012.61
Filename
6424793
Link To Document