Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines

This paper studies the crew rostering problem with the consideration of multilicense of crewmembers. A 0-1 integer programming model is established to minimize the number of crewmembers used and to maintain the working time balance and the income balance of crewmembers. The method for calculating th...

Full description

Bibliographic Details
Main Author:	Zhiqiang Tian
Format:	Article
Language:	English
Published:	Hindawi Limited 2014-01-01
Series:	Discrete Dynamics in Nature and Society
Online Access:	http://dx.doi.org/10.1155/2014/910569

id	doaj-e030e755686343aa97d22379fe3d7568
record_format	Article
spelling	doaj-e030e755686343aa97d22379fe3d75682020-11-24T22:10:45ZengHindawi LimitedDiscrete Dynamics in Nature and Society1026-02261607-887X2014-01-01201410.1155/2014/910569910569Optimizing Crew Rostering with Multilicense on High-Speed Railway LinesZhiqiang Tian0School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, ChinaThis paper studies the crew rostering problem with the consideration of multilicense of crewmembers. A 0-1 integer programming model is established to minimize the number of crewmembers used and to maintain the working time balance and the income balance of crewmembers. The method for calculating the reasonable cycle schemes is designed by considering the parameters of monthly working time standard and the number and the average working time of crew routes. The order for selecting the optimal cycle scheme is then determined with consideration of the connection relationships between crew routes. According to the characteristics of the problem and the requirements in application, this paper presents the design of an improved ant colony algorithm for solving the optimization model. The reasonableness of the model and the effectiveness of the algorithm are verified by a numerical example with 43 generated crew routes.http://dx.doi.org/10.1155/2014/910569
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Zhiqiang Tian
spellingShingle	Zhiqiang Tian Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines Discrete Dynamics in Nature and Society
author_facet	Zhiqiang Tian
author_sort	Zhiqiang Tian
title	Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines
title_short	Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines
title_full	Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines
title_fullStr	Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines
title_full_unstemmed	Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines
title_sort	optimizing crew rostering with multilicense on high-speed railway lines
publisher	Hindawi Limited
series	Discrete Dynamics in Nature and Society
issn	1026-0226 1607-887X
publishDate	2014-01-01
description	This paper studies the crew rostering problem with the consideration of multilicense of crewmembers. A 0-1 integer programming model is established to minimize the number of crewmembers used and to maintain the working time balance and the income balance of crewmembers. The method for calculating the reasonable cycle schemes is designed by considering the parameters of monthly working time standard and the number and the average working time of crew routes. The order for selecting the optimal cycle scheme is then determined with consideration of the connection relationships between crew routes. According to the characteristics of the problem and the requirements in application, this paper presents the design of an improved ant colony algorithm for solving the optimization model. The reasonableness of the model and the effectiveness of the algorithm are verified by a numerical example with 43 generated crew routes.
url	http://dx.doi.org/10.1155/2014/910569
work_keys_str_mv	AT zhiqiangtian optimizingcrewrosteringwithmultilicenseonhighspeedrailwaylines
_version_	1725806858456793088

Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines

Similar Items