scholarly journals Application of two-phase decomposition algorithm to practical airline crew rostering problem for fair working time

2016 ◽  
Vol 10 (3) ◽  
pp. JAMDSM0036-JAMDSM0036 ◽  
Author(s):  
Tsubasa DOI ◽  
Tatsushi NISHI
2020 ◽  
Author(s):  
László Hajdu ◽  
Attila Tóth ◽  
Miklós Krész

In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.


2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Zhiqiang Tian

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.


Sign in / Sign up

Export Citation Format

Share Document