arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.16595econ.GNmath.OCq-fin.EC
收藏

具有稳定匹配的多乘客拼车系统的一般均衡模型

A general equilibrium model for multi-passenger ridesharing systems with stable matching

Technion – Israel Institute of Technology(以色列理工学院)

Rui Yao, Shlomo Bekhor

AI总结:

研究多乘客拼车系统的一般均衡模型,将匹配序列与超网络结合避免乘客转移,扩展匹配稳定性,证明均衡存在性,开发序列-布什算法求解,实验表明该算法优,还得出行程及单价等相关结论。

摘要:

本文提出了一个多乘客拼车系统的一般均衡模型,该模型内生地捕捉了拼车司机、乘客、平台和交通网络之间的相互作用。稳定匹配被建模为一个均衡问题,即没有拼车司机或乘客可以通过单方面切换到另一个匹配序列来降低拼车的负效用。本文是最早将拼车平台多乘客匹配问题明确整合到模型中的研究之一。通过将匹配序列与超网络相结合,在多乘客拼车系统中避免了乘客转移。此外,拼车司机和乘客之间的匹配稳定性在匹配序列方面扩展到了多起讫点多乘客的情况。本文为所提出的一般均衡的存在性提供了证明。开发了一种序列-布什算法来解决多乘客拼车均衡问题。该算法能够隐式处理复杂的拼车约束。结果表明,所提出的序列-布什算法优于通用求解器,并为联合稳定匹配和路线选择问题的均衡提供了见解。数值实验表明,拼车行程通常比平均行程长度长。敏感性分析表明,适当设计的拼车单价对于实现网络效益是必要的,并且时间价值相对较低的旅行者更有可能参与拼车。

英文摘要:

This paper proposes a general equilibrium model for multi-passenger ridesharing systems, in which interactions between ridesharing drivers, passengers, platforms, and transportation networks are endogenously captured. Stable matching is modeled as an equilibrium problem in which no ridesharing driver or passenger can reduce ridesharing disutility by unilaterally switching to another matching sequence. This paper is one of the first studies that explicitly integrates the ridesharing platform multi-passenger matching problem into the model. By integrating matching sequence with hyper-network, ridesharing-passenger transfers are avoided in a multi-passenger ridesharing system. Moreover, the matching stability between the ridesharing drivers and passengers is extended to address the multi-OD multi-passenger case in terms of matching sequence. The paper provides a proof for the existence of the proposed general equilibrium. A sequence-bush algorithm is developed for solving the multi-passenger ridesharing equilibrium problem. This algorithm is capable to handle complex ridesharing constraints implicitly. Results illustrate that the proposed sequence-bush algorithm outperforms general-purpose solver, and provides insights into the equilibrium of the joint stable matching and route choice problem. Numerical experiments indicate that ridesharing trips are typically longer than average trip lengths. Sensitivity analysis suggests that a properly designed ridesharing unit price is necessary to achieve network benefits, and travelers with relatively lower values of time are more likely to participate in ridesharing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