启发式
公共交通
流量网络
方案(数学)
布线(电子设计自动化)
运输工程
计算机科学
网络规划与设计
运筹学
服务(商务)
数学优化
工程类
计算机网络
数学
数学分析
经济
人工智能
经济
作者
Haonan Guo,Yun Wang,Pan Shang,Xuedong Yan,Yunlin Guan
标识
DOI:10.1080/23249935.2023.2214631
摘要
As an emerging and innovative public transportation mode, the customised bus (CB) has drawn widespread attention. Existing studies of the CB mainly focus on issues regarding the bus station location, route design, timetabling, and fare setting, but rarely consider the passenger to bus station assignment problem which can significantly influence passengers’ benefit and the buses’ operating scheme. Thus, this study focuses on the customised bus routing problem with passenger-to-station assignment (CBRP-PSA) aiming to simultaneously minimise passengers’ CB service access cost and the bus route cost. A time-discretized multi-commodity network flow model is developed to jointly determine the CB routes, timetables, and passenger-to-station assignment by allowing split loads and mixed loads. Through the dualization, the developed model is decomposed into two solvable sub-problems, and a Lagrangian-based heuristic solution algorithm is proposed. The model and algorithm are implemented in illustrative, medium-scale, and large-scale transportation networks to demonstrate their effectiveness under different scenarios.
科研通智能强力驱动
Strongly Powered by AbleSci AI