Crew Planning Optimization Model of High-Speed Railway

Article Preview

Abstract:

Crew planning with complicated constraints is decomposed into two sequential phases: crew scheduling phase, crew rostering phase. Setting a dynamic model based on set covering model, Genetic Algorithm is adopted based on feasible solution range in search of optimal scheduling set with minimum time. Constructing a node-arc TSP network, it adopts Genetic Algorithm and Simulated Annealing Algorithm to create a work roster. Based on Wuhan-Guangzhou High-Speed Railway in China, the balance degree of crew planning is measured by crew working time entropy. The proposed model proves strong practical application.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 869-870)

Pages:

298-304

Citation:

Online since:

December 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A. Caprara, P. Toth, D. Vigo, Operations Research, J. Commun. 46 (1998)820-830.

Google Scholar

[2] A.T. Ernst, H. Jiang, M. Krishnamoorthy, Annals of Operations Research. J. Commun. 118 (2001) 211-224.

Google Scholar

[3] Potthoff, D., D. Huisman, G. Desaulniers, Transportation Science, J. Commun. 44 (2010) 493-505.

Google Scholar

[4] L.P. Veelenturf, D. Potthoff, D. Huisman, Transportation Research Part C, J. Commun. 20 (2012) 95-110.

Google Scholar

[5] Peng Zhao, Research on Passenger Trains Operation and Crew Scheduling of High-Speed Railway, Beijing Jiaotong University (2004) (in Chinese).

Google Scholar

[6] Ying Wang, Jun Liu, Journal of the China Railway Society, J. Commun. 31 (2009) 15-19(in Chinese).

Google Scholar

[7] Jinzi Zheng, Jianrui Miao, Railway Computer Application, J. Commun. 19 (2010) 36-40 (in Chinese).

Google Scholar

[8] Wenlong Jin, Kai Cheng, Qingsong Wang, Railway Computer Application, J. Commun. 20(2011) 25-27 (in Chinese).

Google Scholar