北京
计算机科学
调度(生产过程)
拥挤
整数规划
帕累托原理
车辆路径问题
作业车间调度
汽车工程
运输工程
数学优化
计算机网络
中国
工程类
布线(电子设计自动化)
算法
数学
神经科学
政治学
法学
生物
作者
Hongyan Shang,Yanping Liu,Wenxiang Wu,Fangxia Zhao
标识
DOI:10.1016/j.eswa.2023.120352
摘要
In China, overlapped routes from multiple bus lines are widespread. Some buses are overcrowded while others have few passengers. The goal of this study is to reduce onboard passenger crowding without wasting bus capacity. This paper examines an extended multiple-depot vehicle scheduling problem (VSP) with multiple vehicle types. First, a bi-objective integer programming model was created. The trade-off between operating cost and passenger travel cost was established and the crowding cost due to different vehicle sizes was especially considered. Then, the capacity restraint incremental assignment algorithm and a vehicle scheduling method with multiple vehicle types were developed to find Pareto-optimal solutions that considered vehicle capacity constraints. Finally, the proposed methodology was validated using a real-world transit network in Beijing, China. The optimization results from about 1.18 million bus card swiping records show that our model and solution algorithm can effectively reduce the passenger crowding cost and avoid the waste of transport capacity.
科研通智能强力驱动
Strongly Powered by AbleSci AI