{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T12:18:08Z","timestamp":1769861888405,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T00:00:00Z","timestamp":1586304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T00:00:00Z","timestamp":1586304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12351-020-00563-9","type":"journal-article","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T10:02:56Z","timestamp":1586340176000},"page":"135-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Integer and constraint programming model formulations for flight-gate assignment problem"],"prefix":"10.1007","volume":"22","author":[{"given":"M. Arslan","family":"Ornek","sequence":"first","affiliation":[]},{"given":"Cemalettin","family":"Ozturk","sequence":"additional","affiliation":[]},{"given":"Ipek","family":"Sugut","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,8]]},"reference":[{"issue":"3","key":"563_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BF02936393","volume":"2","author":"A Ballis","year":"2002","unstructured":"Ballis A (2002) Simulation of airport terminal facilities in the Greek airports of Kavala and Alexandroupolis. Oper Res Int Journal 2(3):391\u2013406","journal-title":"Oper Res Int Journal"},{"issue":"1\u20134","key":"563_CR2","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0360-8352(90)90122-3","volume":"19","author":"RA Bihr","year":"1990","unstructured":"Bihr RA (1990) A conceptual solution to the aircraft gate assignment problem using 0,1 linear programming. Comput Ind Eng 19(1\u20134):280\u2013284","journal-title":"Comput Ind Eng"},{"issue":"1","key":"563_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1057\/palgrave.jors.2600655","volume":"50","author":"A Bolat","year":"1999","unstructured":"Bolat A (1999) Assigning arriving flights at an airport to the available gates. J Oper Res Soc 50(1):23\u201334","journal-title":"J Oper Res Soc"},{"key":"563_CR4","first-page":"27","volume":"923859","author":"A Bouras","year":"2014","unstructured":"Bouras A, Ghaleb MA, Suryahatmaja US, Salem AM (2014) The airport gate assignment problem: a survey. Sci World J 923859:27","journal-title":"Sci World J"},{"key":"563_CR5","doi-asserted-by":"publisher","first-page":"12430","DOI":"10.1016\/j.eswa.2012.04.071","volume":"39","author":"C Cheng","year":"2012","unstructured":"Cheng C, Ho SC, Kwan C (2012) The use of meta-heuristics for airport gate assignment. Expert Syst Appl 39:12430\u201312437","journal-title":"Expert Syst Appl"},{"key":"563_CR6","first-page":"1","volume":"53","author":"S de Man","year":"2011","unstructured":"de Man S (2011) Flight to gate assignment: solution methods and complexities at planning horizons. Aerlines 53:1\u20135","journal-title":"Aerlines"},{"key":"563_CR7","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter R (2003) Constraint Processing. Morgan Kaufmann, Burlington"},{"key":"563_CR8","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.asoc.2017.06.004","volume":"59","author":"W Deng","year":"2017","unstructured":"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\u2013302","journal-title":"Appl Soft Comput"},{"issue":"6","key":"563_CR9","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10951-012-0292-y","volume":"15","author":"G Diepen","year":"2012","unstructured":"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\u2013715","journal-title":"J Sched"},{"key":"563_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.cor.2003.12.003","volume":"32","author":"H Ding","year":"2005","unstructured":"Ding H, Lim A, Rodrigues B, Zhu Y (2005) The over-constrained airport gate assignment problem. Comput Oper Res 32:186\u20131880","journal-title":"Comput Oper Res"},{"issue":"4","key":"563_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1080\/07408170701416673","volume":"40","author":"A Drexl","year":"2008","unstructured":"Drexl A, Nikulin Y (2008) Multicriteria airport gate assignment and Pareto simulated annealing. IIE Trans 40(4):385\u2013397","journal-title":"IIE Trans"},{"key":"563_CR12","unstructured":"IBM ILOG CPLEX Optimization Studio (2017). https:\/\/www.ibm.com\/analytics\/cplex-optimizer. Accessed 18 Dec 2017"},{"issue":"6","key":"563_CR13","first-page":"431","volume":"23","author":"J Lee","year":"2016","unstructured":"Lee J, Im H, Kim KH, Xi S, Lee C (2016) Airport gate assignment for improving terminals\u2019 internal gate efficiency. Int J Ind EngTheory Appl Pract 23(6):431\u2013444","journal-title":"Int J Ind EngTheory Appl Pract"},{"key":"563_CR14","unstructured":"Li C (2009) Airport gate assignment. A hybrid model and implementation, http:\/\/arxiv.org\/abs\/0903.2528"},{"key":"563_CR15","unstructured":"Li M (2010) Optimized assignment of civil airport gate. In: Proceedings of the \u0131nternational conference on \u0131ntelligent system design and engineering application (ISDEA\u201910), Changsha, China, pp 33\u201338"},{"issue":"1","key":"563_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10462-004-7190-4","volume":"24","author":"A Lim","year":"2005","unstructured":"Lim A, Rodrigues B, Zhu Y (2005) Airport gate scheduling with time windows. Artif Intell Rev 24(1):5\u201331","journal-title":"Artif Intell Rev"},{"issue":"1","key":"563_CR17","first-page":"26","volume":"23","author":"MA Ornek","year":"2016","unstructured":"Ornek MA, \u00d6zt\u00fcrk C (2016) Optimisation and constraint based heuristic methods for advanced planning and scheduling systems. Int J Ind EngTheory Appl Pract 23(1):26\u201348","journal-title":"Int J Ind EngTheory Appl Pract"},{"key":"563_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.jairtraman.2019.03.005","volume":"77","author":"MA Ornek","year":"2019","unstructured":"Ornek MA, \u00d6zt\u00fcrk C, Sugut I (2019) Model-based heuristic for counter assignment problem with operational constraints: a case study. J Air Transp Manag 77:57\u201364","journal-title":"J Air Transp Manag"},{"key":"563_CR25","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/s10601-013-9142-6","volume":"18","author":"C \u00d6zt\u00fcrk","year":"2013","unstructured":"\u00d6zt\u00fcrk C, Tunal\u0131 S, Hnich B et al (2013) Balancing and scheduling of flexible mixed model assembly lines. Constraints 18:434\u2013469. https:\/\/doi.org\/10.1007\/s10601-013-9142-6","journal-title":"Constraints"},{"issue":"7","key":"563_CR19","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1080\/03088839.2017.1341061","volume":"44","author":"C \u00d6zt\u00fcrk","year":"2017","unstructured":"\u00d6zt\u00fcrk C, Sargut FZ, \u00d6rnek MA, Eliiyi DT (2017) Optimisation and heuristic approaches for assigning inbound containers to outbound carriers. Maritime Policy Manag 44(7):825\u2013836","journal-title":"Maritime Policy Manag"},{"key":"563_CR20","volume-title":"Adaptive and intelligent systems. ICAIS 2011. Lecture notes in computer science","author":"CC Rolf","year":"2011","unstructured":"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"},{"key":"563_CR21","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0022-2496(77)90033-5","volume":"15","author":"TL Saaty","year":"1977","unstructured":"Saaty TL (1977) A Scaling Method for Priorities in Hierarchical Structures. J Math Psychol 15:234\u2013281","journal-title":"J Math Psychol"},{"key":"563_CR22","doi-asserted-by":"publisher","first-page":"4060","DOI":"10.1016\/j.apm.2011.11.030","volume":"36","author":"M Soolaki","year":"2012","unstructured":"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\u20134072","journal-title":"Appl Math Model"},{"key":"563_CR23","unstructured":"S\u00fc\u011f\u00fct I (2016) Optimization approaches for specific airport operations\u201d, unpublished MSc thesis, Izmir University of Economics, Industrial Engineering Department"},{"issue":"2","key":"563_CR24","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ejor.2006.05.002","volume":"180","author":"S Yan","year":"2007","unstructured":"Yan S, Tang CH (2007) A heuristic approach for airport gate assignments for stochastic flight delays. Eur J Oper Res 180(2):547\u2013567","journal-title":"Eur J Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00563-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00563-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00563-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T06:24:11Z","timestamp":1645770251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00563-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,8]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["563"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00563-9","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,8]]},"assertion":[{"value":"16 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}