Skip to main content

The Integrated Aircraft Routing and Crew Pairing Problem: ILP Based Formulations

Mohamed, Nurul Farihan, Zainuddin, Zaitul Marlizawati, Salhi, Said, Mohamed, Nurul Akmal (2016) The Integrated Aircraft Routing and Crew Pairing Problem: ILP Based Formulations. Jurnal Teknologi, 78 (6-5). pp. 79-85. ISSN 0127-9696. (KAR id:60573)

PDF Publisher pdf
Language: English

Download (277kB) Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL


Minimization of cost is very important in airline as great profit is an important objective for

planning process. Airline planning consists of many difficult operational decision problems

interrelated in practice, are usually solved sequentially leading to suboptimal solutions. We

generate the feasible aircraft routes and crew pairs, followed by three approaches to

is to determine a minimum cost aircraft routes and crew schedules while each flight leg is

solution method, the second formulation is developed in a way to lend itself to be used

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.

Item Type: Article
Uncontrolled keywords: Aircraft routing problem, crew pairing problem, integer linear programming, constructive heuristic method
Divisions: Divisions > Kent Business School - Division > Kent Business School (do not use)
Divisions > Kent Business School - Division > Centre for Logistics and Heuristic Optimisation (do not use)
Depositing User: Said Salhi
Date Deposited: 27 Feb 2017 17:01 UTC
Last Modified: 16 Feb 2021 13:43 UTC
Resource URI: (The current URI for this page, for reference purposes)
Salhi, Said:
  • Depositors only (login required):


Downloads per month over past year