In this paper the Crew Rostering Problem (CRP) from a Brazilian public transit company is modeled and solved by a Genetic Algorithm (GA). The CRP consists of assigning duties on weekdays, Saturdays and Sundays to the crew members of a company over a given planning horizon, minimizing the number of crews and also balancing the workload of the crews, reducing the total number of accumulated overtime and idle time for each crew, subject to a set of operational and legal constraints. The CRP is solved in two stages: defining the sequence of working and rest periods, and defining the daily assignment to be performed in each working period by each employee. The GA was tested with data from a medium sized Brazilian company and was shown to be efficient.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Genetic Algorithm for the mass transit crew rostering problem


    Contributors:


    Publication date :

    2016-11-01


    Size :

    270217 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Lifestyle Rostering for Rail Transit Crew

    American Public Transportation Association | British Library Conference Proceedings | 2007


    A New Approach for the Crew Rostering Problem

    Catanas, F. / Paixao, J. M. P. / University of Lisbon et al. | British Library Conference Proceedings | 1995


    Airline Crew Rostering: Problem Types, Modeling, and Optimization

    Kohl, Niklas / Karisch, Stefan E. | Springer Verlag | 2004



    Short-Haul Airline Crew Rostering by Using Inequality-Based Multiobjective Genetic Algorithm

    Jeng, Chi-Ruey / Liu, Tung-Kuan / Chang, Yu-Hern | Transportation Research Record | 2008