z-logo
open-access-imgOpen Access
Optimization Model for an Airline Crew Rostering Problem: Case of Garuda Indonesia
Author(s) -
Rieske Hadianti,
Khusnul Novianingsih,
Saladin Uttunggadewa,
Kunjtoro A. Sidarto,
Novriana Sumarti,
Edy Soewono
Publication year - 2014
Publication title -
journal of mathematical and fundamental sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.216
H-Index - 12
eISSN - 2337-5760
pISSN - 2338-5510
DOI - 10.5614/j.math.fund.sci.2013.45.3.2
Subject(s) - cockpit , crew , simulated annealing , operations research , crew scheduling , computer science , aeronautics , business , operations management , engineering , algorithm
This paper discusses the cockpit crew rostering problem at Garuda Indonesia, taking into account a number of internal cockpit crew labor regulations. These internal labor regulations are in general more restrictive at Garuda Indonesia than at other airlines, so that modeling the cockpit crew rostering problem for Garuda Indonesia is challenging. We have derived mathematical expressions for the cockpit crew labor regulations and some technical matters. We model a non-linear integer programming for the rostering problem, using the average relative deviation of total flight time to the ideal flight time as the objective function. The optimization model have been tested for all classes of cockpit crews of Garuda Indonesia, using a simulated annealing method for solving the problem. We obtained satisfactory rosters for all crew members in a short amount of computing time. This shows that the optimization problem is well-defined.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom