车辆与交通

专车服务的多模式随机共乘用户均衡模型

  • 王牵莲 ,
  • 马捷 ,
  • 王炜 ,
  • 陈景旭
展开
  • 东南大学 交通学院, 南京 211189

收稿日期: 2023-06-03

  网络出版日期: 2024-07-19

基金资助

国家自然科学基金青年科学基金项目(51878166);教育部人文社科基金项目(22YJCZH123);江苏省自然科学基金项目(BK20220846);中国博士后基金项目(2021M690614);中国博士后基金特别资助项目(2021T140112)

Multimodal stochastic ridesharing user equilibrium model with tailored service

  • WANG Qianlian ,
  • MA Jie ,
  • WANG Wei ,
  • CHEN Jingxu
Expand
  • School of Transportation, Southeast University, Nanjing 211189, China

Received date: 2023-06-03

  Online published: 2024-07-19

摘要

共乘出行是城市共享交通的重要出行方式之一。共乘出行可以减少道路上的机动车数量,也常被认为是缓解交通拥堵的有效方式。相比于传统的共乘出行,专车共乘出行能进一步提升出行体验的舒适程度,提高出行者的共乘积极性,促进城市共享交通的良性发展。研究共乘出行的交通分配问题对于预测交通流量和制定管理政策具有重要意义。该文以专车共乘出行为研究对象,提出了多模式随机共乘用户均衡(stochastic ridesharing user equilibrium,SRUE)问题;基于Logit模型建立了该问题的变分不等式(variational inequality,VI)模型,并验证了解的等价性、存在性和唯一性;通过并行自适应投影算法(parallel self-adaptive projection,PSAP)获得模型的解,通过数值实验对模型和算法的有效性进行评估。实验结果表明:专车共乘出行能有效减少路面行驶的车辆、降低出行时间;乘客在专车共乘出行市场中占据主导地位;制定的合理公交票价能协同常规公交与专车共乘出行从而缓解交通拥堵。

本文引用格式

王牵莲 , 马捷 , 王炜 , 陈景旭 . 专车服务的多模式随机共乘用户均衡模型[J]. 清华大学学报(自然科学版), 2024 , 64(8) : 1469 -1481 . DOI: 10.16511/j.cnki.qhdxxb.2023.26.053

Abstract

