文献类型：期刊文献

英文题名：Service network design of modular vehicles on general road networks considering passengers' turning choices

作者：Yu, Jiahui[1];Wang, Xiaolei[1,2];Guo, Lei[3];Chen, Zhibin[4];Liang, Zhe[1,2]

机构：[1]Tongji Univ, Sch Econ & Management, Shanghai, Peoples R China;[2]Tongji Univ, Lab High Qual Urban Dev & Strateg Decis, Shanghai 200092, Peoples R China;[3]East China Univ Sci & Technol, Sch Business, Shanghai, Peoples R China;[4]NYU Shanghai, Ctr Data Sci, Shanghai, Peoples R China

年份：2026

卷号：206

外文期刊名：TRANSPORTATION RESEARCH PART B-METHODOLOGICAL

收录：;EI(收录号：20260820145576);WOS:【SSCI(收录号:WOS:001699117300001)，SCI-EXPANDED(收录号:WOS:001699117300001)】；

基金：We wish to express our sincere thanks to the two enthusiastic anonymous reviewers who offer thorough and constructive comments to help us improve the model and methodology of the paper. This work was supported by the National Natural Science Foundation of China (Grant Nos. 72431007, 72131007, and 12271161) , the Shuguang Program of Shanghai Education Development Foundation and Shanghai Municipal Education Commission, and the Fundamental Research Funds for the Central Universities (22120230311) .

语种：英文

外文关键词：Modular vehicle; User equilibrium; Circulation pattern design; Bi-convex programming

摘要：The emergence of modular vehicles (MVs) opens the avenue to an entirely new urban transit system, in which a fleet of modular pods (MPs) circulates within the road network and collectively constitutes a dynamic MV service network, allowing transit passengers to freely make routing choices at each intersection by transferring to the appropriate pod. Provided feasible MP circulation patterns on the road network, this paper develops a novel mathematical model to depict passengers' turning choices at user equilibrium in the MV service network. We establish the equivalence of this model to a linear optimization problem, which can be further transformed into a multi-commodity network flow problem on a revised network. Taking passengers' turning choices as the lower-level problem, we then propose a bi-level problem to optimize the MP circulation pattern. We show that this bi-level problem can be transformed into a non-convex single-level problem with bi-convex property, and employ an alternating minimization (AM) algorithm to solve it by iteratively solving two convex subproblems. The convergence of the AM algorithm is established, and tailored algorithms are developed for solving each subproblem efficiently in large-scale networks. To mitigate the AM algorithm's susceptibility to poor local optima in non-convex problems, an enhanced multi-start heuristic (MSAM) is proposed. Numerical experiments on small-to large-scale networks validate the effectiveness of the proposed model and demonstrate the computational efficiency of the developed algorithms.