Abstract
The airline crew pairing problem is one of the optimization problems which classified as a NP-hard problem. Since the number of feasible pairings in flight schedules can be numerous, the exact methods will not efficient to solve the problem. We propose a heuristic method for solving crew pairing problems. Initially, we generate a feasible solution by maximizing the covered flights. Then, we improve the solution by constructing a procedure to avoid the local optimal solution. We test our method to an airline schedules. The computational results show that our method can give the optimal solution in short period of time.
Highlights
The airline crew pairing problem can be modelled as a set covering problem (SCP): min{cx : Ax ≥ 1, x {0,1}}, (1)
We propose a new heuristic method for solving airline crew pairing problem
We propose a heuristic method for solving the crew pairing problem
Summary
The airline crew pairing problem can be modelled as a set covering problem (SCP): min{cx : Ax ≥ 1, x {0,1}},. The first procedure is used to generate a feasible solution and to maximize the covered flights in selected pairings. Based on greedy algorithm by omitting the removing redundant columns procedure, we construct a heuristic algorithm for solving crew pairing optimization problem. According the smallest value of objective function we conclude that our algorithm can give the good solution and it works efficiently, since the computation time of our algorithm for solving the above problems is not up to 4 minutes
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
