Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines

Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines

This paper studies the modeling and algorithms of crew roster problem with given cycle on high-speed railway lines. Two feasible compilation strategies for work out the crew rostering plan are discussed, and then an integrated compilation method is proposed in this paper to obtain a plan with relati...

Full description

Bibliographic Details
Main Authors: Zhiqiang Tian, Huimin Niu
Format: Article
Language:English
Published: Hindawi Limited 2012-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2012/214607
id doaj-3ab8c01698c34a9eb32815acc92d9bab
record_format Article
spelling doaj-3ab8c01698c34a9eb32815acc92d9bab2020-11-24T21:54:45ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472012-01-01201210.1155/2012/214607214607Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway LinesZhiqiang Tian0Huimin Niu1School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, ChinaSchool of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, ChinaThis paper studies the modeling and algorithms of crew roster problem with given cycle on high-speed railway lines. Two feasible compilation strategies for work out the crew rostering plan are discussed, and then an integrated compilation method is proposed in this paper to obtain a plan with relatively higher regularity in execution and lower crew members arranged. The process of plan making is divided into two subproblems which are decomposition of crew legs and adjustment of nonmaximum crew roster scheme. The decomposition subproblem is transformed to finding a Hamilton chain with the best objective function in network which was solved by an improved ant colony algorithm, whereas the adjustment of nonmaximum crew rostering scheme is finally presented as a set covering problem and solved by a two-stage algorithm. The effectiveness of the proposed models and algorithms are testified by a numerical example.http://dx.doi.org/10.1155/2012/214607
collection DOAJ
language English
format Article
sources DOAJ
author Zhiqiang Tian
Huimin Niu
spellingShingle Zhiqiang Tian
Huimin Niu
Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines
Mathematical Problems in Engineering
author_facet Zhiqiang Tian
Huimin Niu
author_sort Zhiqiang Tian
title Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines
title_short Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines
title_full Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines
title_fullStr Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines
title_full_unstemmed Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines
title_sort modeling and algorithms of the crew rostering problem with given cycle on high-speed railway lines
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2012-01-01
description This paper studies the modeling and algorithms of crew roster problem with given cycle on high-speed railway lines. Two feasible compilation strategies for work out the crew rostering plan are discussed, and then an integrated compilation method is proposed in this paper to obtain a plan with relatively higher regularity in execution and lower crew members arranged. The process of plan making is divided into two subproblems which are decomposition of crew legs and adjustment of nonmaximum crew roster scheme. The decomposition subproblem is transformed to finding a Hamilton chain with the best objective function in network which was solved by an improved ant colony algorithm, whereas the adjustment of nonmaximum crew rostering scheme is finally presented as a set covering problem and solved by a two-stage algorithm. The effectiveness of the proposed models and algorithms are testified by a numerical example.
url http://dx.doi.org/10.1155/2012/214607
work_keys_str_mv AT zhiqiangtian modelingandalgorithmsofthecrewrosteringproblemwithgivencycleonhighspeedrailwaylines
AT huiminniu modelingandalgorithmsofthecrewrosteringproblemwithgivencycleonhighspeedrailwaylines
_version_ 1725865990860832768

Similar Items