Skip to main content
Log in

Integer and constraint programming model formulations for flight-gate assignment problem

  • Original paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

Flight-gate assignment problems are complex real world problems involving different constraints. Some of these constraints include plane-gate eligibility, assigning planes of the same airline and planes getting service from the same ground handling companies to adjacent gates, buffers for changes in flight schedules, night stand flights, priority of some gates over others, and so on. In literature there are numerous models to solve this highly complicated problem and tackle its complexity. In this study, first, we propose two different integer programming models, namely, timetabling and assignment based models, and then a scheduling based constraint programming model to solve the problem to optimality. These models prove to be highly efficient in that the computational times are quite short. We also present the results for one day operation of an airport using real data. Finally, we present our conclusions based on our study along with the possible further research.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  • Ballis A (2002) Simulation of airport terminal facilities in the Greek airports of Kavala and Alexandroupolis. Oper Res Int Journal 2(3):391–406

    Article  Google Scholar 

  • Bihr RA (1990) A conceptual solution to the aircraft gate assignment problem using 0,1 linear programming. Comput Ind Eng 19(1–4):280–284

    Article  Google Scholar 

  • Bolat A (1999) Assigning arriving flights at an airport to the available gates. J Oper Res Soc 50(1):23–34

    Article  Google Scholar 

  • Bouras A, Ghaleb MA, Suryahatmaja US, Salem AM (2014) The airport gate assignment problem: a survey. Sci World J 923859:27

    Google Scholar 

  • Cheng C, Ho SC, Kwan C (2012) The use of meta-heuristics for airport gate assignment. Expert Syst Appl 39:12430–12437

    Article  Google Scholar 

  • de Man S (2011) Flight to gate assignment: solution methods and complexities at planning horizons. Aerlines 53:1–5

    Google Scholar 

  • Dechter R (2003) Constraint Processing. Morgan Kaufmann, Burlington

    Google Scholar 

  • Deng W, Zhao H, Yang X, Xiong J, Suna M, Lia B (2017) Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment. Appl Soft Comput 59:288–302

    Article  Google Scholar 

  • Diepen G, van den Akker JM, Hoogeveen JA (2012) Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol. J Sched 15(6):703–715

    Article  Google Scholar 

  • Ding H, Lim A, Rodrigues B, Zhu Y (2005) The over-constrained airport gate assignment problem. Comput Oper Res 32:186–1880

    Article  Google Scholar 

  • Drexl A, Nikulin Y (2008) Multicriteria airport gate assignment and Pareto simulated annealing. IIE Trans 40(4):385–397

    Article  Google Scholar 

  • IBM ILOG CPLEX Optimization Studio (2017). https://www.ibm.com/analytics/cplex-optimizer. Accessed 18 Dec 2017

  • Lee J, Im H, Kim KH, Xi S, Lee C (2016) Airport gate assignment for improving terminals’ internal gate efficiency. Int J Ind EngTheory Appl Pract 23(6):431–444

    Google Scholar 

  • Li C (2009) Airport gate assignment. A hybrid model and implementation, http://arxiv.org/abs/0903.2528

  • Li M (2010) Optimized assignment of civil airport gate. In: Proceedings of the ınternational conference on ıntelligent system design and engineering application (ISDEA’10), Changsha, China, pp 33–38

  • Lim A, Rodrigues B, Zhu Y (2005) Airport gate scheduling with time windows. Artif Intell Rev 24(1):5–31

    Article  Google Scholar 

  • Ornek MA, Öztürk C (2016) Optimisation and constraint based heuristic methods for advanced planning and scheduling systems. Int J Ind EngTheory Appl Pract 23(1):26–48

    Google Scholar 

  • Ornek MA, Öztürk C, Sugut I (2019) Model-based heuristic for counter assignment problem with operational constraints: a case study. J Air Transp Manag 77:57–64

    Article  Google Scholar 

  • Öztürk C, Tunalı S, Hnich B et al (2013) Balancing and scheduling of flexible mixed model assembly lines. Constraints 18:434–469. https://doi.org/10.1007/s10601-013-9142-6

    Article  Google Scholar 

  • Öztürk C, Sargut FZ, Örnek MA, Eliiyi DT (2017) Optimisation and heuristic approaches for assigning inbound containers to outbound carriers. Maritime Policy Manag 44(7):825–836

    Article  Google Scholar 

  • Rolf CC, Kuchcinski K (2011) Distributed constraint programming with agents. In: Bouchachia A (ed) Adaptive and intelligent systems. ICAIS 2011. Lecture notes in computer science, vol 6943. Springer, Berlin

    Google Scholar 

  • Saaty TL (1977) A Scaling Method for Priorities in Hierarchical Structures. J Math Psychol 15:234–281

    Article  Google Scholar 

  • Soolaki M, Mahdavi I, Mahdavi-Amiri N, Hassanzadeh R, Agjajani A (2012) A new linear programming approach and genetic algorithm for solving airline boarding problem. Appl Math Model 36:4060–4072

    Article  Google Scholar 

  • Süğüt I (2016) Optimization approaches for specific airport operations”, unpublished MSc thesis, Izmir University of Economics, Industrial Engineering Department

  • Yan S, Tang CH (2007) A heuristic approach for airport gate assignments for stochastic flight delays. Eur J Oper Res 180(2):547–567

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cemalettin Ozturk.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix 1: numerical results

Appendix 1: numerical results

See Tables 8 and 9.

Table 8 The arrival, original departure and departure with extra periods of the flights and the ground service data of flights
Table 9 The optimal assignment of flights on each gate for the Timetabling based integer programming model

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ornek, M.A., Ozturk, C. & Sugut, I. Integer and constraint programming model formulations for flight-gate assignment problem. Oper Res Int J 22, 135–163 (2022). https://doi.org/10.1007/s12351-020-00563-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-020-00563-9

Keywords

Navigation