We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
地铁乘务排班计划优化的 最短路快速算法.
- Authors
薛锋; 梁鹏; 李海; 陈崇双; 周天星
- Abstract
: Crew scheduling is an important role in urban rail transit operation management. It is optimized inorder to solve the problem of low efficiency. In consider of deadheading, subway crew scheduling was studied. A double objective optimization model was established with the shortest connecting time of the crew scheduling and the least cost. As the large number of the crew work-pieces, they were divided into three groups according to the morning, white and night shifts on the basis of constraint condition. And the crew work-pieces were taken as the vertex. The connection relationship of the crew work-pieces was taken as the arc to construct the network diagram of the morning, day and night shifts. The shortest path faster algorithm was used to solve the problem. The algorithm adopted the idea of priority queue, and the shortest path was the crew task. Finally, taking Chengdu Metro Line 5 as an example, the results are as follows. The number of morning crew tasks is 53. The duration of morning crew tasks is 280 h 34 min 57 s. The number of day crew tasks is 41. The duration of day crew tasks is 199 h 54 min 51 s. The number of night crew tasks is 49. The duration of night crew tasks is 215 h 25 min 37 s. The total number of crew tasks is 143. The total duration of crew tasks is 695 h 55 min 25 s in the crew scheduling plan. Compared with manual results, the algorithm reduces the total cost and connecting time and improve the solving efficiency of the crew scheduling.
- Publication
Journal of Railway Science & Engineering, 2022, Vol 19, Issue 9, p2532
- ISSN
1672-7029
- Publication type
Article
- DOI
10.19713/j.cnki.43-1423/u.T20211061