Optimizing driver menus under stochastic selection behavior for ridesharing and crowdsourced delivery

• Published in: Transportation research. Part E, Logistics and transportation review Vol. 153; p. 102419
• Main Authors: Horner, Hannah, Pazour, Jennifer, Mitchell, John E.
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.09.2021
• Subjects: Driver autonomy; Occasional drivers; On-demand platforms; Sample average approximation; Stochastic multi-stage optimization; Supply-side choice; Driver autonomy; Stochastic multi-stage optimization; Supply-side choice; Occasional drivers; On-demand platforms; Sample average approximation
• ISSN: 1366-5545; 1878-5794
• DOI: 10.1016/j.tre.2021.102419

Peer-to-peer logistics platforms coordinate independent drivers to fulfill requests for last mile delivery and ridesharing. To balance demand-side performance with driver autonomy, a new stochastic methodology provides drivers with a small but personalized menu of requests to choose from. This creates a Stackelberg game, in which the platform leads by deciding what menu of requests to send to drivers, and the drivers follow by selecting which request(s) they are willing to fulfill from their received menus. Determining optimal menus, menu size, and request overlaps in menus is complex as the platform has limited knowledge of drivers’ request preferences. Exploiting the problem structure when drivers signal willingness to participate, we reformulate our problem as an equivalent single-level Mixed Integer Linear Program (MILP) and apply the Sample Average Approximation (SAA) method. Computational tests recommend a training sample size for inputted SAA scenarios and a test sample size for completing performance analysis. Our stochastic optimization approach performs better than current approaches, as well as deterministic optimization alternatives. A simplified formulation ignoring ‘unhappy drivers’ who accept requests but are not matched is shown to produce similar objective values with a fraction of the runtime. A ridesharing case study of the Chicago Regional transportation network provides insights for a platform wanting to provide driver autonomy via menu creation. The proposed methods achieved high demand performance as long as the drivers are well compensated (e.g., even when drivers are allowed to reject requests, on average over 90% of requests are fulfilled when 80% of the fare goes to drivers; this drops to below 60% when only 40% of the fare goes to drivers). Thus, neither the platform nor the drivers benefit from low driver compensation due to its resulting low driver participation and thus low request fulfillment. Finally, for the cases tested, a maximum menu size of 5 is recommended as it produces good quality platform solutions without requiring much driver selection time. •Drivers in ridesharing/crowdsourced delivery platforms autonomously make selections.•A special case yields single-level MILP equivalent to bilevel model.•Personalized driver menus are optimized for drivers’ stochastic selections.•Platform benefits from offering multiple items to drivers with stochastic selection.•Computational study provides menu and performance insights.