[Objective] Ridesharing is considerably reforming urban transportation networks. It is considered an effective measure to alleviate traffic congestion and vehicle emissions and is supported by many governments and residents globally. It also encourages travelers with the same or similar origin and destination to share vehicles to reduce on-road vehicles. Unlike traditional ridesharing services, which place as many ridesharing participants as possible inside ridesharing vehicles, tailored ridesharing prioritizes the comfort and convenience of travelers and predominantly offers one-to-one ridesharing services. However, the emerging tailored ridesharing mode makes traditional methods of predicting traffic flow ineffective. Therefore, it is crucial to investigate a traffic assignment problem to predict traffic flow and formulate traffic management policies. [Methods] First, we clarify a multimodal stochastic ridesharing user equilibrium (SRUE) problem, where the network topology, flow constraints, and generalized travel cost functions are specified. Travelers can choose to be solo drivers, ridesharing drivers, riders, or public transport passengers, considering a network with tailored ridesharing and public transit services. Consideration is given to the travel demands of car owners and noncar owners. The flow conservation and ride-matching constraints are formulated. Furthermore, a path-based generalized travel cost function is proposed for each mode, including time costs, inconvenience costs, ridesharing prices, compensation, and miscellaneous costs. The SRUE flow distribution principle states that travelers will always select the alternative, where an alternative consists of a route and a mode with the minimum perceived travel cost. Second, we formulate an equivalent variational inequality (VI) model for the above SRUE problem, refer to as the VI-SRUE model. Moreover, the equivalence, existence, and uniqueness of the model solution are demonstrated. The stochasticity is handled by introducing a random perception error that satisfies the Gumbel distribution, ensuring that the travelers' choice behavior pattern conforms to the Logit model. The equivalence is proved by checking the Karush-Kuhn-Tucker (KKT) condition and Slater's theorem. The existence is supported by the compact feasible solution set and continuous function of the VI-SRUE model. The VI-SRUE has a unique solution because its function is strictly monotonous under mild conditions. Finally, a globally convergent parallel self-adaptive projection (PSAP) algorithm is applied to find the solution to the VI-SRUE model. The algorithm combines the K-shortest path method, network decomposition, and parallel computing techniques to avoid the possible memory overflow caused by large-scale networks. [Results] In this paper, numerical experiments were conducted to assess the proposed model and algorithm. A sensitivity analysis was performed based on the Braess network. From these experiments, the following results were obtained: (1) Tailored ridesharing could effectively reduce the travel time of on-road vehicles and travelers. (2) Riders dominated the tailored ridesharing market through high sensitivity of ridesharing flow to coefficient of inconvenience (COI). (3) Appropriate bus fares could help public transport and tailored ridesharing to further reduce the traffic congestion. Moreover, through the Sioux-Falls network, the PSAP algorithm was verified to have excellent computational efficiency for solving large-scale SRUE problems. [Conclusions] In summary, this paper proposes a VI-SRUE model to predict the flow pattern of urban transportation networks with tailored ridesharing services using an efficient algorithm. The proposed VI-SRUE model describes the stochasticity associated with travelers' perception of transportation network information. The contribution of this paper is to establish a traffic assignment problem that simultaneously considers various travel modes and multiple types of travelers in the ridesharing network. Through the verification, solution, and analysis of the problem and equivalent mathematical model, this paper clarifies the relation among multiple travel modes, providing an effective foundation for predicting traffic flow and formulating ridesharing management measures.

参考文献

