The integrated aircraft routing and crew pairing problem: ILP based formulations

Minimization of cost is very important in airline as great profit is an important objective for any airline system. one way to minimize the costs in airline is by developing an integrated planning process. airline planning consists of many difficult operational decision problems including aircraft routing and crew pairing problems. these two sub-problems,though interrelated in practice,are usually solved sequentially leading to suboptimal solutions. we propose an integrated aircraft routing and crew pairing problem model,one approach to generate the feasible aircraft routes and crew pairs,followed by three approaches to solve the integrated model. the integrated aircraft routing and crew scheduling problem is to determine a minimum cost aircraft routes and crew schedules while each flight leg is covered by one aircraft and one crew. the first approach is an integer programming solution method,the second formulation is developed in a way to lend itself to be used efficiently by dantzig wolfe decomposition whereas the third one is formulated as a benders decomposition method. encouraging results are obtained when tested on four types of aircraft based on local flights in malaysia for one week flight cycle. © 2016 penerbit utm press. all rights reserved.