Jason Powell, Yan Huang, Favyen Bastani and Minhe Ji Department of Computer Science and Engineering University of North Texas And Department of Geography.

Slides:



Advertisements
Similar presentations
15th CTI Workshop, July 26, Smart Itinerary Recommendation based on User-Generated GPS Trajectories Hyoseok Yoon 1, Y. Zheng 2, X. Xie 2 and W.
Advertisements

Proactive Traffic Merging Strategies for Sensor-Enabled Cars
Mining User Similarity Based on Location History Yu Zheng, Quannan Li, Xing Xie Microsoft Research Asia.
ADAPTIVE FASTEST PATH COMPUTATION ON A ROAD NETWORK: A TRAFFIC MINING APPROACH Hector Gonzalez, Jiawei Han, Xiaolei Li, Margaret Myslinska, John Paul Sondag.
An Interactive-Voting Based Map Matching Algorithm
Driving with Knowledge from the Physical World Jing Yuan, Yu Zheng Microsoft Research Asia.
Urban Computing with Taxicabs
Dynamic Programming In this handout A shortest path example
Yu Stephanie Sun 1, Lei Xie 1, Qi Alfred Chen 2, Sanglu Lu 1, Daoxu Chen 1 1 State Key Laboratory for Novel Software Technology, Nanjing University, China.
Smarter Outlier Detection and Deeper Understanding of Large-Scale Taxi Trip Records: A Case Study of NYC Jianting Zhang Department of Computer Science.
Constructing Popular Routes from Uncertain Trajectories Ling-Yin Wei 1, Yu Zheng 2, Wen-Chih Peng 1 1 National Chiao Tung University, Taiwan 2 Microsoft.
Critical Analysis Presentation: T-Drive: Driving Directions based on Taxi Trajectories Authors of Paper: Jing Yuan, Yu Zheng, Chengyang Zhang, Weilei Xie,
T-Drive : Driving Directions Based on Taxi Trajectories Microsoft Research Asia University of North Texas Jing Yuan, Yu Zheng, Chengyang Zhang, Xing Xie,
University of Minho School of Engineering Centre Algoritmi Uma Escola a Reinventar o Futuro – Semana da Escola de Engenharia - 24 a 27 de Outubro de 2011.
1 Chapter 12: Decision-Support Systems for Supply Chain Management CASE: Supply Chain Management Smooths Production Flow Prepared by Hoon Lee Date on 14.
February 9, 2006TransNow Student Conference Using Ground Truth Geospatial Data to Validate Advanced Traveler Information Systems Freeway Travel Time Messages.
11 Quantifying Benefits of Traffic Information Provision under Stochastic Demand and Capacity Conditions: A Multi-day Traffic Equilibrium Approach Mingxin.
May 2009 Evaluation of Time-of- Day Fare Changes for Washington State Ferries Prepared for: TRB Transportation Planning Applications Conference.
Exploiting Geographic Dependencies for Real Estate Appraisal Yanjie Fu Joint work with Hui Xiong, Yu Zheng, Yong Ge, Zhihua Zhou, Zijun Yao Rutgers, the.
Reducing Uncertainty of Low-sampling-rate Trajectories Kai Zheng, Yu Zheng, Xing Xie, Xiaofang Zhou University of Queensland & Microsoft Research Asia.
MAP BASED ROUTING IN LARGE SCALE URBAN VEHICLE NETWORKS.
Applied Transportation Analysis ITS Application SCATS.
Temporal Event Map Construction For Event Search Qing Li Department of Computer Science City University of Hong Kong.
Assigning User Class Link and Route Flows Uniquely to Urban Road Networks ______________________________________________________________________________.
May 7, 2013 Yagnesh Jarmarwala Phani Jammalamadaka Michael Copeland Maneesh Mahlawat 14 th TRB National Transportation Planning Applications Conference.
Personalization in Local Search Personalization of Content Ranking in the Context of Local Search Philip O’Brien, Xiao Luo, Tony Abou-Assaleh, Weizheng.
Transit Estimation and Mode Split CE 451/551 Source: NHI course on Travel Demand Forecasting (152054A) Session 7.
1 Data Mining Books: 1.Data Mining, 1996 Pieter Adriaans and Dolf Zantinge Addison-Wesley 2.Discovering Data Mining, 1997 From Concept to Implementation.
Bei Pan (Penny), University of Southern California
Discovering Regions of Different Functions in a City Using Human Mobility and POIs Presented by Ivan Chiou Jing Yuan Microsoft Research Asia
Mirco Nanni, Roberto Trasarti, Giulio Rossetti, Dino Pedreschi Efficient distributed computation of human mobility aggregates through user mobility profiles.
Mining Interesting Locations and Travel Sequences from GPS Trajectories IDB & IDS Lab. Seminar Summer 2009 강 민 석강 민 석 July 23 rd,
Wen He Tsinhua University, Beijing, China and Xi'an Communication Institute, Xi'an, China Deyi Li Tsinhua University, Beijing, China and Chinese.
Optimizing Hybrid Vehicles via Route Prediction jon froehlich & john krumm HCI Intern Talk July 26 th, 2007.
Systems Engineering for the Transportation Critical Infrastructure The Development of a Methodology and Mathematical Model for Assessing the Impacts of.
Methodology for the Use of Regional Planning Models to Assess Impact of Various Congestion Pricing Strategies Sub-network Extraction A sub-network focusing.
Highway Risk Mitigation through Systems Engineering.
January 23, 2006Transportation Research Board 85 th Annual Meeting Using Ground Truth Geospatial Data to Validate Advanced Traveler Information Systems.
Preserving Privacy in GPS Traces via Uncertainty- Aware Path Cloaking Baik Hoh, Marco Gruteser, Hui Xiong, Ansaf Alrabady Presented by Joseph T. Meyerowitz.
August 30, 2004STDBM 2004 at Toronto Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets Yoshiharu Ishikawa Yuichi Tsukamoto Hiroyuki.
How far people are willing to walk to public transport? A case study in Munich City Walk21,Vienna Rumana Islam Sarker Research Assistant, Institute.
Key Partners Key Activities Value Proposition Customer Relationships Customer Segments Drivers Phone Company Taking calls Scheduling Convenience Safety.
Intelligent DataBase System Lab, NCKU, Taiwan Josh Jia-Ching Ying 1, Wang-Chien Lee 2, Tz-Chiao Weng 1 and Vincent S. Tseng 1 1 Department of Computer.
DISSECTING REGIONAL WEATHER-TRAFFIC SENSITIVITY THROUGHOUT A CITY Ye Ding 1, Yanhua Li 2, Ke Deng 3, Haoyu Tan 1, Mingxuan Yuan 4, Lionel M. Ni 5 1 Guangzhou.
Trajectory Data Mining Dr. Yu Zheng Lead Researcher, Microsoft Research Chair Professor at Shanghai Jiao Tong University Editor-in-Chief of ACM Trans.
Trajectory Data Mining Dr. Yu Zheng Lead Researcher, Microsoft Research Chair Professor at Shanghai Jiao Tong University Editor-in-Chief of ACM Trans.
Trajectory Data Mining Dr. Yu Zheng Lead Researcher, Microsoft Research Chair Professor at Shanghai Jiao Tong University Editor-in-Chief of ACM Trans.
Trajectory Data Mining
Trends: Spatio-temporal graphs Introduction to Spatial Computing.
Trajectory Data Mining
Real-time Bus Information on Mobile Devices Stuart D. Maclean, Daniel J. Dailey ITS Research Program University of Washington, Seattle, WA.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Congestion.
Highway Risk Mitigation through Systems Engineering.
September 2008What’s coming in Aimsun: New features and model developments 1 Hybrid Mesoscopic-Microscopic Traffic Simulation Framework Alex Torday, Jordi.
Database Laboratory TaeHoon Kim. /18 Work Progress.
ParkNet: Drive-by Sensing of Road-Side Parking Statistics Irfan Ullah Department of Information and Communication Engineering Myongji university, Yongin,
Privacy Vulnerability of Published Anonymous Mobility Traces Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip (Purdue University) Nageswara S. V. Rao (Oak.
Introduction In modern age Geographic Information systems (GIS) has emerged as one of the powerful means to efficiently manage and integrate numerous types.
Traffic Models Alaa Hleihel Daniel Mishne /32.
Presented by: Mi Tian, Deepan Sanghavi, Dhaval Dholakia
T-Share: A Large-Scale Dynamic Taxi Ridesharing Service
Eick: Introduction Machine Learning
Mining Spatio-Temporal Reachable Regions over Massive Trajectory Data
Clustering Uncertain Taxi data
The Rich and the Poor: A Markov Decision Process Approach to Optimizing Taxi Driver Revenue Efficiency Huigui Rong, Xun Zhou, Chang Yang, Zubair Shafiq,
Yongli Zhang and Christoph F. Eick University of Houston, USA
Showcasing work by Jing Yuan, Yu Zheng, Xing Xie, Guangzhou Sun
Efficient Cache-Supported Path Planning on Roads
Christoph F. Eick: A Gentle Introduction to Machine Learning
Visually Analyzing Latent Accessibility Clusters of Urban POIs
Presentation transcript:

Jason Powell, Yan Huang, Favyen Bastani and Minhe Ji Department of Computer Science and Engineering University of North Texas And Department of Geography East China Normal University

Agenda  Introduction  Contributions  Related Work  STP Map Methodology  Shanghai Taxi Case Study  Validation  Future Work  Conclusion 2 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

Introduction  Taxicab service provides a vital role in public transportation  Higher transportation costs, lower budgets  Live miles – miles with a customer  Cruising miles – miles without a customer  35-60% of time is cruising miles  Cruising taxi service does not lend itself to systematic routing 3 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

Introduction  Problem: How to simultaneously reduce cruising miles while increasing live miles without systematic routing.  Solution: The Spatio-Temporal Profitability (STP) Maps Framework  Uses taxi driver experiences through historical taxicab GPS data to find profitable locations  Assigns profitability scores to the locations  Personalized it to the taxi using location and time Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps 4

Contributions  A framework that uses historical GPS data to model potential profitability given current location and time.  A framework that provides personalized suggestions to taxi drivers.  A demonstration of effectiveness and validation using Shanghai taxicab GPS traces. Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps 5

Related Work  Two categories of taxi service  Dispatching – specified locations given ahead of time  Cruising – travel the road network looking for a fare  Research commonly involves routing but not profitability  2008: Yamamoto, et al. – dynamic routing and path sharing among taxicabs  2009: Wang – Shift Match Algorithms to reduce cruising time during dispatch service  2010: Yuan, et al. – Fastest routes based on historical GPS trajectories  2010: Ge, et al. – Probability route suggestions 6 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

STP Map Methodology  Conceptual Overview  Current location and time are parameters for querying historical data  The data becomes profitability scores for locations around the taxicab  The profitability scores are assembled into an STP Map and given to the taxicab driver 7 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

STP Map Methodology  Define a region M around the taxi’s location for short-term planning  Divide the region into cells  Assign a profitability score to each cell  Assemble the cells into a map  Provide the map to the taxicab driver  Repeat at the beginning of each cruise trip 8 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

STP Map Methodology  Profitability score  Base on a generalized taxi fare formula  Converted to time since time represents profit  Inherently captures probability  Considers costs associated with reaching the cell Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps 9

STP Map Methodology  Delayed Experience Window (DEW)  A window of historical data for a cell  Begins when the taxicab will reach a cell  Should be a reasonable size  Too large – includes data not representative of the period  Too small – does not include enough data Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps 10

Shanghai Taxi Case Study  Shanghai – 45,000+ taxis, 150 taxi companies  Complete dataset  May 29, 2009, 12am – 6pm  17,139 taxis, 3 companies  million GPS records  468,000 live trips  Experimental data subset  First company – 7,226 taxis  Region limited to ° N, ° E  Trips between 5 minutes and 3 hours  144,000+ live trips, 143,000+ cruising trips Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps 11 A data set? A set of Datas.

Shanghai Taxi Case Study  Downtown Shanghai, 1pm, M = 67.2 km 2, 60 minute DEW, meter cell length 12 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps STP MapLive Trip CountsLive Trip Probability

Shanghai Taxi Case Study  Each taxi receives a unique STP Map Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps 13 STP Map 1STP Map 2 Over lapping regions of two taxis at different locations but same times.

Shanghai Taxi Case Study 14 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

Validation  STP Map correlation with actual profitability  Assume taxi drivers cruise towards highly profitable locations  If true, ending locations of cruising trips are highly profitable locations  Therefore, if these locations correlate to our STP maps, then the STP maps correctly suggest profitable locations 15 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

Validation  Five subsets with taxis per set  At least 19 trips per taxi  Followed their paths throughout the day  Generated an STP maps for each cruise trip  Started with 15 minute DEW, 15.8 km 2, 95-meter  Hit Profit – Sum of profitability scores of locations at the end of cruising trips  Compared Hit Profit to Live Time/Total Time Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps 16

Validation – Results 17 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps Example correlation results using cell size 190x190 m 2 with a 30-minute DEW that shows the upward trend in correlation between actual profitability and the STP Maps

Future Work  Using temporal patterns to adjust parameters  Use alternatives to Manhattan and Euclidean distances  Use the road network, current traffic conditions, and obstacles, and/or common taxi paths  Create profitability routes using a series of STP maps  Fully develop a real-time system for taxicabs 18 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

Conclusion  Taxicab service is inefficient and routing is difficult  STP Map framework  Suggests profitable locations  Does not require routing  Uses historical spatio-temporal data  Customized to the taxicab  Demonstrated with Shanghai Taxis  Validated through correlation with actual profitability 19 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

References [1] Schaller Consulting: The New York City Taxicab Fact Book, Schaller Consulting, Brooklyn, NY, 2006, available at [2] Yamamoto, K., Uesugi, K., and Watanabe, T.: Adaptive Routing of Cruising Taxis by Mutual Exchange of Pathways, Knowledge-Based Intelligent Information and Engineering Systems, 5178 (2008) 559– 566 [3] Li, Q., Zeng Z., Bisheng, Y., and Zhang, T.: Hierarchical route planning based on taxi GPS-trajectories, 17th International Conference on Geoinformatics (Fairfax, 2009), pp. 1–5 [4] Wang, H.: The Strategy of Utilizing Taxi Empty Cruise Time to Solve the Short Distance Trip Problem, Masters Thesis, The University of Melbourne, 2009 [5] Cheng, S. and Qu, X.: A service choice model for optimizing taxi service delivery, 12th International IEEE Conference on Intelligent Transportation Systems, ITSC ’09 (St. Louis, 2009), pp. 1–6 [6] Phithakkitnukoon, S., Veloso, M., Bento, C., Biderman, A., and Ratti, C.: Taxi-aware map: identifying and predicting vacant taxis in the city, Proceedings of the First international joint conference on Ambient intelligence, AmI’10 (Malaga, 2010), pp. 86–95 [7] Hong-Cheng, G., Xin, Y., and Qing, W.: Investigating the effect of travel time variability on drivers’ route choice decisions in Shanghai, China, Transportation Planning and Technology, 33 (2010) 657– 669 [8] Li, Y., Miller, M.A., and Cassidy, M.J., Improving Mobility Through Enhanced Transit Services: Transit Taxi Service for Areas with Low Passenger Demand Density, University of California, Berkeley and California Department of Transportation, [9] Cooper, J., Farrell, S., and Simpson, P.: Identifying Demand and Optimal Location for Taxi Ranks in a Liberalized Market, Transportation Research Board 89th Annual Meeting (2010) 20 Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps

References [10] Sirisoma, R.M.N.T., Wong, S.C., Lam, W.H.K., Wang, D., Yan, H., and Zhang, P.: Empirical evidence for taxi customer-search model, Transportation Research Board 88th Annual Meeting, 163 (2009) 203–210 [11] Yang, H., Fung, C.S., Wong, K.I., Wong, S.C.: Nonlinear pricing of taxi services, Transportation Research Part A: Policy and Practice, 44 (2010) 337–348 [12] Chintakayala, P., and Maitra, B., Modeling Generalized Cost of Travel and Its Application for Improvement of Taxies in Kolkata, Journal of Urban Planning and Development, 136 (2010) 42–49 [13] Wikipedia, Shanghai — Wikipedia, The Free Encyclopedia, 2011, Online; accessed 21-May-2011, [14] TravelChinaGuide.com, Get Around Shanghai by Taxi, Shanghai Transportation, 2011, Online; accessed 9-February-2011, [15] Shanghai Taxi Cab Rates and Companies, Kuber, 2011, Online; accessed 9-February-2011, [16] Yuan, Jing and Zheng, Yu and Zhang, Chengyang and Xie, Wenlei and Xie, Xing and Sun, Guangzhong and Huang, Yan, T-drive: driving directions based on taxi trajectories, Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS ’10 (San Jose, 2010), pp. 99–108 [17] Ge, Yong and Xiong, Hui and Tuzhilin, Alexander and Xiao, Keli and Gruteser, Marco and Pazzani, Michael, An energy-efficient mobile recommender system, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD ’10 (Washington, DC, 2010), pp. 899– Towards Reducing Taxicab Cruising Time Using Spatio-Temporal Profitability Maps