Utility-Aware Ridesharing on Road Networks
暂无分享,去创建一个
Lei Chen | Hao Xin | Peng Cheng | Lei Chen | Peng Cheng | Hao Xin
[1] Torben Bach Pedersen,et al. Highly scalable trip grouping for large-scale collective transportation systems , 2008, EDBT '08.
[2] Harilaos N. Psaraftis,et al. A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .
[3] Roberto J. Bayardo,et al. Scaling up all pairs similarity search , 2007, WWW '07.
[4] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[5] Sarit Kraus,et al. Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..
[6] Tanya Y. Berger-Wolf,et al. A framework for analysis of dynamic social networks , 2006, KDD '06.
[7] Ruoming Jin,et al. Large Scale Real-time Ridesharing with Service Guarantee on Road Networks , 2014, Proc. VLDB Endow..
[8] Gilbert Laporte,et al. The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.
[9] Alan Agresti,et al. Categorical Data Analysis , 2003 .
[10] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[11] Prasad Raghavendra,et al. Graph expansion and the unique games conjecture , 2010, STOC '10.
[12] Jan Karel Lenstra,et al. Computer-Aided Complexity Classification of Dial-a-Ride Problems , 2004, INFORMS J. Comput..
[13] Ricardo Fernandes,et al. Empirical evaluation of a dynamic and distributed taxi-sharing system , 2012, 2012 15th International IEEE Conference on Intelligent Transportation Systems.
[14] Michael G. H. Bell,et al. Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints , 2006, Int. Trans. Oper. Res..
[15] M. Newman,et al. Vertex similarity in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[16] Tanya Y. Berger-Wolf,et al. A framework for community identification in dynamic social networks , 2007, KDD '07.
[17] Eric Horvitz,et al. Collaboration and shared plans in the open world: studies of ridesharing , 2009, IJCAI 2009.
[18] Laks V. S. Lakshmanan,et al. On social event organization , 2014, KDD.
[19] Yu Zheng,et al. Real-Time City-Scale Taxi Ridesharing , 2015, IEEE Transactions on Knowledge and Data Engineering.
[20] Vassilis J. Tsotras,et al. Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions , 2010, Proc. VLDB Endow..
[21] Jian Pei,et al. On k-skip shortest paths , 2011, SIGMOD '11.
[22] Jure Leskovec,et al. Friendship and mobility: user movement in location-based social networks , 2011, KDD.
[23] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[24] H. Psaraftis. An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .
[25] Jean-François Cordeau,et al. A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..