{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:58:13Z","timestamp":1760709493714},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,1,6]],"date-time":"2018-01-06T00:00:00Z","timestamp":1515196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00521-017-3313-0","type":"journal-article","created":{"date-parts":[[2018,1,6]],"date-time":"2018-01-06T12:44:25Z","timestamp":1515242665000},"page":"3875-3908","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A novel modified flower pollination algorithm for global optimization"],"prefix":"10.1007","volume":"31","author":[{"given":"Allouani","family":"Fouad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Zhi","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,6]]},"reference":[{"key":"3313_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470640425","volume-title":"Engineering optimization: an introduction with metaheuristic applications","author":"X-S Yang","year":"2010","unstructured":"Yang X-S (2010) Engineering optimization: an introduction with metaheuristic applications. Wiley, Hoboken"},{"key":"3313_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78985-7","volume-title":"Metaheuristics for scheduling in industrial and manufacturing applications series: studies in computational intelligence","author":"F Xhafa","year":"2008","unstructured":"Xhafa F, Abraham A (2008) Metaheuristics for scheduling in industrial and manufacturing applications series: studies in computational intelligence. Springer, Berlin"},{"key":"3313_CR3","first-page":"1751","volume":"2","author":"C Chandrasekaran","year":"2007","unstructured":"Chandrasekaran C, Rajendran C, Krishnaiah Chetty OV, Hanumanna D (2007) Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach. Eur J Ind Eng 2:1751\u20135262","journal-title":"Eur J Ind Eng"},{"key":"3313_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-30671-6_7","volume-title":"Hybrid metaheuristics","author":"S Almuhaideb","year":"2013","unstructured":"Almuhaideb S, El-Bachir Menai M (2013) Hybrid metaheuristics for medical data classification. In: El-Ghazali T (ed) Hybrid metaheuristics. Springer, Berlin, pp 187\u2013217"},{"key":"3313_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ins.2012.06.032","volume":"217","author":"D Ekrem","year":"2012","unstructured":"Ekrem D, Mitat U, Ali FA (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65\u201377","journal-title":"Inf Sci"},{"key":"3313_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.compstruc.2012.09.003","volume":"112","author":"A Kaveh","year":"2012","unstructured":"Kaveh A, Khayatazad M (2012) A new metaheuristic method: ray optimization. Comput Struct 112:283\u2013294","journal-title":"Comput Struct"},{"key":"3313_CR7","doi-asserted-by":"crossref","unstructured":"Tang R, Fong S, Yang X-S, Deb S (2012) Wolf search algorithm with ephemeral memory. In: IEEE seventh international conference on digital information management (ICDIM 2012), 22\u201324 August 2012, Macau, pp 165\u2013172","DOI":"10.1109\/ICDIM.2012.6360147"},{"key":"3313_CR8","doi-asserted-by":"publisher","first-page":"4831","DOI":"10.1016\/j.cnsns.2012.05.010","volume":"17","author":"AH Gandomi","year":"2012","unstructured":"Gandomi AH, Alavi AH (2012) Krill Herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17:4831\u20134845","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"3313_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.knosys.2011.07.001","volume":"26","author":"WT Pan","year":"2012","unstructured":"Pan WT (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl Based Syst 26:69\u201374","journal-title":"Knowl Based Syst"},{"key":"3313_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.compstruc.2012.07.010","volume":"110\u2013111","author":"H Eskandar","year":"2012","unstructured":"Eskandar H, Sadollah A, Bahreininejad A, Hamdi M (2012) Water cycle algorithm\u2014a novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput Struct 110\u2013111:151\u2013166","journal-title":"Comput Struct"},{"key":"3313_CR11","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume-title":"Unconventional computation and natural computation","author":"X-S Yang","year":"2012","unstructured":"Yang X-S (2012) Flower pollination algorithm for global optimization. In: Durand-Lose J, Jonoska N (eds) Unconventional computation and natural computation, vol 7445. Springer, Berlin, Heidelberg, pp 240\u2013249"},{"key":"3313_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2012.11.013","volume":"229","author":"P Civicioglu","year":"2013","unstructured":"Civicioglu P (2013) Artificial cooperative search algorithm for numerical optimization problems. Inf Sci 229:58\u201376","journal-title":"Inf Sci"},{"key":"3313_CR13","doi-asserted-by":"publisher","first-page":"2592","DOI":"10.1016\/j.asoc.2012.11.026","volume":"13","author":"A Sadollah","year":"2013","unstructured":"Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13:2592\u20132612","journal-title":"Appl Soft Comput"},{"key":"3313_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.advengsoft.2013.03.004","volume":"59","author":"A Kaveh","year":"2013","unstructured":"Kaveh A, Farhoudi N (2013) A new optimization method: dolphin echolocation. Adv Eng Softw 59:53\u201370","journal-title":"Adv Eng Softw"},{"key":"3313_CR15","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.compstruc.2014.03.007","volume":"139","author":"MY Cheng","year":"2014","unstructured":"Cheng MY, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98\u2013112","journal-title":"Comput Struct"},{"key":"3313_CR16","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Software 69:46\u201361","journal-title":"Adv Eng Software"},{"key":"3313_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-05549-7","volume-title":"Colliding bodies optimization Advances in metaheuristic algorithms for optimal design of structures","author":"A Kaveh","year":"2014","unstructured":"Kaveh A (2014) Colliding bodies optimization Advances in metaheuristic algorithms for optimal design of structures. Springer, Berlin, pp 195\u2013232"},{"key":"3313_CR18","doi-asserted-by":"publisher","first-page":"6676","DOI":"10.1016\/j.eswa.2014.05.009","volume":"41","author":"M Ghaemi","year":"2014","unstructured":"Ghaemi M, Feizi Derakhshi MR (2014) Forest optimization algorithm. Expert Syst Appl 41:6676\u20136687","journal-title":"Expert Syst Appl"},{"key":"3313_CR19","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.jocs.2013.10.002","volume":"2","author":"AH Gandomi","year":"2014","unstructured":"Gandomi AH, Yang X-S (2014) Chaotic bat algorithm. J Comput Sci 2:224\u2013232","journal-title":"J Comput Sci"},{"key":"3313_CR20","first-page":"1","volume":"28","author":"GG Wang","year":"2015","unstructured":"Wang GG, Deb S, Cui Z (2015) Monarch butterfly optimization. Neural Comput Appl 28:1\u201320","journal-title":"Neural Comput Appl"},{"key":"3313_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.advengsoft.2015.01.010","volume":"83","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80\u201398","journal-title":"Adv Eng Softw"},{"key":"3313_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.cor.2014.10.011","volume":"55","author":"AH Kashan","year":"2015","unstructured":"Kashan AH (2015) A new metaheuristic for optimization: optics inspired optimization (OIO). Comput Opera Res 55:99\u2013125","journal-title":"Comput Opera Res"},{"key":"3313_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.compstruc.2015.03.003","volume":"153","author":"S Gon\u00e7alves","year":"2015","unstructured":"Gon\u00e7alves S, Lopez H, Miguel F (2015) Search group algorithm: a new metaheuristic method for the optimization of truss structures. Comput Struct 153:165\u2013184","journal-title":"Comput Struct"},{"key":"3313_CR24","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ins.2014.08.053","volume":"293","author":"B D\u00f6gan","year":"2015","unstructured":"D\u00f6gan B, \u00d6lmez T (2015) A new metaheuristic for numerical function optimization : vortex search algorithm. Inf Sci 293:125\u2013145","journal-title":"Inf Sci"},{"key":"3313_CR25","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.asoc.2015.08.014","volume":"37","author":"L Ma","year":"2015","unstructured":"Ma L, Zhu Y, Liu Y, Tain L, Chen H (2015) A novel bionic algorithm inspired by plant root foraging behaviors. Appl Soft Comput 37:95\u2013113","journal-title":"Appl Soft Comput"},{"key":"3313_CR26","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.asoc.2015.02.014","volume":"30","author":"JJQ Yu","year":"2015","unstructured":"Yu JJQ, Li VOK (2015) A social spider algorithm for global optimization. Appl Soft Comput 30:614\u2013627","journal-title":"Appl Soft Comput"},{"key":"3313_CR27","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.asoc.2015.03.003","volume":"31","author":"SA Uymaz","year":"2015","unstructured":"Uymaz SA, Tezel G, Yel E (2015) Artificial algae algorithm (AAA) for nonlinear global optimization. Appl Soft Comput 31:153\u2013171","journal-title":"Appl Soft Comput"},{"key":"3313_CR28","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Dragonfly algorithm: a new metaheuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27:1053\u20131073","journal-title":"Neural Comput Appl"},{"key":"3313_CR29","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Soft 95:51\u201367","journal-title":"Adv Eng Soft"},{"key":"3313_CR30","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.enconman.2015.05.074","volume":"101","author":"DF Alam","year":"2016","unstructured":"Alam DF, Yousri DA, Eteiba MB (2016) Flower pollination algorithm based solar PV parameter estimation. Energy Convers Manag 101:410\u2013422","journal-title":"Energy Convers Manag"},{"key":"3313_CR31","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 (2016) Flower pollination algorithm with bee pollinator for cluster analysis. Inf Proc Lett 116:1\u201314","journal-title":"Inf Proc Lett"},{"key":"3313_CR32","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.asoc.2015.08.037","volume":"37","author":"G Bekdas","year":"2015","unstructured":"Bekdas G, Nigdeli SM, Yang XS (2015) Sizing optimization of truss structures using flower pollination algorithm. Appl Soft Comput 37:322\u2013331","journal-title":"Appl Soft Comput"},{"key":"3313_CR33","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.eswa.2016.02.024","volume":"55","author":"S Ouadfel","year":"2016","unstructured":"Ouadfel S, Taleb-Ahmed A (2016) Social spiders optimization and flower pollination algorithm for multilevel image thresholding: a performance study. Expert Syst Appl 55:566\u2013584","journal-title":"Expert Syst Appl"},{"key":"3313_CR34","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.asoc.2015.05.015","volume":"34","author":"A Draa","year":"2016","unstructured":"Draa A (2016) On the performances of the flower pollination algorithm: qualitative and quantitative analyses. Appl Soft Comput 34:349\u2013371","journal-title":"Appl Soft Comput"},{"key":"3313_CR35","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.neucom.2015.01.110","volume":"188","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Wang R, Luo Q (2015) Elite opposition-based flower pollination algorithm. Neurocomputing 188:294\u2013310","journal-title":"Neurocomputing"},{"key":"3313_CR36","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.eswa.2016.03.047","volume":"57","author":"E Nabil","year":"2016","unstructured":"Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192\u2013203","journal-title":"Expert Syst Appl"},{"key":"3313_CR37","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1016\/j.jcp.2007.06.008","volume":"226","author":"I Pavlyukevich","year":"2007","unstructured":"Pavlyukevich I (2007) Levy flights, non-local search and simulated annealing. J Comput Phys 226:1830\u20131844","journal-title":"J Comput Phys"},{"key":"3313_CR38","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.renene.2015.04.034","volume":"83","author":"HM Dubey","year":"2015","unstructured":"Dubey HM, Pandit M, Panigrahi B (2015) Hybrid flower pollination algorithm with time-varying fuzzy selection mechanism for wind integrated multi-objective dynamic economic dispatch. Renew Energy 83:188\u2013202","journal-title":"Renew Energy"},{"key":"3313_CR39","unstructured":"Liang J, Qu B, Suganthan P, Hern\u00e1ndez-Daz AG (2013) Problem definitions and evaluation criteria for the CEC2013 special session on real-parameter optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Nanyang Technological University, Singapore, Technical Report 201212"},{"key":"3313_CR40","unstructured":"Das S, Suganthan P (2011) Problem definitions and evaluation criteria for CEC2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur University and Nanyang Technological University, Technical Report"},{"key":"3313_CR41","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1080\/0305215X.2013.832237","volume":"46","author":"X-S Yang","year":"2013","unstructured":"Yang X-S, Karamanoglu M, He X (2013) Flower pollination algorithm: a novel approach for multiobjective optimization. Eng Optim 46:1222\u20131237","journal-title":"Eng Optim"},{"key":"3313_CR42","unstructured":"Clerc M (2011) Standard particle swarm optimisation. Technical Report"},{"key":"3313_CR43","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1016\/j.ejor.2006.06.043","volume":"185","author":"C Garcia-Martinez","year":"2008","unstructured":"Garcia-Martinez C, Lozano M, Herrera F, Molina D, Sanchez A (2008) Global and local real-coded genetic algorithms based on parent-centric crossover operators. Eur J Oper Res 185:1088\u20131113","journal-title":"Eur J Oper Res"},{"key":"3313_CR44","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evol Comput 9:159\u2013195","journal-title":"Evol Comput"},{"key":"3313_CR45","doi-asserted-by":"crossref","unstructured":"Wang H, Wu Z, Liu Y, Wang J, Jiang D, Chen L (2009) Space transformation search: a new evolutionary technique. In: Proceedings of genetic and evolutionary computation conference, GEC summit, pp 537\u2013544","DOI":"10.1145\/1543834.1543907"},{"key":"3313_CR46","doi-asserted-by":"crossref","unstructured":"Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: Proceedings of the 2005 international conference on computational intelligence for modelling, control and automation, pp 695\u2013701","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"3313_CR47","first-page":"1034","volume-title":"IEEE congress on evolutionary computation","author":"S Elsayed","year":"2011","unstructured":"Elsayed S, Sarker R, Essam D (2011) GA with a new multi-parent crossover for solving IEEE-CEC2011 competition problems. IEEE congress on evolutionary computation. Louisiana, New Orleans, pp 1034\u20131040"},{"key":"3313_CR48","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.swevo.2015.05.002","volume":"24","author":"N Lynn","year":"2015","unstructured":"Lynn N, Suganthan PN (2015) Heterogeneous comprehensive learning particle swarm optimization with enhanced exploration and exploitation. Swarm Evol Comput 24:11\u201324","journal-title":"Swarm Evol Comput"},{"key":"3313_CR49","doi-asserted-by":"crossref","unstructured":"Mallipeddi R, Suganthan PN (2011) Ensemble differential evolution algorithm for CEC2011 problems. In: IEEE congress on evolutionary computation, New Orleans, LA, pp 1557\u20131564","DOI":"10.1109\/CEC.2011.5949801"},{"key":"3313_CR50","doi-asserted-by":"crossref","unstructured":"Zambrano-Bigiarini M, Clerc M (2013) Standard particle swarm optimisation 2011 at CEC-2013: a baseline for future PSO improvements. In: Proceedings of the IEEE congress on evolutionary computation, pp 2337\u20132344","DOI":"10.1109\/CEC.2013.6557848"},{"key":"3313_CR51","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biometrics 1:80\u201383","journal-title":"Biometrics"},{"key":"3313_CR52","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garcia S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3\u201318","journal-title":"Swarm Evol Comput"},{"key":"3313_CR53","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1026578104213","volume":"17","author":"WR Esposito","year":"2000","unstructured":"Esposito WR, Floudas CA (2000) Deterministic global optimization in nonlinear optimal control problems. J Glob Optim 17:97\u2013126","journal-title":"J Glob Optim"},{"key":"3313_CR54","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1023\/A:1022617804737","volume":"95","author":"MM Ali","year":"1997","unstructured":"Ali MM, Storey C, T\u00f6rn A (1997) Application of stochastic global optimization algorithms to practical problems. J Optim Theory Appl 95:545\u2013563","journal-title":"J Optim Theory Appl"},{"key":"3313_CR55","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1109\/49.56381","volume":"8","author":"ML Dukic","year":"1990","unstructured":"Dukic ML, Dobrosavljevic ZS (1990) A method of a spread-spectrum radar polyphase code design. IEEE J Sel Areas Commun 8:743\u2013749","journal-title":"IEEE J Sel Areas Commun"},{"issue":"8","key":"3313_CR56","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1016\/j.engappai.2008.03.011","volume":"21","author":"AM P\u00e9rez-Bellido","year":"2008","unstructured":"P\u00e9rez-Bellido AM, Salcedo-Sanz S, Ortiz-Garc\u00eea EG, Portilla-Figueras JA, Lopez-Ferreras F (2008) A comparison of memetic algorithms for the spread spectrum radar polyphase codes design problems. Eng Appl Artif Intell 21(8):1233\u20131238","journal-title":"Eng Appl Artif Intell"},{"issue":"9","key":"3313_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/etep.2372","volume":"27","author":"S Das","year":"2017","unstructured":"Das S, Verma A, Bijwe PR (2017) Transmission network expansion planning using a modified artificial bee colony algorithm. Int Trans Electr Energ Syst 27(9):1\u201323","journal-title":"Int Trans Electr Energ Syst"},{"issue":"5","key":"3313_CR58","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1049\/iet-gtd.2016.0511","volume":"11","author":"LA Gallego","year":"2016","unstructured":"Gallego LA, Garc\u00e9s LP, Rahmani M, Romero RA (2016) High-performance hybrid genetic algorithm to solve transmission network expansion planning. IET Gener Transm Dis 11(5):1111\u20131118","journal-title":"IET Gener Transm Dis"},{"issue":"4","key":"3313_CR59","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1109\/TPWRS.2003.818689","volume":"18","author":"FD Galiana","year":"2003","unstructured":"Galiana FD, Conejo AJ, Gil HA (2003) Transmission network cost allocation based on equivalent bilateral exchanges. IEEE Trans Power Syst 18(4):1425\u20131431","journal-title":"IEEE Trans Power Syst"},{"issue":"2","key":"3313_CR60","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/5.823997","volume":"88","author":"RD Christie","year":"2000","unstructured":"Christie RD, Wollenberg BF, Wangensteen I (2000) Transmission management in the deregulated environment. Proc IEEE 88(2):170\u2013195","journal-title":"Proc IEEE"},{"key":"3313_CR61","doi-asserted-by":"crossref","unstructured":"Huaning Wu, Chao Liu, Xu X (2014) Pattern synthesis of planar nonuniform circular antenna arrays using a chaotic adaptive invasive weed optimization algorithm. Math Probl Eng 1\u201313","DOI":"10.1155\/2014\/575860"},{"issue":"6","key":"3313_CR62","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1504\/IJBIC.2014.066965","volume":"6","author":"G Ram","year":"2014","unstructured":"Ram G, Mandal D, Kar R, Ghoshal SP (2014) Optimal design of non-uniform circular antenna arrays using PSO with wavelet mutation. Int J Bio-Inspir Comput 6(6):424\u2013433","journal-title":"Int J Bio-Inspir Comput"},{"key":"3313_CR63","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ijepes.2014.12.091","volume":"69","author":"EE Elattar","year":"2015","unstructured":"Elattar EE (2015) A hybrid genetic algorithm and bacterial foraging approach for dynamic economic dispatch problem. Int J Electr Power Energy Syst 69:18\u201326","journal-title":"Int J Electr Power Energy Syst"},{"key":"3313_CR64","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1016\/j.energy.2016.05.024","volume":"109","author":"E Dehnavi","year":"2016","unstructured":"Dehnavi E, Abdi H (2016) Optimal pricing in time of use demand response by integrating with dynamic economic dispatch problem. Energy 109:1086\u20131094","journal-title":"Energy"},{"issue":"2","key":"3313_CR65","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1080\/1448837X.2016.1138841","volume":"13","author":"DR Dashti","year":"2016","unstructured":"Dashti DR, Ghabeli A, Hosseini SM (2016) Solving static economic load dispatch using improved exponential harmony search optimisation. Aust J Electr Electron Eng 13(2):142\u2013150","journal-title":"Aust J Electr Electron Eng"},{"key":"3313_CR66","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.enconman.2012.04.006","volume":"65","author":"H Zhang","year":"2013","unstructured":"Zhang H, Zhou J, Zhang Y, Lu Y, Wang Y (2013) Culture belief based multi-objective hybrid differential evolutionary algorithm in short term hydrothermal scheduling. Energy Convers Manag 65:173\u2013184","journal-title":"Energy Convers Manag"},{"key":"3313_CR67","unstructured":"Vinko T, Izzo D (2008) Global optimisation heuristics and test problems for preliminary spacecraft trajectory design. Technical report, GOHTPPSTD, European Space Agency (ESA), the Advanced Concepts Team"},{"key":"3313_CR68","unstructured":"Biscani F, Izzo D, Yam C (2010) A global optimisation toolbox for massively parallel engineering optimisation. In: Proceedings of the international conference on astrodynamics tools and techniques (ICATT)"},{"key":"3313_CR69","unstructured":"El-Shahat D, Abdel-Basset M, El-Henawy I, Sangaiah AK (2017) A modifed flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making. Soft Comput 1\u201319"},{"key":"3313_CR70","unstructured":"Zhou Y, Wang R, Zhao C, Luo Q, Metwally MA (2017) Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput Appl 1\u201316"},{"key":"3313_CR71","unstructured":"Abdel-Basset M, Wang G-G, Sangaiah AK, Rushdy E (2017) Krill herd algorithm based on cuckoo search for solving engineering optimization problems. Multimed Tools Appl 1\u201324"},{"key":"3313_CR72","unstructured":"Srikanth K, Panwar LK, Panigrahi BK, Herrera-Viedma E, Sangaiah AK, Wang GG (2017) Meta-heuristic framework: quantum inspired binary grey wolf optimizer for unit commitment problem. Comput Electr Eng 1\u201318"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-3313-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-017-3313-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-3313-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T14:23:05Z","timestamp":1567779785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-017-3313-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,6]]},"references-count":72,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["3313"],"URL":"https:\/\/doi.org\/10.1007\/s00521-017-3313-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,6]]},"assertion":[{"value":"8 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}