{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T21:20:32Z","timestamp":1774473632839,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030876715","type":"print"},{"value":"9783030876722","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87672-2_39","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"594-610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robust Multi-Objective Gate Scheduling at Hub Airports Considering Flight Delays: A Hybrid Metaheuristic Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0383-0379","authenticated-orcid":false,"given":"Abtin","family":"Nourmohammadzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"key":"39_CR1","unstructured":"https:\/\/www.gams.com\/latest\/docs\/s_baron.html"},{"key":"39_CR2","unstructured":"GAMS Development Corporation, General Algebraic Modeling System (GAMS) Release 24.2.1. Washington, DC, USA (2013)"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.trpro.2017.03.061","volume":"22","author":"A Aktel","year":"2017","unstructured":"Aktel, A., Yagmahan, B., \u00d6zcan, T., Yenisey, M.M., Sansarc\u0131, E.: The comparison of the metaheuristic algorithms performances on airport gate assignment problem. Transp. Res. Procedia 22, 469\u2013478 (2017). https:\/\/doi.org\/10.1016\/j.trpro.2017.03.061","journal-title":"Transp. Res. Procedia"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/s0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999). https:\/\/doi.org\/10.1016\/s0167-6377(99)00016-4","journal-title":"Oper. Res. Lett."},{"key":"39_CR5","doi-asserted-by":"publisher","unstructured":"Bergmann, B., Hommel, G.: Improvements of general multiple test procedures for redundant systems of hypotheses. In: Multiple Hypothesenpr\u00fcfung \/ Multiple Hypotheses Testing, pp. 100\u2013115. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/978-3-642-52307-6_8","DOI":"10.1007\/978-3-642-52307-6_8"},{"issue":"16","key":"39_CR6","doi-asserted-by":"publisher","first-page":"12430","DOI":"10.1016\/j.eswa.2012.04.071","volume":"39","author":"CH Cheng","year":"2012","unstructured":"Cheng, C.H., Ho, S.C., Kwan, C.L.: The use of meta-heuristics for airport gate assignment. Expert Syst. Appl. 39(16), 12430\u201312437 (2012). https:\/\/doi.org\/10.1016\/j.eswa.2012.04.071","journal-title":"Expert Syst. Appl."},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.cie.2017.04.042","volume":"109","author":"GS Da\u015f","year":"2017","unstructured":"Da\u015f, G.S.: New multi objective models for the gate assignment problem. Comput. Ind. Eng 109, 347\u2013356 (2017). https:\/\/doi.org\/10.1016\/j.cie.2017.04.042","journal-title":"Comput. Ind. Eng"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"102146","DOI":"10.1016\/j.omega.2019.102146","volume":"92","author":"GS Da\u015f","year":"2020","unstructured":"Da\u015f, G.S., Gzara, F., St\u00fctzle, T.: A review on airport gate assignment problems: single versus multi objective approaches. Omega 92, 102146 (2020). https:\/\/doi.org\/10.1016\/j.omega.2019.102146","journal-title":"Omega"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.trc.2017.03.019","volume":"80","author":"M Dell\u2019Orco","year":"2017","unstructured":"Dell\u2019Orco, M., Marinelli, M., Altieri, M.G.: Solving the gate assignment problem through the fuzzy bee colony optimization. Transp. Res. Part C Emerg. Technol 80, 424\u2013438 (2017). https:\/\/doi.org\/10.1016\/j.trc.2017.03.019","journal-title":"Transp. Res. Part C Emerg. Technol"},{"key":"39_CR10","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., Sun, M., Li, B.: Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment. Appl. Soft Comput. 59, 288\u2013302 (2017). https:\/\/doi.org\/10.1016\/j.asoc.2017.06.004","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"39_CR11","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00291-018-0525-3","volume":"41","author":"B Dijk","year":"2018","unstructured":"Dijk, B., Santos, B.F., Pita, J.P.: The recoverable robust stand allocation problem: a GRU airport case study. OR Spectr. 41(3), 615\u2013639 (2018). https:\/\/doi.org\/10.1007\/s00291-018-0525-3","journal-title":"OR Spectr."},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00291-016-0443-1","volume":"39","author":"U Dorndorf","year":"2016","unstructured":"Dorndorf, U., Jaehn, F., Pesch, E.: Flight gate assignment and recovery strategies with stochastic arrival and departure times. OR Spectr. 39(1), 65\u201393 (2016). https:\/\/doi.org\/10.1007\/s00291-016-0443-1","journal-title":"OR Spectr."},{"issue":"6","key":"39_CR13","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/s0024-6301(99)00075-8","volume":"32","author":"P Freathy","year":"1999","unstructured":"Freathy, P., O\u2019Connell, F.: Planning for profit: the commercialization of European airports. Long Range Plan. 32(6), 587\u2013597 (1999). https:\/\/doi.org\/10.1016\/s0024-6301(99)00075-8","journal-title":"Long Range Plan."},{"issue":"1","key":"39_CR14","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, H.M., Erol, O.K., Eksin, \u0130, Berber, M.F., G\u00fclery\u00fcz, B.O.: A stochastic neighborhood search approach for airport gate assignment problem. Expert Syst. Appl. 39(1), 316\u2013327 (2012). https:\/\/doi.org\/10.1016\/j.eswa.2011.07.021","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"39_CR15","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.: Developing a typology of airport shoppers. Tour. Manag. 25(5), 615\u2013622 (2004). https:\/\/doi.org\/10.1016\/j.tourman.2003.07.003","journal-title":"Tour. Manag."},{"issue":"1","key":"39_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.7494\/csci.2017.18.1.41","volume":"18","author":"I Kaliszewski","year":"2017","unstructured":"Kaliszewski, I., Miroforidis, J., Sta\u0144czak, J.: The airport gate assignment problem multi-objective optimization versus evolutionary multi-objective optimization. Comput. Sci. 18(1), 41\u201352 (2017). https:\/\/doi.org\/10.7494\/csci.2017.18.1.41","journal-title":"Comput. Sci."},{"issue":"7","key":"39_CR17","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1002\/atr.1235","volume":"48","author":"VP Kumar","year":"2013","unstructured":"Kumar, V.P., Bierlaire, M.: Multi-objective airport gate assignment problem in planning and operations. J. Adv. Transp 48(7), 902\u2013926 (2013). https:\/\/doi.org\/10.1002\/atr.1235","journal-title":"J. Adv. Transp"},{"issue":"23","key":"39_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1177\/0361198118781386","volume":"2672","author":"S Mokhtarimousavi","year":"2018","unstructured":"Mokhtarimousavi, S., Talebi, D., Asgari, H.: A non-dominated sorting genetic algorithm approach for optimization of multi-objective airport gate assignment problem. Transp. Res. Rec. J. Transp. Res. Board 2672(23), 59\u201370 (2018). https:\/\/doi.org\/10.1177\/0361198118781386","journal-title":"Transp. Res. Rec. J. Transp. Res. Board"},{"key":"39_CR19","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments. John Wiley & Sons, Inc., Hoboken (2006)"},{"issue":"3","key":"39_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10951-009-0112-1","volume":"13","author":"Y Nikulin","year":"2009","unstructured":"Nikulin, Y., Drexl, A.: Theoretical aspects of multicriteria flight gate scheduling: deterministic and fuzzy models. J. Schedul. 13(3), 261\u2013280 (2009). https:\/\/doi.org\/10.1007\/s10951-009-0112-1","journal-title":"J. Schedul."},{"key":"39_CR21","doi-asserted-by":"publisher","unstructured":"Parsopoulos, K.E., Vrahatis, M.N.: Particle swarm optimization method in multiobjective problems. In: Proceedings of the 2002 ACM symposium on Applied computing (SAC). ACM Press (2002). https:\/\/doi.org\/10.1145\/508791.508907","DOI":"10.1145\/508791.508907"},{"key":"39_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.cie.2018.05.038","volume":"123","author":"M Pternea","year":"2018","unstructured":"Pternea, M., Haghani, A.: Mathematical models for flight-to-gate reassignment with passenger flows: state-of-the-art comparative analysis, formulation improvement, and a new multidimensional assignment model. Comput. Ind. Eng. 123, 103\u2013118 (2018). https:\/\/doi.org\/10.1016\/j.cie.2018.05.038","journal-title":"Comput. Ind. Eng."},{"issue":"1\/2","key":"39_CR23","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1504\/ijam.2011.038293","volume":"1","author":"S Richter","year":"2011","unstructured":"Richter, S., Voss, S., Wulf, J.: A passenger movement forecast and optimisation system for airport terminals. Int. J. Aviat. Manag. 1(1\/2), 58 (2011). https:\/\/doi.org\/10.1504\/ijam.2011.038293","journal-title":"Int. J. Aviat. Manag."},{"key":"39_CR24","doi-asserted-by":"publisher","unstructured":"Riquelme, N., Von L\u00fccken, C., Baran, B.: Performance metrics in multi-objective optimization. In: 2015 Latin American Computing Conference (CLEI), pp. 1\u201311 (2015). https:\/\/doi.org\/10.1109\/CLEI.2015.7360024","DOI":"10.1109\/CLEI.2015.7360024"},{"issue":"8","key":"39_CR25","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1080\/03081060.2017.1355887","volume":"40","author":"ORP van Schaijk","year":"2017","unstructured":"van Schaijk, O.R.P., Visser, H.G.: Robust flight-to-gate assignment using flight presence probabilities. Transp. Plan. Technol 40(8), 928\u2013945 (2017). https:\/\/doi.org\/10.1080\/03081060.2017.1355887","journal-title":"Transp. Plan. Technol"},{"key":"39_CR26","doi-asserted-by":"publisher","unstructured":"Serafini, P.: Simulated annealing for multi objective optimization problems. In: Multiple Criteria Decision Making, pp. 283\u2013292. Springer, New York (1994). https:\/\/doi.org\/10.1007\/978-1-4612-2666-6_29","DOI":"10.1007\/978-1-4612-2666-6_29"},{"issue":"2","key":"39_CR27","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, C.H.: A heuristic approach for airport gate assignments for stochastic flight delays. Eur. J. Oper. Res. 180(2), 547\u2013567 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2006.05.002","journal-title":"Eur. J. Oper. Res."},{"key":"39_CR28","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.eswa.2017.04.050","volume":"84","author":"C Yu","year":"2017","unstructured":"Yu, C., Zhang, D., Lau, H.Y.: An adaptive large neighborhood search heuristic for solving a robust gate assignment problem. Expert Syst. Appl. 84, 143\u2013154 (2017). https:\/\/doi.org\/10.1016\/j.eswa.2017.04.050","journal-title":"Expert Syst. Appl."},{"key":"39_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.cie.2015.12.013","volume":"93","author":"C Yu","year":"2016","unstructured":"Yu, C., Zhang, D., Lau, H.: MIP-based heuristics for solving robust gate assignment problems. Comput. Ind. Eng. 93, 171\u2013191 (2016). https:\/\/doi.org\/10.1016\/j.cie.2015.12.013","journal-title":"Comput. Ind. Eng."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:11:56Z","timestamp":1632258716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}