Transit vehicle scheduling model and 3M evolutionary algorithm based on super spatiotemporal network

Expand
  • Business School, University of Shanghai for Science and Technology, Shanghai 200093, China

Received date: 2021-03-10

  Online published: 2023-09-14

Abstract

In order to reduce the number of deadheading trips and realize the equality of working hours with the given bus timetable, this paper formulated a super spatiotemporal based transit vehicle scheduling model and designed an evolutionary algorithm including mixed creation, mutation and mature operators. Firstly, this study used the super-network conception to combine pulling out arcs, pulling in arcs, connectors, actual trips and deadheading trips into a super spatiotemporal network. Based on the flow conservation conception in the super-network, this study built a vehicle scheduling model and transformed the constraint of working time equality into an addable item of objective. In view of the topological feature of the set of trip coverings, this paper designed a mixed creation operator to generate new solution with several known feasible solutions. By searching the connectors with loop feature, this paper realized the mutation operator to the elements of feasible solution. The mature operator consists of formulating an assignment network, computing the cost of links in the assignment network, and obtaining the optimal match by Hungarian algorithm. Based on the above three operators, this paper proposed a new "3M" evolutionary algorithm. The numerical analysis verified the rationality of the new model and the effectiveness of the new algorithm. This research discovers that there is a mutual restriction relationship between reducing deadheading trips and equalizing the actual trip times among trip chains, but the both have no obvious connection with the fleet size.

Cite this article

Shengxue HE . Transit vehicle scheduling model and 3M evolutionary algorithm based on super spatiotemporal network[J]. Operations Research Transactions, 2023 , 27(3) : 68 -82 . DOI: 10.15960/j.cnki.issn.1007-6093.2023.03.005

References

1 Wang C , Shi H Y , Zuo X Q . A multi-objective genetic algorithm based approach for dynamical bus vehicles scheduling under traffic congestion[J]. Swarm and Evolutionary Computation, 2020, 54, 100667.
2 Guedes P C , Borenstein D , Visentini M S , et al. Vehicle scheduling problem with loss in bus ridership[J]. Computers & Operations Research, 2019, 111, 230- 242.
3 Boyer V , Ibarra-Rojas O J , Ríos-Solís , et al. Vehicle and crew scheduling for flexible bus transportation systems[J]. Transportation Research Part B: Methodological, 2018, 112, 216- 229.
4 Desfontaines L , Desaulniers G . Multiple depot vehicle scheduling with controlled trip shifting[J]. Transportation Research Part B: Methodological, 2018, 113, 34- 53.
5 Olariu E F , Frasinaru C . Multiple-depot vehicle scheduling problem heuristics[J]. Procedia Computer Science, 2020, 176, 241- 250.
6 Kulkarni S , Krishnamoorthy M , Ranade A , et al. A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem[J]. Transportation Research Part B: Methodological, 2018, 118, 457- 487.
7 Carosi S , Frangioni A , Galli L , et al. A matheuristic for integrated timetabling and vehicle scheduling[J]. Transportation Research Part B: Methodological, 2019, 127, 99- 124.
8 Cao Z C , Ceder A . Autonomous shuttle bus service timetabling and vehicle scheduling using skip-stop tactic[J]. Transportation Research Part C: Emerging Technologies, 2019, 102, 370- 395.
9 陈明明, 牛惠民. 多车场公交乘务排班问题优化[J]. 交通运输系统工程与信息, 2013, 13 (05): 159- 166.
10 Ucar E , Birbil S I , Muter I . Managing disruptions in the multi-depot vehicle scheduling problem[J]. Transportation Research Part B: Methodological, 2017, 105, 249- 269.
11 Liu T , Ceder A . Battery-electric transit vehicle scheduling with optimal number of stationary chargers[J]. Transportation Research Part C: Emerging Technologies, 2020, 114, 118- 139.
12 Yao E J , Liu T , Lu T W , et al. Optimization of electric vehicle scheduling with multiple vehicle types in public transport[J]. Sustainable Cities and Society, 2020, 52, 101862.
13 朱鹰屏, 韩新莹, 刘世立, 等. 基于改进双中心粒子群算法的电动公交车运营数量优化策略研究[J]. 电力系统保护与控制, 2017, 45 (08): 126- 131.
14 唐春艳, 杨凯强, 邬娜. 单线纯电动公交车辆柔性调度优化[J]. 交通运输系统工程与信息, 2020, 20 (03): 156- 162.
15 Ji Y X , Liu B , Shen Y , et al. Scheduling strategy for transit routes with modular autonomous vehicles[J]. International Journal of Transportation Science and Technology, 2021, 10 (2): 121- 135.
16 代壮, 陈汐, 马晓磊. 半自动驾驶公交车辆编组与调度优化[J]. 北京航空航天大学学报, 2020, 46 (12): 93- 101.
17 Cao Z C , Ceder A , Zhang S L . Real-time schedule adjustments for autonomous public transport vehicles[J]. Transportation Research Part C: Emerging Technologies, 2019, 109, 60- 78.
18 Nagy V , Horváth B . The effects of autonomous buses to vehicle scheduling system[J]. Procedia Computer Science, 2020, 170, 235- 240.
19 何胜学, 范炳全, 谢劲松. 多用户多准则城市交通网络非稳定均衡分析[J]. 公路交通科技, 2008, 25 (3): 109-114, 138
20 何胜学, 董琼, 徐福缘, 等. 含目的地选择的城市交通网络非稳定均衡分析[J]. 系统工程, 2010, 28 (1): 8- 13.
21 何胜学, 潘红. 考虑库存的供应链框架下区域运输网络均衡模型[J]. 系统工程, 2013, 31 (5): 9- 15.
22 何胜学, 潘红. 空间价格均衡问题的超级网络解法[J]. 计算机应用研究, 2013, 30 (7): 2017- 2020.
23 戴福青, 庞笔照, 袁婕, 等. 基于超级网络的空铁联合交通流分布模型[J]. 武汉理工大学学报(交通科学与工程版), 2017, 41 (5): 770- 775.
24 王冬冬, 何胜学, 路扬. 考虑基站选址的UAV交通巡视路径超级时空网络模型[J]. 计算机应用研究, 2019, 36 (9): 2671- 2674.
25 何胜学, 金梦宇. 多用户多准则多方式下基于超级网络的公交客流均衡分配[J]. 计算机应用研究, 2021, 38 (7): 2418- 2422.
Outlines

/