A many-to-many assignment game and stable outcome algorithm to evaluate collaborative mobility-as-a-service platforms
A many-to-many assignment game and stable outcome algorithm to evaluate collaborative mobility-as-a-service platforms
复制标题
DOI：
10.1016/j.trb.2020.08.002
复制
发表时间：
2019-11
期刊：
影响因子：
--
通讯作者：
Theodoros P. Pantelidis;Joseph Y. J. Chow;Saeid Rasulkhani
中科院分区：
文献类型：
--
作者：
Theodoros P. Pantelidis;Joseph Y. J. Chow;Saeid Rasulkhani
随着移动即服务(MAAS)系统变得越来越流行，旅行正在从单一模式的旅行转变为由移动运营商平台提供的个性化服务。对MAAS平台的评估依赖于对用户路线决策以及运营商服务和定价决策的建模。在多运营商的MAAS网络中，我们采用了一种新的交通分配范式，利用稳定匹配的概念来分配成本，并根据用户的路径选择和运营商的服务选择来确定运营商提供的价格，而不是求助于非凸双层规划公式。与我们之前的工作不同，提出的模型允许旅行者进行多式联运、多运营商旅行，从而在竞争网络运营商之间稳定地分配成本，为用户提供MAA。提出了一种有效地生成稳定结果模型的稳定性条件的算法。大量的计算实验表明，使用经典的苏福尔斯网络，该模型可以处理MAAS运营商在技术和运力变化、政府收购、整合和公司进入方面的定价响应。该算法复制了与显式路径枚举相同的稳定性条件，与显式路径枚举超时2小时相比，仅需17秒。
As Mobility as a Service (MaaS) systems become increasingly popular, travel is changing from unimodal trips to personalized services offered by a platform of mobility operators. Evaluation of MaaS platforms depends on modeling both user route decisions as well as operator service and pricing decisions. We adopt a new paradigm for traffic assignment in a MaaS network of multiple operators using the concept of stable matching to allocate costs and determine prices offered by operators corresponding to user route choices and operator service choices without resorting to nonconvex bilevel programming formulations. Unlike our prior work, the proposed model allows travelers to make multimodal, multi-operator trips, resulting in stable cost allocations between competing network operators to provide MaaS for users. An algorithm is proposed to efficiently generate stability conditions for the stable outcome model. Extensive computational experiments demonstrate the use of the model to handling pricing responses of MaaS operators in technological and capacity changes, government acquisition, consolidation, and firm entry, using the classic Sioux Falls network. The proposed algorithm replicates the same stability conditions as explicit path enumeration while taking only 17 seconds compared to explicit path enumeration timing out over 2 hours.