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

Saved in:
Bibliographic Details
Main Author: Zhiqiang Tian
Format: Article
Language:English
Published: Wiley 2014-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2014/910569
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832559104274464768
author Zhiqiang Tian
author_facet Zhiqiang Tian
author_sort Zhiqiang Tian
collection DOAJ
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.
format Article
id doaj-art-e030e755686343aa97d22379fe3d7568
institution Kabale University
issn 1026-0226
1607-887X
language English
publishDate 2014-01-01
publisher Wiley
record_format Article
series Discrete Dynamics in Nature and Society
spelling doaj-art-e030e755686343aa97d22379fe3d75682025-02-03T01:30:58ZengWileyDiscrete 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
spellingShingle Zhiqiang Tian
Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines
Discrete Dynamics in Nature and Society
title 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_short Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines
title_sort optimizing crew rostering with multilicense on high speed railway lines
url http://dx.doi.org/10.1155/2014/910569
work_keys_str_mv AT zhiqiangtian optimizingcrewrosteringwithmultilicenseonhighspeedrailwaylines