A construction of rotations-based rosters with a Genetic Algorithm

Boufaied, Chaima; Trabelsi, R.; Masri, Hatem; Krichen, Saoussen

doi:10.1109/cec.2016.7744084

Cited by 5 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In any calendar month, the cumulative duty time cannot exceed 210 hours. Therefore, the constraints of duty time within two different time ranges are defined as (10) and (11), respectively, where cdd i,d refers to the duty time of the crew member c i on the dth day. The range of k in (10) corresponds to all seven consecutive days in a month.…”

Section: Constraint Formulationmentioning

confidence: 99%

“…Lučić and Teodorović [9] measured fairness using the weighted sum of average deviations between the real values and their respective ideal numbers, including monthly flight time, allowances, and the number of weekend days. Boufaied et al [10] proposed balancing three objectives, i.e., the number of flight hours, layovers, and destinations' occurrences.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Multi-Objective Ant Colony System Algorithm for Airline Crew Rostering Problem With Fairness and Satisfaction

Zhou

Zhan

Chen

et al. 2021

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

The airline crew rostering problem (CRP) is significant for balancing the workload of crew and for improving the satisfaction rate of crew's preferences, which is related to the fairness and satisfaction of crew. However, most existing work considers only one objective on fairness or satisfaction. In this study, we propose a new practical model for CRP that takes both fairness and satisfaction into account simultaneously. To solve the multi-objective CRP efficiently, we develop an ant colony system (ACS) algorithm based on the multiple populations for multiple objectives (MPMO) framework, termed multi-objective ACS (MOACS). The main contributions of MOACS lie in three aspects. Firstly, two ant colonies are utilized to optimize fairness and satisfaction objectives, respectively. Secondly, a new hybrid complementary heuristic strategy with three kinds of heuristic information schemes is proposed to avoid ant colonies focusing only on their own objectives. Ant colonies randomly choose one of the three schemes to help explore the Pareto front (PF) sufficiently. Thirdly, a local search strategy with two types of local search respectively for fairness and satisfaction is designed to further approach the global PF. The MOACS is applied to seven real-world monthly CRPs with different sizes from a major North-American airline. Experimental results show that MOACS generally outperforms the greedy algorithm and some other popular multi-objective optimization algorithms, especially on large-scale instances.

show abstract

Section: Constraint Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%