Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Decision support for crew rostering at NS

Decision support for crew rostering at NS This paper describes a method for solving the cyclic crew rostering problem (CCRP). This is the problem of cyclically ordering a set of duties for a number of crew members, such that several complex constraints are satisfied and such that the quality of the obtained roster is as high as possible. The described method was tested on a number of instances of NS, the largest operator of passenger trains in the Netherlands. These instances involve the generation of rosters for groups of train drivers or conductors of NS. The tests show that high quality solutions for practical instances of the CCRP can be generated in an acceptable amount of computing time. Finally, we describe an experiment where we constructed rosters in an automatic way for a group of conductors. They preferred our—generated—rosters over their own manually constructed rosters. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Public Transport Springer Journals

Decision support for crew rostering at NS

Download PDF
13 pages

Loading next page...
 
/lp/springer-journals/decision-support-for-crew-rostering-at-ns-2oQE1jgHFh

References (11)

Publisher
Springer Journals
Copyright
Copyright © 2009 by The Author(s)
Subject
Business and Management; Operation Research/Decision Theory; Automotive Engineering; Computer-Aided Engineering (CAD, CAE) and Design; Transportation
ISSN
1866-749X
eISSN
1613-7159
DOI
10.1007/s12469-009-0009-6
Publisher site
See Article on Publisher Site

Abstract

This paper describes a method for solving the cyclic crew rostering problem (CCRP). This is the problem of cyclically ordering a set of duties for a number of crew members, such that several complex constraints are satisfied and such that the quality of the obtained roster is as high as possible. The described method was tested on a number of instances of NS, the largest operator of passenger trains in the Netherlands. These instances involve the generation of rosters for groups of train drivers or conductors of NS. The tests show that high quality solutions for practical instances of the CCRP can be generated in an acceptable amount of computing time. Finally, we describe an experiment where we constructed rosters in an automatic way for a group of conductors. They preferred our—generated—rosters over their own manually constructed rosters.

Journal

Public Transport – Springer Journals

Published: May 20, 2009

There are no references for this article.