SCRAM: A Sharing Considered Route Assignment Mechanism for Fair Taxi Route Recommendations

Recommending routes for a group of competing taxi drivers is almost untouched in most route recommender systems. For this kind of problem, recommendation fairness and driving efficiency are two fundamental aspects. In the paper, we propose SCRAM, a sharing considered route assignment mechanism for fair taxi route recommendations. SCRAM aims to provide recommendation fairness for a group of competing taxi drivers, without sacrificing driving efficiency. By designing a concise route assignment mechanism, SCRAM achieves better recommendation fairness for competing taxis. By considering the sharing of road sections to avoid unnecessary competition, SCRAM is more efficient in terms of driving cost per customer (DCC). We test SCRAM based on a large number of historical taxi trajectories and validate the recommendation fairness and driving efficiency of SCRAM with extensive evaluations. Experimental results show that SCRAM achieves better recommendation fairness and higher driving efficiency than three compared approaches.

[1]  Yu Zheng,et al.  Constructing popular routes from uncertain trajectories , 2012, KDD.

[2]  Jie Cao,et al.  Pick-Up Tree Based Route Recommendation from Taxi Trajectories , 2012, WAIM.

[3]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[4]  Xing Xie,et al.  Where to find my next passenger , 2011, UbiComp '11.

[5]  Jianxun Liu,et al.  Recommending Pick-up Points for Taxi-drivers Based on Spatio-temporal Clustering , 2012, 2012 Second International Conference on Cloud and Green Computing.

[6]  Desheng Zhang,et al.  CallCab: A unified recommendation system for carpooling and regular taxicab services , 2013, 2013 IEEE International Conference on Big Data.

[7]  Minglu Li,et al.  Smart recommendation by mining large-scale GPS traces , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[8]  Siyuan Liu,et al.  HUNTS: A Trajectory Recommendation System for Effective and Efficient Hunting of Taxi Passengers , 2013, 2013 IEEE 14th International Conference on Mobile Data Management.

[9]  Nicholas Jing Yuan,et al.  T-Finder: A Recommender System for Finding Passengers and Vacant Taxis , 2013, IEEE Transactions on Knowledge and Data Engineering.

[10]  Ron Lavi,et al.  Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.

[11]  Hui Xiong,et al.  An energy-efficient mobile recommender system , 2010, KDD.

[12]  S. Boicheva.  Mechanism Design without Money , 2012 .

[13]  Sophie Ahrens,et al.  Recommender Systems , 2012 .

[14]  R. Vohra,et al.  Algorithmic Game Theory: Mechanism Design without Money , 2007 .

[15]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[16]  Gyung-Leen Park,et al.  Analysis of the Passenger Pick-Up Pattern for Taxi Location Recommendation , 2008, 2008 Fourth International Conference on Networked Computing and Advanced Information Management.

[17]  Anoop K. Dhingra,et al.  Mechanism design: Analysis and synthesis: Vol. 1, 2nd edn By A. G. Erdman and G. N. Sandor. Prentice-Hall, Englewood Cliffs, N.J., 1991, xviii + 631 pp , 1993 .

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[19]  Atila Abdulkadiroglu,et al.  School Choice: A Mechanism Design Approach , 2003 .

[20]  Xing Xie,et al.  T-drive: driving directions based on taxi trajectories , 2010, GIS '10.

[21]  Arthur G. Erdman,et al.  Mechanism Design : Analysis and Synthesis , 1984 .