[1] XU H Y, PANG J S, ORDÓÑEZ F, et al. Complementarity models for traffic equilibrium with ridesharing[J]. Transportation Research Part B:Methodological, 2015, 81:161-182.
[2] MA J, XU M, MENG Q, et al. Ridesharing user equilibrium problem under OD-based surge pricing strategy[J]. Transportation Research Part B:Methodological, 2020, 134:1-24.
[3] 李梦,黄海军.考虑共享出行的用户均衡交通分配模型[J].系统工程理论与实践, 2019, 39(7):1771-1780. LI M, HUANG H J. A user equilibrium assignment model with ridesharing[J]. Systems Engineering-Theory&Practice, 2019, 39(7):1771-1780.(in Chinese)
[4] DI X, LIU H X, BAN X G (JEFF), et al. Ridesharing user equilibrium and its implications for high-occupancy toll lane pricing[J]. Transportation Research Record:Journal of the Transportation Research Board, 2017, 2667(1):39-50.
[5] DI X, MA R, LIU H X, et al. A link-node reformulation of ridesharing user equilibrium with network design[J]. Transportation Research Part B:Methodological, 2018, 112:230-255.
[6] 谭卫民,龙建成,卢晓珊,等.考虑用户体验的动态共乘系统设计[J].系统工程理论与实践, 2020, 40(1):210-218. TAN W M, LONG J C, LU X S, et al. A dynamic ride-sharing system based on user experience[J]. Systems Engineering-Theory&Practice, 2020, 40(1):210-218.(in Chinese)
[7] LI M, DI X, LIU H X, et al. A restricted path-based ridesharing user equilibrium[J]. Journal of Intelligent Transportation Systems:Technology, Planning, and Operations, 2020, 24(4):383-403.
[8] WANG X L, YANG H, ZHU D L. Driver-rider cost-sharing strategies and equilibria in a ridesharing program[J]. Transportation Science, 2018, 52(4):868-881.
[9] SUN S, SZETO W Y. Multi-class stochastic user equilibrium assignment model with ridesharing:Formulation and policy implications[J]. Transportation Research Part A:Policy and Practice, 2021, 145:203-227.
[10] XU H Y, ORDÓÑEZ F, DESSOUKY M. A traffic assignment model for a ridesharing transportation market[J]. Journal of Advanced Transportation, 2015, 49(7):793-816.
[11] MA J, MENG Q, CHENG L, et al. General stochastic ridesharing user equilibrium problem with elastic demand[J]. Transportation Research Part B:Methodological, 2022, 162:162-194.
[12] YAN C Y, HU M B, JIANG R, et al. Stochastic ridesharing user equilibrium in transport networks[J]. Networks and Spatial Economics, 2019, 19(4):1007-1030.
[13] 马捷,李锐,王华.弹性需求的Logit随机共乘用户均衡模型和算法[J].同济大学学报(自然科学版), 2022, 50(5):601-609. MA J, LI R, WANG H. Logit-based stochastic ridesharing user equilibrium model with elastic demand and its algorithm[J]. Journal of Tongji University (Natural Science), 2022, 50(5):601-609.(in Chinese)
[14] 郇宁,姚恩建,杨扬,等.电动汽车混入条件下随机动态用户均衡分配模型[J].交通运输工程学报, 2019, 19(5):150-161. HUAN N, YAO E J, YANG Y, et al. Stochastic dynamic user equilibrium assignment model considering penetration of electric vehicles[J]. Journal of Traffic and Transportation Engineering, 2019, 19(5):150-161.(in Chinese)
[15] 周博见,李旭宏,何杰.求解基于路径的Logit型随机用户均衡模型的新算法[J].中国公路学报, 2014, 27(3):100-107. ZHOU B J, LI X H, HE J. A new algorithm for path-based Logit stochastic user equilibrium model[J]. China Journal of Highway and Transport, 2014, 27(3):100-107.(in Chinese)
[16] 胡文君,周溪召.基于交叉巢式Logit的多用户多模式随机用户均衡模型[J].中国公路学报, 2012, 25(4):133-140. HU W J, ZHOU X Z. Multi-user and multi-mode stochastic user equilibrium model based on cross-nested Logit[J]. China Journal of Highway and Transport, 2012, 25(4):133-140.(in Chinese)
[17] 胡文君,周溪召.基于成对组合Logit的多用户多模式随机用户均衡模型[J].系统工程理论与实践, 2013, 33(5):1318-1326. HU W J, ZHOU X Z. Multi-user multi-mode stochastic user equilibrium model based on paired combinatorial Logit models[J]. Systems Engineering-Theory&Practice, 2013, 33(5):1318-1326.(in Chinese)
[18] LI M, HUA G W, HUANG H J. A multi-modal route choice model with ridesharing and public transit[J]. Sustainability, 2018, 10(11):4275.
[19] PATRIKSSON M. The traffic assignment problem:Models and methods[M]. New York:Courier Dover Publications, 2015.
[20] BOYD S, VANDENBERGHE L. Strong duality and Slater's constraint qualification[M]//BOYED S, VANDENBERGHE L. Convex optimization. Cambridge:Cambridge University Press, 2004:226-227.
[21] NAGURNEY A. Network economic:A variational inequality approach[M]. 2nd ed. New York:Springer New York, 1999.
[22] JOHNSON C R. Positive definite matrices[J]. The American Mathematical Monthly, 1970, 77(3):259-264.
[23] FACCHINEI F, PANG J S. Finite-dimensional variational inequalities and complementarity problems, Volume Ⅰ[M]. New York:Springer, 2003.
[24] HE B S, HE X Z, LIU H X, et al. Self-adaptive projection method for co-coercive variational inequalities[J]. European Journal of Operational Research, 2009, 196(1):43-48.
[25] YEN J Y. Finding the K shortest loopless paths in a network[J]. Management Science, 1971, 17(11):712-716.
[26] BAR-GERA H. Transportation networks[EB/OL].(2021-10-22)[2023-03-31]. https://github.com/bstabler/TransportationNetworks.
文章导航

/