Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Solution of Multi-Crew Depots Railway Crew Scheduling Problems: The Chinese High-Speed Railway Case
This paper presents a novel mathematical formulation in crew scheduling, considering real challenges most railway companies face such as roundtrip policy for crew members joining from different crew depots and stricter working time standards under a sustainable development strategy. In China, the crew scheduling is manually compiled by railway companies respectively, and the plan quality varies from person to person. An improved genetic algorithm is proposed to solve this large-scale combinatorial optimization problem. It repairs the infeasible gene fragments to optimize the search scope of the solution space and enhance the efficiency of GA. To investigate the algorithm’s efficiency, a real case study was employed. Results show that the proposed model and algorithm lead to considerable improvement compared to the original planning: (i) Compared with the classical metaheuristic algorithms (GA, PSO, TS), the improved genetic algorithm can reduce the objective value by 4.47%; and (ii) the optimized crew scheduling plan reduces three crew units and increases the average utilization of crew unit working time by 6.20% compared with the original plan.
Solution of Multi-Crew Depots Railway Crew Scheduling Problems: The Chinese High-Speed Railway Case
This paper presents a novel mathematical formulation in crew scheduling, considering real challenges most railway companies face such as roundtrip policy for crew members joining from different crew depots and stricter working time standards under a sustainable development strategy. In China, the crew scheduling is manually compiled by railway companies respectively, and the plan quality varies from person to person. An improved genetic algorithm is proposed to solve this large-scale combinatorial optimization problem. It repairs the infeasible gene fragments to optimize the search scope of the solution space and enhance the efficiency of GA. To investigate the algorithm’s efficiency, a real case study was employed. Results show that the proposed model and algorithm lead to considerable improvement compared to the original planning: (i) Compared with the classical metaheuristic algorithms (GA, PSO, TS), the improved genetic algorithm can reduce the objective value by 4.47%; and (ii) the optimized crew scheduling plan reduces three crew units and increases the average utilization of crew unit working time by 6.20% compared with the original plan.
Solution of Multi-Crew Depots Railway Crew Scheduling Problems: The Chinese High-Speed Railway Case
Chunxiao Zhao (Autor:in) / Junhua Chen (Autor:in) / Xingchen Zhang (Autor:in) / Zanyang Cui (Autor:in)
2022
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Automatic generation of car shunting scheduling in railway car depots
| British Library Conference Proceedings | 2008
The cutting crew - WM Plant completed some tricky reprofiling on a railway line
Online Contents | 2006
The cutting crew WM Plant completed some tricky reprofiling on a railway line
British Library Online Contents | 2006
Impact of Crew Scheduling on Project Performance
| British Library Online Contents | 2013
BoxStep methods for crew pairing problems
| Online Contents | 2006