Heuristics for Solving the Crew Rostering Problem

2014 ◽  
pp. 67-106 ◽  
Author(s):  
Lin Xie
Keyword(s):  
Crew Rostering ◽  
Crew Rostering Problem

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

2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Zhiqiang Tian ◽  
Huimin Niu
Keyword(s):  
High Speed ◽  
Ant Colony Algorithm ◽  
Set Covering ◽  
Covering Problem ◽  
High Speed Railway ◽  
Crew Rostering ◽  
Crew Rostering Problem ◽  
Plan Making ◽  
Higher Regularity ◽  
Improved Ant Colony Algorithm

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.

Modeling and Solving the Crew Rostering Problem

1998 ◽  
Vol 46 (6) ◽  
pp. 820-830 ◽  
Author(s):  
Alberto Caprara ◽  
Paolo Toth ◽  
Daniele Vigo ◽  
Matteo Fischetti
Keyword(s):  
Crew Rostering ◽  
Crew Rostering Problem

A heuristic procedure for the crew rostering problem

1992 ◽  
Vol 58 (2) ◽  
pp. 272-283 ◽  
Author(s):  
Lucio Bianco ◽  
Maurizio Bielli ◽  
Aristide Mingozzi ◽  
Salvatore Ricciardelli ◽  
Massimo Spadoni
Keyword(s):  
Heuristic Procedure ◽  
Crew Rostering ◽  
Crew Rostering Problem

scholarly journals Is Equality Always Desirable? Analyzing the Trade-Off Between Fairness and Attractiveness in Crew Rostering

2021 ◽  
Author(s):  
Thomas Breugem ◽  
Twan Dollevoet ◽  
Dennis Huisman
Keyword(s):  
Resource Allocation ◽  
Mathematical Formulation ◽  
Utility Functions ◽  
Allocation Problem ◽  
Resource Allocation Problem ◽  
Trade Off ◽  
Crew Rostering ◽  
Solution Approach ◽  
Individual Level ◽  
Crew Rostering Problem

Millions of employees around the world work in irregular rosters. The quality of these rosters is of utmost importance. High-quality rosters should be attractive on an individual level, but also divide the work fairly over the employees. We develop novel methodology to compute the trade-off between fairness and attractiveness in crew rostering. First, we propose an intuitive fairness scheme for crew rostering and analyze its theoretical performance. To do so, we introduce the approximate resource-allocation problem. This extension of the resource-allocation problem provides a framework for analyzing decision making in contexts where one relies on approximations of the utility functions. Fairness is a typical example of such a context due to its inherently subjective nature. We show that the scheme has “optimal” properties for a large class of approximate utility functions. Furthermore, we provide a tight bound on the utility loss for this scheme. We then present a unified approach to crew rostering. This approach integrates our proposed fairness scheme with a novel mathematical formulation for crew rostering. We call the resulting problem the Fairness-Oriented Crew Rostering Problem and develop a dedicated exact Branch-Price-and-Cut solution method. We conclude by applying our solution approach to practical instances from Netherlands Railways, the largest passenger railway operator in the Netherlands. Our computational results confirm the importance of taking the fairness–attractiveness trade-off into account. This paper was accepted by Yinyu Ye, optimization.

scholarly journals Using Differential Evolution Method to Solve Crew Rostering Problem

2010 ◽  
Vol 01 (04) ◽  
pp. 316-325 ◽  
Author(s):  
Budi Santosa ◽  
Andiek Sunarto ◽  
Arief Rahman
Keyword(s):  
Differential Evolution ◽  
Crew Rostering ◽  
Crew Rostering Problem

Solving Balanced Bus Crew Rostering Problem with Genetic Algorithm

2013 ◽  
Vol 361-363 ◽  
pp. 2070-2074
Author(s):  
Ji Hui Ma ◽  
Tao Liu ◽  
Wei Guan
Keyword(s):  
Genetic Algorithm ◽  
Assignment Problem ◽  
Time Horizon ◽  
Real Life ◽  
Reasonable Time ◽  
Crew Rostering ◽  
Proposed Model ◽  
Multi Level ◽  
Crew Rostering Problem ◽  
Total Workload

This paper addresses the balanced bus crew rostering problem (BBCRP). In this problem, the duty assignment to bus crews in a given time horizon should satisfy that the total workload should be evenly distributed. We firstly formulate the problem as a multi-level balanced assignment problem. Then, a genetic algorithm-based approach is designed to solve the proposed model. Finally, a simple numerical example is given to illustrate the application of the approach. Implementation results show that the proposed approach can obtain good quality solutions in a reasonable time and can be applied to real-life BBCRPs.

Research on Bus Crew Rostering Problem Based on Minimum Cost

2013 ◽  
Vol 361-363 ◽  
pp. 1910-1914
Author(s):  
Na Hao ◽  
Rui Song ◽  
Li Zheng ◽  
Ying Zhang
Keyword(s):  
Minimum Cost ◽  
Planning Period ◽  
Urban Transit ◽  
The Sustainable Development ◽  
Optimization Software ◽  
Crew Rostering ◽  
Second Stage ◽  
Basic Concepts ◽  
Crew Rostering Problem ◽  
Two Stages

A feasible, reasonable and fair crew rostering plan is more meaningful for mobilizing the enthusiasm of company crews and improving operation efficiency to promote the sustainable development of urban transit. The basic concepts of the rostering problem are analyzed firstly. Considering one single day off to be interspersed between a planning period of six days, the problem can be divided into two stages. On the first stage, optimization shifts will be carried out by every crew during the planning period without considering the days off. On the second stage, additional crews can substitute for original crews when they are in rest. Then two mathematical models based on crew scheduling problem are established, which are aimed at minimizing cost. Finally, one route is taken as an example and the optimization software LINGO is proposed to solve the model. The result of the test is analyzed in detail, which indicates the practicability of the model.

Sign in / Sign up

Export Citation Format

Share Document