Online acceptance probability approximation in peer-to-peer transportation
Authors:
- Rosemonde AusseilRARosemonde Ausseil
- Marlin W. UlmerMUMarlin W. Ulmer
- Jennifer A. PazourJPJennifer A. Pazour
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (1751801)
- Deutsche Forschungsgemeinschaft (444657906)
This publication has 60 references indexed in Scilit:
- The Delivery Dispatching Problem with Time Windows for Urban Consolidation CentersTransportation Science, 2019
- Workforce grouping and assignment with learning-by-doing and knowledge transferInternational Journal of Production Research, 2018
- Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer RequestsTransportation Science, 2018
- Crowd logistics: an opportunity for more sustainable urban freight transport?European Transport Research Review, 2017
- A matheuristic for workforce planning with employee learning and stochastic demandInternational Journal of Production Research, 2017
- Multi-period technician scheduling with experience-based service times and stochastic customersComputers & Operations Research, 2017
- The Vehicle Routing Problem with Occasional DriversEuropean Journal of Operational Research, 2016
- Ridesharing: The state-of-the-art and future directionsTransportation Research Part B: Methodological, 2013
- Optimization for dynamic ride-sharing: A reviewEuropean Journal of Operational Research, 2012
- Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal AlgorithmsOperations Research, 2009