Hits : 33
Optimization Model for an Airline Crew Rostering Problem: Case of Garuda Indonesia
Rieske Hadianti1, Khusnul Novianingsih1,2, Saladin Uttunggadewa1, Kuntjoro A. Sidarto1, Novriana Sumarti1 & Edy Soewono1
1Department of Mathematics, Institut Teknologi Bandung, Jalan Ganesha No. 10 Bandung 40132, Indonesia
2Department of Mathematics, Universitas Pendidikan Indonesia, Jalan Dr. Setiabudhi No. 229 Bandung 40154, Indonesia
Email: hadianti@math.itb.ac.id
Abstract. 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.
Keywords: crew pairing; crew labor regulation; crew rostering; crew scheduling; optimization; simulated annealing.
 Download Article
|
