4.5 Article

Supplier Menus for Dynamic Matching in Peer-to-Peer Transportation Platforms

期刊

TRANSPORTATION SCIENCE
卷 -, 期 -, 页码 -

出版社

INFORMS
DOI: 10.1287/trsc.2022.1133

关键词

peer-to-peer transportation; dynamic matching; supplier-side choice; multiple scenario approach; ride-sharing

资金

  1. National Science Foundation [1751801]
  2. Deutsche Forschungsgemeinschaft [444657906]
  3. Div Of Civil, Mechanical, & Manufact Inn
  4. Directorate For Engineering [1751801] Funding Source: National Science Foundation

向作者/读者索取更多资源

Peer-to-peer transportation platforms use menu selection to mitigate selection uncertainty. The study presents a multiple scenario approach that combines different solutions by sampling supplier selections, solving two-stage decision problems, and using a consensus algorithm to generate menus with the entire system in mind. This method outperforms benchmark policies.
Peer-to-peer transportation platforms dynamically match requests (e.g., a ride, a delivery) to independent suppliers who are not employed nor controlled by the platform. Thus, the platform cannot be certain that a supplier will accept an offered request. To mitigate this selection uncertainty, a platform can offer each supplier a menu of requests to choose from. Such menus need to be created carefully because there is a trade-off between selection probability and duplicate selections. In addition to a complex decision space, supplier selection decisions are vast and have systematic implications, impacting the platform???s revenue, other suppliers??? experiences (in the form of duplicate selections), and the request waiting times. Thus, we present a multiple scenario approach, repeatedly sampling potential supplier selections, solving the corresponding two-stage decision problems, and combining the multiple different solutions through a consensus algorithm. Extensive computational results using the Chicago Region as a case study illustrate that our method outperforms a set of benchmark policies. We quantify the value of anticipating supplier selection, offering menus to suppliers, offering requests to multiple suppliers at once, and holistically generating menus with the entire system in mind. Our method leads to more balanced assignments by sacrificing some ???easy wins??? toward better system performance over time and for all stakeholders involved, including increased revenue for the platform, and decreased match waiting times for suppliers and requests.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据