{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:34:50Z","timestamp":1764304490346,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61463007","61563008"],"award-info":[{"award-number":["61463007","61563008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10586-018-2051-0","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T19:32:11Z","timestamp":1519414331000},"page":"1543-1560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Flower pollination algorithm with runway balance strategy for the aircraft landing scheduling problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Guo","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yongquan","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,23]]},"reference":[{"key":"2051_CR1","unstructured":"Tragale, R.: Annual traffic report. http:\/\/www.panynj.gov\/airports\/pdf-traffic\/ATR2012.pdf (2012). Retrieved 24 July 2013"},{"key":"2051_CR2","unstructured":"Marcell, C.: Preliminary 2012 world airport traffic and rankings. http:\/\/www.aci.aero\/News\/Releases\/MostRecent\/2013\/03\/26\/Preliminary-2012-World-Airport-Traffic-and-Rankings (2012). Retrieved 24 July 2013"},{"key":"2051_CR3","unstructured":"Airports Council International: Annual traffic data http:\/\/www.airports.org\/ (2009). Accessed 24 Sept 2009"},{"issue":"2","key":"2051_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/trsc.34.2.180.12302","volume":"34","author":"JE Beasley","year":"2000","unstructured":"Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., et al.: Scheduling aircraft landings\u2014the static case. Transp. Sci. 34(2), 180\u2013197 (2000)","journal-title":"Transp. Sci."},{"issue":"2","key":"2051_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2004.09.040","volume":"171","author":"H Pinol","year":"2006","unstructured":"Pinol, H., Beasley, J.E.: Scatter search and bionomic algorithms for the aircraft landing problem. Eur. J. Oper. Res. 171(2), 439\u2013462 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"2051_CR6","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29, 653\u2013684 (2000)","journal-title":"Control Cybern."},{"issue":"3","key":"2051_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<229::AID-NET8>3.0.CO;2-W","volume":"34","author":"AT Ernst","year":"1999","unstructured":"Ernst, A.T., Krishnamoorthy, M., Storer, R.H.: Heuristic and exact algorithms for scheduling aircraft landings. Networks 34(3), 229\u2013241 (1999)","journal-title":"Networks"},{"issue":"3","key":"2051_CR8","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0305-0548(02)00228-9","volume":"31","author":"JV Hansen","year":"2004","unstructured":"Hansen, J.V.: Genetic search methods in air traffic control. Comput. Oper. Res. 31(3), 445\u2013459 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2051_CR9","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1016\/j.ejor.2006.01.002","volume":"177","author":"N B\u00e4uerle","year":"2007","unstructured":"B\u00e4uerle, N., Engelhardt-Funke, O., Kolonko, M.: On the waiting time of arriving aircrafts and the capacity of airports with one or two runways. Eur. J. Oper. Res. 177(2), 1180\u20131196 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2051_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.cor.2007.09.005","volume":"36","author":"XB Hu","year":"2009","unstructured":"Hu, X.B., Di Paolo, E.: An efficient genetic algorithm with uniform crossover for air traffic control. Comput. Oper. Res. 36(1), 245\u2013259 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2051_CR11","doi-asserted-by":"publisher","first-page":"224","DOI":"10.7763\/IJCTE.2011.V3.309","volume":"3","author":"G Bencheikh","year":"2011","unstructured":"Bencheikh, G., Boukachour, J., Alaoui, A.E.H.: Improved ant colony algorithm to solve the aircraft landing problem. Int. J. Comput. Theory Eng. 3(2), 224\u2013233 (2011)","journal-title":"Int. J. Comput. Theory Eng."},{"issue":"1","key":"2051_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.cor.2012.06.004","volume":"40","author":"A Salehipour","year":"2013","unstructured":"Salehipour, A., Modarres, M., Naeni, L.M.: An efficient hybrid meta-heuristic for aircraft landing problem. Comput. Oper. Res. 40(1), 207\u2013213 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"2051_CR13","doi-asserted-by":"publisher","first-page":"3485","DOI":"10.1016\/j.asoc.2011.01.022","volume":"11","author":"SP Yu","year":"2011","unstructured":"Yu, S.P., Cao, X.B., Zhang, J.: A real-time schedule method for Aircraft Landing Scheduling problem based on Cellular Automation. Appl. Soft Comput. 11(4), 3485\u20133493 (2011)","journal-title":"Appl. Soft Comput."},{"key":"2051_CR14","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume-title":"Flower Pollination Algorithm for Global Optimization. Unconventional Computation and Natural Computation","author":"XS Yang","year":"2012","unstructured":"Yang, X.S.: Flower Pollination Algorithm for Global Optimization. Unconventional Computation and Natural Computation, pp. 240\u2013249. Springer, Berlin (2012)"},{"key":"2051_CR15","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.procs.2013.05.251","volume":"18","author":"XS Yang","year":"2013","unstructured":"Yang, X.S., Karamanoglu, M., He, X.: Multi-objective flower algorithm for optimization. Procedia Comput. Sci. 18, 861\u2013868 (2013)","journal-title":"Procedia Comput. Sci."},{"issue":"9","key":"2051_CR16","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1080\/0305215X.2013.832237","volume":"46","author":"XS Yang","year":"2014","unstructured":"Yang, X.S., Karamanoglu, M., He, X.: Flower pollination algorithm: a novel approach for multiobjective optimization. Eng. Optim. 46(9), 1222\u20131237 (2014)","journal-title":"Eng. Optim."},{"issue":"3","key":"2051_CR17","first-page":"54","volume":"4","author":"M Sharawi","year":"2014","unstructured":"Sharawi, M., Emary, E., Saroit, I.A., et al.: Flower pollination optimization algorithm for wireless sensor network lifetime global optimization. Int. J. Soft Comput. Eng. 4(3), 54\u201359 (2014)","journal-title":"Int. J. Soft Comput. Eng."},{"issue":"2","key":"2051_CR18","first-page":"1009","volume":"6","author":"R Prathiba","year":"2014","unstructured":"Prathiba, R., Moses, M.B., Sakthivel, S.: Flower pollination algorithm applied for different economic load dispatch problems. Int. J. Eng. Technol. 6(2), 1009\u20131016 (2014)","journal-title":"Int. J. Eng. Technol."},{"key":"2051_CR19","doi-asserted-by":"publisher","first-page":"38","DOI":"10.5815\/ijmecs.2014.03.05","volume":"6","author":"O Abdel-Raouf","year":"2014","unstructured":"Abdel-Raouf, O., El-Henawy, I., Abdel-Baset, M.: A novel hybrid flower pollination algorithm with chaotic harmony search for solving sudoku puzzles. J. Mod. Educ. Comput. Sci. 6, 38\u201344 (2014)","journal-title":"J. Mod. Educ. Comput. Sci."},{"issue":"3","key":"2051_CR20","first-page":"72","volume":"8","author":"I El-henawy","year":"2014","unstructured":"El-henawy, I., Ismail, M.: An improved chaotic flower pollination algorithm for solving large integer programming problems. Int. J. Digit. Content Technol. Appl. 8(3), 72 (2014)","journal-title":"Int. J. Digit. Content Technol. Appl."},{"issue":"2","key":"2051_CR21","first-page":"1","volume":"4","author":"O Abdel-Raouf","year":"2014","unstructured":"Abdel-Raouf, O., Abdel-Baset, M., El-henawy, I.: A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int. J. Appl. 4(2), 1\u201313 (2014)","journal-title":"Int. J. Appl."},{"issue":"2","key":"2051_CR22","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1504\/IJMMNO.2017.086795","volume":"8","author":"M Abdel-Baset","year":"2017","unstructured":"Abdel-Baset, M., Wu, H., Zhou, Y.: A complex encoding flower pollination algorithm for constrained engineering optimisation problems. IJMNO 8(2), 108\u2013126 (2017)","journal-title":"IJMNO"},{"key":"2051_CR23","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.neucom.2015.01.110","volume":"188","author":"Y Zhou","year":"2016","unstructured":"Zhou, Y., Wang, R., Luo, Q.: Elite opposition-based flower pollination algorithm. Neurocomputing 188, 294\u2013310 (2016)","journal-title":"Neurocomputing"},{"issue":"4","key":"2051_CR24","first-page":"1659010","volume":"30","author":"Y Zhou","year":"2016","unstructured":"Zhou, Y., Wang, R.: An improved flower pollination algorithm for optimal unmanned undersea vehicle path planning problem. IJPRAI 30(4), 1659010 (2016)","journal-title":"IJPRAI"},{"issue":"1","key":"2051_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2015.08.007","volume":"116","author":"R Wang","year":"2016","unstructured":"Wang, R., Zhou, Y., Qiao, S., Huang, K.: Flower pollination algorithm with bee pollinator for cluster analysis. Inf. Process. Lett. 116(1), 1\u201314 (2016)","journal-title":"Inf. Process. Lett."},{"key":"2051_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2524-0","author":"Y Zhou","year":"2016","unstructured":"Zhou, Y., Zhang, S., Luo, Q., Wen, C.: Using flower pollination algorithm and atomic potential function for shape matching. Neural Comput. Appl. (2016). https:\/\/doi.org\/10.1007\/s00521-016-2524-0","journal-title":"Neural Comput. Appl."},{"key":"2051_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-3176-4","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Wang, R., Zhao, C., Luo, Q., Metwally, M.A.: Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput. Appl. (2017). https:\/\/doi.org\/10.1007\/s00521-017-3176-4","journal-title":"Neural Comput. Appl."},{"key":"2051_CR28","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1086\/466660","volume":"12","author":"ME Levine","year":"1969","unstructured":"Levine, M.E.: Landing fees and the airport congestion problem. J. Law Econ. 12, 79\u2013108 (1969)","journal-title":"J. Law Econ."},{"key":"2051_CR29","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jairtraman.2014.06.009","volume":"40","author":"S Vadlamani","year":"2014","unstructured":"Vadlamani, S., Hosseini, S.: A novel heuristic approach for solving aircraft landing problem with single runway. J. Air Transp. Manag. 40, 144\u2013148 (2014)","journal-title":"J. Air Transp. Manag."},{"key":"2051_CR30","unstructured":"Mesgarpour, M., Potts, C.N., Bennell, J.A.: Models for aircraft landing optimization. In: Proceedings of the 4th International Conference on Research in Air Transportation (ICRAT2010) (2010)"},{"issue":"1","key":"2051_CR31","first-page":"16","volume":"17","author":"TS Abdul-Razaq","year":"2015","unstructured":"Abdul-Razaq, T.S., Ali, F.H.: Hybrid bees algorithm to solve aircraft landing problem. J. Zankoy Sulaimani. 17(1), 16\u201326 (2015)","journal-title":"J. Zankoy Sulaimani."},{"issue":"1","key":"2051_CR32","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8(1), 687\u2013697 (2008)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"2051_CR33","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., et al.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(1), 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"issue":"1","key":"2051_CR34","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.amc.2007.03.046","volume":"193","author":"K Deep","year":"2007","unstructured":"Deep, K., Thakur, M.: A new mutation operator for real coded genetic algorithms. Appl. Math. Comput. 193(1), 211\u2013230 (2007)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"2051_CR35","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1109\/TEVC.2008.2009457","volume":"13","author":"S Das","year":"2009","unstructured":"Das, S., Abraham, A., Chakraborty, U.K., et al.: Differential evolution using a neighborhood-based mutation operator. IEEE Trans. Evol. Comput. 13(3), 526\u2013553 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"2051_CR36","doi-asserted-by":"publisher","first-page":"020505","DOI":"10.1103\/PhysRevLett.109.020505","volume":"109","author":"AJ Daley","year":"2012","unstructured":"Daley, A.J., Pichler, H., Schachenmayer, J., et al.: Measuring entanglement growth in quench dynamics of bosons in an optical lattice. Phys. Rev. Lett. 109(2), 020505 (2012)","journal-title":"Phys. Rev. Lett."},{"issue":"9","key":"2051_CR37","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.1093\/icesjms\/fsq116","volume":"67","author":"JM Rocha Da","year":"2010","unstructured":"Da Rocha, J.M., Cervi\u00f1o, S., Guti\u00e9rrez, M.J.: An endogenous bioeconomic optimization algorithm to evaluate recovery plans: an application to southern hake. ICES J. Mar. Sci. (Journal du Conseil) 67(9), 1957\u20131962 (2010)","journal-title":"ICES J. Mar. Sci. (Journal du Conseil)"},{"issue":"3","key":"2051_CR38","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1111\/j.1742-4658.2009.07485.x","volume":"277","author":"R Ernst","year":"2010","unstructured":"Ernst, R., Kueppers, P., Stindt, J., et al.: Multidrug efflux pumps: substrate selection in ATP-binding cassette multidrug efflux pumps\u2013first come, first served. FEBS J. 277(3), 540\u2013549 (2010)","journal-title":"FEBS J."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-2051-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2051-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2051-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T17:02:11Z","timestamp":1603904531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-2051-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,23]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["2051"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-2051-0","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2018,2,23]]},"assertion":[{"value":"1 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}