Nonprofit peer-to-peer ridesharing optimization
暂无分享,去创建一个
[1] Praveen Edara,et al. Is Getting an Uber-Lyft from a Sidecar Different from Hailing a Taxi? , 2015 .
[2] François Margot,et al. Symmetry in Integer Linear Programming , 2010, 50 Years of Integer Programming.
[3] Joseph Y. J. Chow,et al. A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers , 2018, Transportation Research Part E: Logistics and Transportation Review.
[4] Martín Matamala,et al. The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method , 2010, Eur. J. Oper. Res..
[5] Jacques Desrosiers,et al. Selected Topics in Column Generation , 2002, Oper. Res..
[6] Bernhard Fleischmann,et al. Dynamic Vehicle Routing Based on Online Traffic Information , 2004, Transp. Sci..
[7] Fabien Lehuédé,et al. An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers , 2011, Transp. Sci..
[8] Stefan Irnich,et al. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks , 2015, Eur. J. Oper. Res..
[9] Emilio Frazzoli,et al. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment , 2017, Proceedings of the National Academy of Sciences.
[10] Jean-François Cordeau,et al. Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints , 2012, OR Spectr..
[11] Pedro M. d'Orey,et al. Can ride-sharing become attractive? A case study of taxi-sharing employing a simulation modelling approach , 2015 .
[12] Martin W. P. Savelsbergh,et al. The General Pickup and Delivery Problem , 1995, Transp. Sci..
[13] Martin W. P. Savelsbergh,et al. Dynamic ridesharing: Is there a role for dedicated drivers? , 2015 .
[14] Roberto Baldacci,et al. An Exact Algorithm for the Pickup and Delivery Problem with Time Windows , 2011, Oper. Res..
[15] Andrea Simonetto,et al. Real-time city-scale ridesharing via linear assignment problems , 2019, Transportation Research Part C: Emerging Technologies.
[16] Jean-François Cordeau,et al. Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines , 2018, Transp. Sci..
[17] Jonathan F. Bard,et al. A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity , 2015, Transp. Sci..
[18] Hajo A. Reijers,et al. The Share-a-Ride Problem: People and parcels sharing taxis , 2014, Eur. J. Oper. Res..
[19] Martin W. P. Savelsbergh,et al. Making dynamic ride-sharing work: The impact of driver and rider flexibility , 2016 .
[20] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[21] 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).
[22] Tolga Bektas,et al. Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows , 2018, Transp. Sci..
[23] David M. Ryan,et al. The train driver recovery problem - A set partitioning based model and solution method , 2010, Comput. Oper. Res..
[24] Mengyang Liu,et al. A branch-and-cut algorithm for a realistic dial-a-ride problem , 2015 .
[25] Gilbert Laporte,et al. The pickup and delivery problem with time windows and handling operations , 2017, Comput. Oper. Res..
[26] Steven M. Thompson,et al. Integrated Block Sharing: A Win-Win Strategy for Hospitals and Surgeons , 2012, Manuf. Serv. Oper. Manag..
[27] Alan L. Erera,et al. Stable Matching for Dynamic Ride-Sharing Systems , 2014 .
[28] Fernando Ordóñez,et al. Ridesharing: The state-of-the-art and future directions , 2013 .
[29] Marc E. Pfetsch,et al. A computational comparison of symmetry handling methods for mixed integer programs , 2019, Math. Program. Comput..
[30] Jacques Desrosiers,et al. The Pickup and Delivery Problem with Time Windows , 1989 .
[31] Xuesong Zhou,et al. Finding Optimal Solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A Dynamic Programming Approach Based on State-space-time Network Representations , 2015, ArXiv.
[32] Niels A. H. Agatz,et al. The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .
[33] Hassan Artail,et al. The shared-taxi problem: Formulation and solution methods , 2014 .
[34] Martin W. P. Savelsbergh,et al. Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..
[35] David M. Ryan,et al. The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .
[36] Niels A. H. Agatz,et al. The Benefits of Meeting Points in Ride-Sharing Systems , 2015 .
[37] Gilbert Laporte,et al. A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem , 2012, INFORMS J. Comput..
[38] Dong Li,et al. Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic , 2018, Transportation Research Part E: Logistics and Transportation Review.
[39] Leo G. Kroon,et al. Crowdsourced Delivery - A Dynamic Pickup and Delivery Problem with Ad Hoc Drivers , 2016, Transp. Sci..
[40] R. Jayakrishnan,et al. A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem , 2017, ArXiv.
[41] Kalyan T. Talluri,et al. An Enhanced Concave Program Relaxation for Choice Network Revenue Management , 2013 .
[42] Jean-François Cordeau,et al. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..
[43] R. Cervero,et al. Just a better taxi? A survey-based comparison of taxis, transit, and ridesourcing services in San Francisco , 2016 .
[44] Susan Shaheen,et al. Ridesharing in North America: Past, Present, and Future , 2012 .
[45] Martin W. P. Savelsbergh,et al. Optimization for dynamic ride-sharing: A review , 2012, Eur. J. Oper. Res..
[46] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..
[47] Marielle Christiansen,et al. The pickup and delivery problem with time windows and occasional drivers , 2019, Comput. Oper. Res..
[48] Warren B. Powell,et al. Solving Parallel Machine Scheduling Problems by Column Generation , 1999, INFORMS J. Comput..
[49] Bo Zou,et al. Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery , 2017 .
[50] Ali Najmi,et al. Novel dynamic formulations for real-time ride-sharing systems , 2017 .
[51] Maged Dessouky,et al. A pickup and delivery problem for ridesharing considering congestion , 2016 .