Fleet assignment problem with integer linear programming (A case study : Nok air airline)
In this research, we use integer linear programming to model the fleet assignment problem. The purpose of this model is to assign the most appropriate fleet types of domestic flight schedules in Nok Air airline and to find the minimized operating cost. In addition, we have determined the optimal number of aircraft grounded overnight at each airport. The results revealed that we found the optimal solution by LINGO with the minimized operating cost and the optimal number of aircraft grounded overnight at each airport.
 Subramanian, R., Scheff, R.P., Quillinan, J.D., Wiper, D.S., Marsten, R.E., Coldstart, “Fleet assignment at Delta Air Lines,” Interfaces, Vol. 24 (1), pp. 104–120, 1994.
 Ozdemir, Y., Basligil, H. and Sarsenov, B., “A large scale integer linear programming to the daily fleet assignment problem: a case study in Turkey,” Procedia-Social and Behavioral Sciences, Vol.62, pp. 849-853, 2012.
 Belanger, N., Desaulniers, G., Soumis, F., & Desrosiers J. “Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues,” European Journal of Operational Research, Vol. 175, pp. 1754-1766, 2006b.
 Bazargan, M., “Airline Operations and Scheduling,” 2nd ed., USA: Ashgate, (Chapter 4), 2004.
 Hane, C.A., Barnhart, C., Johnson, E.L., Marsten, R.E., Nemhauser, G.L., and Sigismondi, G., “The fleet assignment problem : Solving a large-scale
integer program,” Mathematical Programming, Vol. 70, p. 211–32, 1995.
Copyright (c) 2021 Thai Journal of Operations Research : TJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.