{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T03:55:04Z","timestamp":1771473304376,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T00:00:00Z","timestamp":1531958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001831","name":"Delft University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001831","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00291-018-0525-3","type":"journal-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T13:15:38Z","timestamp":1532006138000},"page":"615-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["The recoverable robust stand allocation problem: a GRU airport case study"],"prefix":"10.1007","volume":"41","author":[{"given":"Bert","family":"Dijk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno F.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joao P.","family":"Pita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"issue":"1","key":"525_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1061\/(ASCE)0733-947X(1984)110:1(55)","volume":"110","author":"O Babi\u0107","year":"1984","unstructured":"Babi\u0107 O, Teodorovi\u0107 D, To\u0161i\u0107 V (1984) Aircraft stand assignment to minimize walking. J Transp Eng 110(1):55\u201366","journal-title":"J Transp Eng"},{"key":"525_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton"},{"issue":"1","key":"525_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2014","unstructured":"Bertsimas D, Sim M (2014) The price of robustness. Oper Res 52(1):35\u201353","journal-title":"Oper Res"},{"issue":"1\u20134","key":"525_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0360-8352(90)90122-3","volume":"19","author":"R Bihr","year":"1990","unstructured":"Bihr R (1990) A conceptual solution to the aircraft gate assignment problem using 0, 1 linear programming. J Comput Ind Eng 19(1\u20134):280\u2013284","journal-title":"J Comput Ind Eng"},{"issue":"1","key":"525_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0377-2217(98)00375-0","volume":"120","author":"A Bolat","year":"2000","unstructured":"Bolat A (2000) Procedures for providing robust gate assignments for arriving aircrafts. Eur J Oper Res 120(1):63\u201380","journal-title":"Eur J Oper Res"},{"key":"525_CR6","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/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. \n                    https:\/\/doi.org\/10.1155\/2014\/923859","journal-title":"Sci World J"},{"key":"525_CR7","unstructured":"Braaksma J (1977) Reducing walking distances at existing airports. In: Airport Forum, vol\u00a07"},{"issue":"16","key":"525_CR8","doi-asserted-by":"publisher","first-page":"12,430","DOI":"10.1016\/j.eswa.2012.04.071","volume":"39","author":"CH Cheng","year":"2012","unstructured":"Cheng CH, Ho SC, Kwan CL (2012) The use of meta-heuristic for airport gate assignment. Expert Syst Appl 39(16):12,430\u201312,437","journal-title":"Expert Syst Appl"},{"key":"525_CR9","unstructured":"D\u2019Angelo G, Di Stefano G, Navarra A, Pinotti CM (2011) Recoverable robust timetables on trees. In: Proceedings on 3rd international conference on combinatorial optimization and applications, Lecture notes in computer science, vol 5573. Springer, Huangshan, pp 433\u2013446"},{"issue":"6","key":"525_CR10","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10951-012-0292-y","volume":"15","author":"G Diepen","year":"2012","unstructured":"Diepen G, den Akker JM, Hoogeveen JA, Smeltink JW (2012) Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol. J Sched 15(6):703\u2013715","journal-title":"J Sched"},{"issue":"3","key":"525_CR11","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.omega.2005.07.001","volume":"35","author":"U Dorndorf","year":"2007","unstructured":"Dorndorf U, Drexl A, Nikulin Y, Pesch E (2007) Flight gate scheduling: state-of-the-art and recent developments. Omega 35(3):326\u2013334","journal-title":"Omega"},{"issue":"3","key":"525_CR12","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1287\/trsc.1070.0211","volume":"42","author":"U Dorndorf","year":"2008","unstructured":"Dorndorf U, Jaehn F, Pesch E (2008) Modelling robust flight-gate scheduling as a clique partitioning problem. Transp Sci 42(3):292\u2013301","journal-title":"Transp Sci"},{"issue":"1","key":"525_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10479-010-0809-8","volume":"194","author":"U Dorndorf","year":"2012","unstructured":"Dorndorf U, Jaehn F, Pesch E (2012) Flight gate scheduling with respect to a reference schedule. Ann Oper Res 194(1):177\u2013187","journal-title":"Ann Oper Res"},{"issue":"1","key":"525_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00291-016-0443-1","volume":"39","author":"U Dorndorf","year":"2017","unstructured":"Dorndorf U, Jaehn F, Pesch E (2017) Flight gate assignment and recovery strategies with stochastic arrival and departure times. OR Spectrum 39(1):65\u201393","journal-title":"OR Spectrum"},{"issue":"4","key":"525_CR15","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"},{"issue":"3","key":"525_CR16","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/trsc.2013.0463","volume":"48","author":"G Froyland","year":"2013","unstructured":"Froyland G, Maher SJ, Wu CL (2013) The recoverable robust tail assignment problem. Transp Sci 48(3):351\u2013372","journal-title":"Transp Sci"},{"issue":"1","key":"525_CR17","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.eswa.2011.07.021","volume":"39","author":"HM Gen\u00e7","year":"2012","unstructured":"Gen\u00e7 HM, Erol OK, Eksin I, Berber MF (2012) A stochastic neighborhood search approach for airport gate assignment problem. Expert Syst Appl 39(1):316\u2013327","journal-title":"Expert Syst Appl"},{"issue":"5","key":"525_CR18","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.tourman.2003.07.003","volume":"25","author":"M Geuens","year":"2004","unstructured":"Geuens M, Vantomme D, Brengman M (2004) Developing a typology of airport shoppers. Tour Manag 25(5):615\u2013622","journal-title":"Tour Manag"},{"issue":"3","key":"525_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jairtraman.2008.11.004","volume":"15","author":"A Graham","year":"2009","unstructured":"Graham A (2009) How important are commercial revenues to today\u2019s airports? J Air Transp Manag 15(3):106\u2013111","journal-title":"J Air Transp Manag"},{"key":"525_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.04.040","author":"J Gu\u00e9pet","year":"2015","unstructured":"Gu\u00e9pet J, Acuna-Agost R, Briant O, Gayon JP (2015) Exact and heuristic approach to the airport stand allocation problem. Eur J Oper Res. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2015.04.040","journal-title":"Eur J Oper Res"},{"issue":"10","key":"525_CR21","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1007\/s11573-010-0396-9","volume":"80","author":"F Jaehn","year":"2010","unstructured":"Jaehn F (2010) Solving the flight gate assignment problem using dynamic programming. Z Betr 80(10):1027\u20131039","journal-title":"Z Betr"},{"issue":"2","key":"525_CR22","doi-asserted-by":"publisher","first-page":"467","DOI":"10.2514\/1.57022","volume":"36","author":"SH Kim","year":"2013","unstructured":"Kim SH, Feron E, Clarke JP (2013) Gate assignment to minimize passenger transit time and aircraft taxi time. J Guid Control Dyn 36(2):467\u2013475","journal-title":"J Guid Control Dyn"},{"issue":"7","key":"525_CR23","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1002\/atr.1235","volume":"48","author":"P Kumar","year":"2014","unstructured":"Kumar P, Bierlaire M (2014) Multi-objective airport gate assignment problem in planning and operations. J Adv Transp 48(7):902\u2013926","journal-title":"J Adv Transp"},{"key":"525_CR24","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-05465-5_1","volume-title":"Robust and online large scale optimization: models and techniques for transportation systems","author":"C Liebchen","year":"2009","unstructured":"Liebchen C, L\u00fcbbecke M, M\u00f6hring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja RK, M\u00f6hring RH, Zaroliagis CD (eds) Robust and online large scale optimization: models and techniques for transportation systems, vol 5868. Lecture notes in computer science. Springer, Berlin, pp 1\u201327"},{"key":"525_CR25","doi-asserted-by":"crossref","unstructured":"Lim A, Wang F (2005) Robust airport gate assignment. In: Proceedings of the 17th IEEE international conference on tools with artificial intelligence. IEEE, Hong Kong, pp 74\u201381","DOI":"10.1109\/ICTAI.2005.110"},{"issue":"June","key":"525_CR26","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.tourman.2012.09.017","volume":"36","author":"YH Lin","year":"2013","unstructured":"Lin YH, Chen CF (2013) Passengers\u2019 shopping motivations and commercial activities at airports\u2014the moderating effects of time pressure and impulse buying tendency. Tour Manag 36(June):426\u2013434","journal-title":"Tour Manag"},{"issue":"1","key":"525_CR27","doi-asserted-by":"publisher","first-page":"121132","DOI":"10.1016\/j.ejor.2016.05.021","volume":"255","author":"N L\u00f6hndorf","year":"2016","unstructured":"L\u00f6hndorf N (2016) An empirical analysis of scenario generation methods for stochastic optimization. Eur J Oper Res 255(1):121132","journal-title":"Eur J Oper Res"},{"issue":"4","key":"525_CR28","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1016\/j.cie.2012.06.020","volume":"63","author":"B Maharjan","year":"2012","unstructured":"Maharjan B, Matis T (2012) Multi-commodity flow network model of the flight gate assignment problem. Comput Ind Eng 63(4):1135\u20131144","journal-title":"Comput Ind Eng"},{"issue":"2","key":"525_CR29","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/trsc.19.2.173","volume":"19","author":"R Mangoubi","year":"1985","unstructured":"Mangoubi R, Mathaisel D (1985) Optimizing gate assignments at airport terminals. Transp Sci 19(2):173\u2013188","journal-title":"Transp Sci"},{"issue":"2","key":"525_CR30","first-page":"438","volume":"48","author":"M Seker","year":"2012","unstructured":"Seker M, Noyan N (2012) Stochastic optimization models for the airport gate assignment problem. Transp Res 48(2):438\u2013459","journal-title":"Transp Res"},{"issue":"1","key":"525_CR31","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0360-8352(88)90034-4","volume":"14","author":"G Vanderstraeten","year":"1988","unstructured":"Vanderstraeten G, Bergeron M (1988) Automatic assignment of aircraft to gates in a terminal. Comput Ind Eng 14(1):15\u201325","journal-title":"Comput Ind Eng"},{"key":"525_CR32","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.trb.2017.09.013","volume":"105","author":"L Xu","year":"2017","unstructured":"Xu L, Zhang C, Xiao F, Wang F (2017) A robust approach to airport gate assignment with a solution-dependent uncertainty budget. Transp Res B Methodol 105:458\u2013478","journal-title":"Transp Res B Methodol"},{"issue":"5","key":"525_CR33","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0965-8564(99)00065-8","volume":"35","author":"S Yan","year":"2001","unstructured":"Yan S, Huo CM (2001) Optimization of multiple objective gate assignments. Transp Res A Policy Pract 35(5):413\u2013432","journal-title":"Transp Res A Policy Pract"},{"issue":"2","key":"525_CR34","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"},{"issue":"10","key":"525_CR35","first-page":"885","volume":"36","author":"S Yan","year":"2002","unstructured":"Yan S, Shieh CY, Chen M (2002) A simulation framework for evaluating airport gate assignments. Transp Res A 36(10):885\u2013898","journal-title":"Transp Res A"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0525-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-018-0525-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0525-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T21:06:12Z","timestamp":1589922372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-018-0525-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,19]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["525"],"URL":"https:\/\/doi.org\/10.1007\/s00291-018-0525-3","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,19]]},"assertion":[{"value":"16 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}