On-demand mobility-as-a-Service platform assignment games with guaranteed stable outcomes

IF 5.8 1区 工程技术 Q1 ECONOMICS Transportation Research Part B-Methodological Pub Date : 2024-08-22 DOI:10.1016/j.trb.2024.103060
Bingqing Liu, Joseph Y. J. Chow
{"title":"On-demand mobility-as-a-Service platform assignment games with guaranteed stable outcomes","authors":"Bingqing Liu,&nbsp;Joseph Y. J. Chow","doi":"10.1016/j.trb.2024.103060","DOIUrl":null,"url":null,"abstract":"<div><p>Mobility-as-a-Service (MaaS) systems are two-sided markets, with two mutually exclusive sets of agents, i.e., travelers/users and operators, forming a mobility ecosystem in which multiple operators compete or cooperate to serve customers under a governing platform provider. This study proposes a MaaS platform equilibrium model based on many-to-many assignment games incorporating both fixed-route transit services and mobility-on-demand (MOD) services. The matching problem is formulated as a convex multicommodity flow network design problem under congestion that captures the cost of accessing MOD services. The local stability conditions reflect a generalization of Wardrop's principles that include operators’ decisions. Due to the presence of congestion, the problem may result in non-stable designs, and a subsidy mechanism from the platform is proposed to guarantee local stability. A new exact solution algorithm to the matching problem is proposed based on a branch and bound framework with a Frank-Wolfe algorithm integrated with Lagrangian relaxation and subgradient optimization, which guarantees the optimality of the matching problem but not stability. A heuristic which integrates stability conditions and subsidy design is proposed, which reaches either an optimal MaaS platform equilibrium solution with global stability, or a feasible locally stable solution that may require subsidy. For the heuristic, a worst-case bound and condition for obtaining an exact solution are both identified. Two sets of reproducible numerical experiments are conducted. The first, on a toy network, verifies the model and algorithm, and illustrates the differences local and global stability. The second, on an expanded Sioux Falls network with 82 nodes and 748 links, derives generalizable insights about the model for coopetitive interdependencies between operators sharing the platform, handling congestion effects in MOD services, effects of local stability on investment impacts, and illustrating inequities that may arise under heterogeneous populations.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"188 ","pages":"Article 103060"},"PeriodicalIF":5.8000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part B-Methodological","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S019126152400184X","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

Abstract

Mobility-as-a-Service (MaaS) systems are two-sided markets, with two mutually exclusive sets of agents, i.e., travelers/users and operators, forming a mobility ecosystem in which multiple operators compete or cooperate to serve customers under a governing platform provider. This study proposes a MaaS platform equilibrium model based on many-to-many assignment games incorporating both fixed-route transit services and mobility-on-demand (MOD) services. The matching problem is formulated as a convex multicommodity flow network design problem under congestion that captures the cost of accessing MOD services. The local stability conditions reflect a generalization of Wardrop's principles that include operators’ decisions. Due to the presence of congestion, the problem may result in non-stable designs, and a subsidy mechanism from the platform is proposed to guarantee local stability. A new exact solution algorithm to the matching problem is proposed based on a branch and bound framework with a Frank-Wolfe algorithm integrated with Lagrangian relaxation and subgradient optimization, which guarantees the optimality of the matching problem but not stability. A heuristic which integrates stability conditions and subsidy design is proposed, which reaches either an optimal MaaS platform equilibrium solution with global stability, or a feasible locally stable solution that may require subsidy. For the heuristic, a worst-case bound and condition for obtaining an exact solution are both identified. Two sets of reproducible numerical experiments are conducted. The first, on a toy network, verifies the model and algorithm, and illustrates the differences local and global stability. The second, on an expanded Sioux Falls network with 82 nodes and 748 links, derives generalizable insights about the model for coopetitive interdependencies between operators sharing the platform, handling congestion effects in MOD services, effects of local stability on investment impacts, and illustrating inequities that may arise under heterogeneous populations.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
保证结果稳定的按需移动即服务平台分配游戏
移动即服务(MaaS)系统是一个双面市场,由两组相互排斥的代理(即旅行者/用户和运营商)组成一个移动生态系统,在这个生态系统中,多个运营商在一个管理平台提供商的管理下竞争或合作为客户提供服务。本研究提出了一个基于多对多分配博弈的 MaaS 平台均衡模型,其中包含固定路线交通服务和按需移动(MOD)服务。匹配问题被表述为拥堵条件下的凸多商品流网络设计问题,该问题反映了获取 MOD 服务的成本。局部稳定性条件反映了包括运营商决策在内的 Wardrop 原则的一般化。由于拥堵的存在,该问题可能会导致非稳定设计,因此提出了一种来自平台的补贴机制来保证局部稳定性。在分支和约束框架的基础上,提出了一种新的匹配问题精确求解算法,该算法采用弗兰克-沃尔夫算法,并结合了拉格朗日松弛和次梯度优化,可保证匹配问题的最优性,但不能保证稳定性。我们提出了一种将稳定性条件和补贴设计结合起来的启发式方法,它既能获得具有全局稳定性的最优 MaaS 平台均衡解,也能获得可能需要补贴的可行局部稳定解。对于启发式,确定了获得精确解的最坏情况约束和条件。我们进行了两组可重复的数值实验。第一组在一个玩具网络上进行,验证了模型和算法,并说明了局部和全局稳定性的差异。第二组实验是在一个拥有 82 个节点和 748 个链接的扩大的苏福尔斯网络上进行的,实验得出了关于共享平台的运营商之间相互依赖的合作竞争关系模型的通用见解,处理了 MOD 服务中的拥塞效应、局部稳定性对投资影响的影响,并说明了在异质人群中可能出现的不公平现象。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Transportation Research Part B-Methodological
Transportation Research Part B-Methodological 工程技术-工程:土木
CiteScore
12.40
自引率
8.80%
发文量
143
审稿时长
14.1 weeks
期刊介绍: Transportation Research: Part B publishes papers on all methodological aspects of the subject, particularly those that require mathematical analysis. The general theme of the journal is the development and solution of problems that are adequately motivated to deal with important aspects of the design and/or analysis of transportation systems. Areas covered include: traffic flow; design and analysis of transportation networks; control and scheduling; optimization; queuing theory; logistics; supply chains; development and application of statistical, econometric and mathematical models to address transportation problems; cost models; pricing and/or investment; traveler or shipper behavior; cost-benefit methodologies.
期刊最新文献
Economic analysis of parking, vehicle charging and vehicle-to-grid services in the era of electric vehicles A novel data fusion method to leverage passively-collected mobility data in generating spatially-heterogeneous synthetic population The drone scheduling problem in shore-to-ship delivery: A time discretization-based model with an exact solving approach Modelling the impacts of en-route ride-pooling service in a mixed pooling and non-pooling market Amachine learning technique embedded reference-dependent choice model for explanatory power improvement: Shifting of reference point as a key factor in vehicle purchase decision-making
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1