A dynamic constraint aggregation based solution approach for monthly aircrew pairing problem

This paper presents a method based on dynamic constraint aggregation concept to solve the monthly crew pairing problem which consists of determining a minimum cost set of feasible pairings such that each flight is covered exactly once and side constraints are satisfied. Given its high complexity, This problem is traditionally decomposed in three problems (daily, weekly and monthly) that are solved sequentially. Compared to sequential approach, the dynamic constraint aggregation method produces solutions with less cost and more robust where the monthly crew pairing problem is solved globally.