{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T05:28:04Z","timestamp":1749619684488,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031302282"},{"type":"electronic","value":"9783031302299"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30229-9_4","type":"book-chapter","created":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T19:02:39Z","timestamp":1680980559000},"page":"53-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Evolutionary Hyper-Heuristic for\u00a0Airport Slot Allocation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2052-3290","authenticated-orcid":false,"given":"David","family":"Melder","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6699-8323","authenticated-orcid":false,"given":"John","family":"Drake","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8503-268X","authenticated-orcid":false,"given":"Sha","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,9]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-79305-2_4","volume-title":"Artificial Evolution","author":"M Bader-El-Den","year":"2008","unstructured":"Bader-El-Den, M., Poli, R.: Generating SAT local-search heuristics using a GP hyper-heuristic framework. In: Monmarch\u00e9, N., Talbi, E.-G., Collet, P., Schoenauer, M., Lutton, E. (eds.) EA 2007. LNCS, vol. 4926, pp. 37\u201349. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79305-2_4"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.trc.2017.03.015","volume":"86","author":"U Benlic","year":"2018","unstructured":"Benlic, U.: Heuristic search for allocation of slots at network level. Transp. Res. Part C Emerging Technol. 86, 488\u2013509 (2018)","journal-title":"Transp. Res. Part C Emerging Technol."},{"issue":"12","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"E Burke","year":"2013","unstructured":"Burke, E., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E Burke","year":"2007","unstructured":"Burke, E., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper-heuristic for educational timetabling problems. Eur. J. Oper. Res. 176(1), 177\u2013192 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\/2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1504\/IJRM.2012.044514","volume":"6","author":"L Castelli","year":"2012","unstructured":"Castelli, L., Pellegrini, P., Pesenti, R.: Airport slot allocation in Europe: economic efficiency and fairness. Int. J. Revenue Manage. 6(1\/2), 28\u201344 (2012)","journal-title":"Int. J. Revenue Manage."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Cowling, P., Kendall, G., Han, L.: An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), pp. 1185\u20131190. IEEE (2002)","DOI":"10.1109\/CEC.2002.1004411"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","volume":"285","author":"J Drake","year":"2020","unstructured":"Drake, J., Kheiri, A., \u00d6zcan, E., Burke, E.: Recent advances in selection hyper-heuristics. Eur. J. Oper. Res. 285, 405\u2013428 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR8","unstructured":"Eurocontrol.: European Aviation in 2040 - Annex1: Flight Forecast to 2040. Technical report, Eurocontrol (2018). https:\/\/www.eurocontrol.int\/publication\/challenges-growth-2018"},{"key":"4_CR9","unstructured":"Eurocontrol.: European Aviation in 2040 - Annex4: Network Congestion. Technical report, Eurocontrol (2018). https:\/\/www.eurocontrol.int\/publication\/challenges-growth-2018"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1287\/trsc.2019.0926","volume":"54","author":"J Fairbrother","year":"2020","unstructured":"Fairbrother, J., Zografos, K., Glazebrook, K.: A slot-scheduling mechanism at congested airports that incorporates efficiency, fairness, and airline preferences. Transp. Sci. 54(1), 115\u2013138 (2020)","journal-title":"Transp. Sci."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.tra.2016.10.011","volume":"94","author":"D Gillen","year":"2016","unstructured":"Gillen, D., Jacquillat, A., Odoni, A.: Airport demand management: the operations research and economics perspectives and potential synergies. Transp. Res. Part A Policy Practice 94, 495\u2013513 (2016)","journal-title":"Transp. Res. Part A Policy Practice"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Han, L., Kendall, G., Cowling, P.: An adaptive length chromosome hyper-heuristic genetic algorithm for a trainer scheduling problem. Recent Advances In Simulated Evolution And Learning, pp. 506\u2013525 (2004)","DOI":"10.1142\/9789812561794_0027"},{"key":"4_CR13","unstructured":"IATA, Aci, WWACG: Worldwide Airport Slot Guidelines (WASG). Technical report (2020). https:\/\/www.iata.org\/contentassets\/4ede2aabfcc14a55919e468054d714fe\/wasg-edition-1-english-version.pdf"},{"key":"4_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2021.103039","volume":"126","author":"Y Jiang","year":"2021","unstructured":"Jiang, Y., Zografos, K.: A decision making framework for incorporating fairness in allocating slots at capacity-constrained airports. Transp. Res. Part C Emerg. Technol. 126, 103039 (2021)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10462-016-9466-x","volume":"46","author":"JC Ortiz-Bayliss","year":"2016","unstructured":"Ortiz-Bayliss, J.C., Terashima-Mar\u00edn, H., Conant-Pablos, S.E.: Combine and conquer: an evolutionary hyper-heuristic approach for solving constraint satisfaction problems. Artif. Intell. Rev. 46(3), 327\u2013349 (2016). https:\/\/doi.org\/10.1007\/s10462-016-9466-x","journal-title":"Artif. Intell. Rev."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tre.2016.12.006","volume":"99","author":"P Pellegrini","year":"2017","unstructured":"Pellegrini, P., Boli\u0107, T., Castelli, L., Pesenti, R.: SOSTA: an effective model for the simultaneous optimisation of airport SloT allocation. Transp. Res. Part E Logistics Transp. Rev. 99, 34\u201353 (2017)","journal-title":"Transp. Res. Part E Logistics Transp. Rev."},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1049\/iet-its.2011.0179","volume":"6","author":"P Pellegrini","year":"2012","unstructured":"Pellegrini, P., Castelli, L., Pesenti, R.: Metaheuristic algorithms for the simultaneous slot allocation problem. IET Intel. Transport Syst. 6(4), 453\u2013462 (2012)","journal-title":"IET Intel. Transport Syst."},{"issue":"6","key":"4_CR18","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1287\/trsc.2019.0922","volume":"53","author":"N Ribeiro","year":"2019","unstructured":"Ribeiro, N., Jacquillat, A., Antunes, A.: A large-scale neighborhood search approach to airport slot allocation. Transp. Sci. 53(6), 1772\u20131797 (2019)","journal-title":"Transp. Sci."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.trb.2018.04.005","volume":"112","author":"N Ribeiro","year":"2018","unstructured":"Ribeiro, N., Jacquillat, A., Antunes, A., Odoni, A., Pita, J.: An optimization approach for airport slot allocation under IATA guidelines. Transp. Res. Part B Methodol. 112, 132\u2013156 (2018)","journal-title":"Transp. Res. Part B Methodol."},{"key":"4_CR20","unstructured":"Ribeiro, N., Schmedeman, P., Birolini, S., Jacquillat, A.: Passenger-centric slot allocation at schedule-coordinated airports. SSRN Electron. J., 1\u201343 (2021)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Wang, S., Drake, J., Fairbrother, J., Woodward, J.: A constructive heuristic approach for single airport slot allocation problems. In: 2019 IEEE Symposium Series on Computational Intelligence (SSCI 2019), pp. 1171\u20131178 (2019)","DOI":"10.1109\/SSCI44817.2019.9002892"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tra.2017.09.025","volume":"114","author":"K Zografos","year":"2018","unstructured":"Zografos, K., Androutsopoulos, K., Madas, M.: Minding the gap: optimizing airport schedule displacement and acceptability. Transp. Res. Part A Policy Practice 114, 203\u2013221 (2018)","journal-title":"Transp. Res. Part A Policy Practice"},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-016-0496-7","volume":"20","author":"K Zografos","year":"2017","unstructured":"Zografos, K., Madas, M., Androutsopoulos, K.: Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs. J. Sched. 20(1), 3\u201324 (2017)","journal-title":"J. Sched."},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.trc.2011.10.008","volume":"21","author":"K Zografos","year":"2012","unstructured":"Zografos, K., Salouras, Y., Madas, M.: Dealing with the efficient allocation of scarce resources at congested airports. Transp. Res. Part C Emerg. Technol. 21(1), 244\u2013256 (2012)","journal-title":"Transp. Res. Part C Emerg. Technol."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30229-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T23:02:34Z","timestamp":1729206154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30229-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031302282","9783031302299"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30229-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"78","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":"37","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":"14","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":"47% - 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":"3","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}