Zone pAth Construction (ZAC) based Approaches for Effective Real-Time Ridesharing
暂无分享,去创建一个
Patrick Jaillet | Pradeep Varakantham | Meghna Lowalekar | Patrick Jaillet | Pradeep Varakantham | Meghna Lowalekar
[1] Chinmoy Dutta,et al. When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing , 2018, AAAI.
[2] Pascal Van Hentenryck,et al. Community-Based Trip Sharing for Urban Commuting , 2018, AAAI.
[3] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .
[4] Richard F. Hartl,et al. A survey on dynamic and stochastic vehicle routing problems , 2016 .
[5] D. Norman. THE PSYCHOLOGY OF WAITING LINES , 2008 .
[6] Michael Lees,et al. A Partition-Based Match Making Algorithm for Dynamic Ridesharing , 2015, IEEE Transactions on Intelligent Transportation Systems.
[7] Yang Cao,et al. The Data and Science behind GrabShare Carpooling , 2017, 2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA).
[8] Emilio Frazzoli,et al. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment , 2017, Proceedings of the National Academy of Sciences.
[9] Jieping Ye,et al. A Unified Approach to Route Planning for Shared Mobility , 2018, Proc. VLDB Endow..
[10] Javier Alonso-Mora,et al. Predictive routing for autonomous mobility-on-demand systems with ride-sharing , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).
[11] Lior Rokach,et al. Data Mining And Knowledge Discovery Handbook , 2005 .
[12] Alan J. Hoffman,et al. Integral Boundary Points of Convex Polyhedra , 2010, 50 Years of Integer Programming.
[13] Geoff Boeing,et al. OSMnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks , 2016, Comput. Environ. Urban Syst..
[14] Bernd H. Schmitt,et al. Consumers' Reactions to Waiting: When Delays Affect the Perception of Service Quality , 1989 .
[15] Paolo Santi,et al. Supporting Information for Quantifying the Benefits of Vehicle Pooling with Shareability Networks Data Set and Pre-processing , 2022 .
[16] Gilbert Laporte,et al. Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.
[17] Siqian Shen,et al. An Integrated Decomposition and Approximate Dynamic Programming Approach for On-Demand Ride Pooling , 2020, IEEE Transactions on Intelligent Transportation Systems.
[18] Leen Stougie,et al. Online multi-server dial-a-ride problems , 2006 .
[19] Pradeep Varakantham,et al. Neural Approximate Dynamic Programming for On-Demand Ride-Pooling , 2019, AAAI.
[20] Zhe Xu,et al. Efficient Large-Scale Fleet Management via Multi-Agent Deep Reinforcement Learning , 2018, KDD.
[21] Lei Chen,et al. Utility-Aware Ridesharing on Road Networks , 2017, SIGMOD Conference.
[22] Niels A. H. Agatz,et al. The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .
[23] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[24] Leen Stougie,et al. On-Line Dial-a-Ride Problems under a Restricted Information Model , 2002, ESA.
[25] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[26] Jieping Ye,et al. Order Dispatch in Price-aware Ridesharing , 2018, Proc. VLDB Endow..
[27] Leen Stougie,et al. On-line single-server dial-a-ride problems , 2001, Theor. Comput. Sci..
[28] Yu Zheng,et al. T-share: A large-scale dynamic taxi ridesharing service , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).
[29] Jian Yang,et al. Real-Time Multivehicle Truckload Pickup and Delivery Problems , 2004, Transp. Sci..
[30] Zhe Xu,et al. Large-Scale Order Dispatch in On-Demand Ride-Hailing Platforms: A Learning and Planning Approach , 2018, KDD.
[31] Jean-François Cordeau,et al. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..
[32] Ruoming Jin,et al. Large Scale Real-time Ridesharing with Service Guarantee on Road Networks , 2014, Proc. VLDB Endow..
[33] Patrick Jaillet,et al. Online Spatio-Temporal Matching in Stochastic and Dynamic Domains , 2016, AAAI.
[34] Patrick Jaillet,et al. Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications , 2019, Oper. Res..
[35] Richard C. Larson,et al. Queues in Service Systems: Some Unusual Applications , 2018, Handbook of Service Science, Volume II.
[36] Warren B. Powell,et al. An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application , 2009, Transp. Sci..
[37] Patrick Jaillet,et al. ZAC: A Zone Path Construction Approach for Effective Real-Time Ridesharing , 2019, ICAPS.
[38] Yunjun Gao,et al. PTRider: A Price-and-Time-Aware Ridesharing System , 2018, Proc. VLDB Endow..
[39] Chinmoy Dutta. When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing , 2018, ArXiv.
[40] Leen Stougie,et al. On-Line Dial-a-Ride Problems Under a Restricted Information Model , 2004, Algorithmica.
[41] Dominic Widdows,et al. GrabShare: The construction of a realtime ridesharing service , 2017, 2017 2nd IEEE International Conference on Intelligent Transportation Engineering (ICITE).
[42] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[43] James K. Murphy. Benders, Nested Benders and Stochastic Programming: An Intuitive Introduction , 2013, ArXiv.