{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:31:28Z","timestamp":1773253888901,"version":"3.50.1"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T00:00:00Z","timestamp":1586908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T00:00:00Z","timestamp":1586908800000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00521-020-04917-4","type":"journal-article","created":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T19:02:45Z","timestamp":1586977365000},"page":"16971-16991","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["BinEHO: a new binary variant based on elephant herding optimization algorithm"],"prefix":"10.1007","volume":"32","author":[{"given":"Huseyin","family":"Hakli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,15]]},"reference":[{"key":"4917_CR1","volume-title":"Fundamentals of computational swarm intelligence","author":"AP Engelbrecht","year":"2006","unstructured":"Engelbrecht AP (2006) Fundamentals of computational swarm intelligence. Wiley, New York"},{"key":"4917_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/j.cie.2017.12.009","volume":"115","author":"AC Cinar","year":"2018","unstructured":"Cinar AC, Kiran MS (2018) Similarity and logic gate-based tree-seed algorithms for binary optimization. Comput Ind Eng 115:631\u2013646. https:\/\/doi.org\/10.1016\/j.cie.2017.12.009","journal-title":"Comput Ind Eng"},{"key":"4917_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ins.2016.05.037","volume":"367","author":"A Banitalebi","year":"2016","unstructured":"Banitalebi A, Abd Aziz MI, Aziz ZA (2016) A self-adaptive binary differential evolution algorithm for large scale binary optimization problems. Inf Sci 367:487\u2013511. https:\/\/doi.org\/10.1016\/j.ins.2016.05.037","journal-title":"Inf Sci"},{"key":"4917_CR4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.cie.2019.07.007","volume":"136","author":"FB Ozsoydan","year":"2019","unstructured":"Ozsoydan FB (2019) Artificial search agents with cognitive intelligence for binary optimization problems. Comput Ind Eng 136:18\u201330","journal-title":"Comput Ind Eng"},{"key":"4917_CR5","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1016\/j.jesit.2017.05.003","volume":"5","author":"M Vanithasri","year":"2018","unstructured":"Vanithasri M, Balamurugan R, Lakshminarasimman L (2018) Radial movement optimization (RMO) technique for solving unit commitment problem in power systems. J Electr Syst Inf Technol 5:697\u2013707","journal-title":"J Electr Syst Inf Technol"},{"key":"4917_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.swevo.2017.08.002","volume":"38","author":"LK Panwar","year":"2018","unstructured":"Panwar LK, Reddy KS, Verma A, Panigrahi BK, Kumar R (2018) Binary grey wolf optimizer for large scale unit commitment problem. Swarm Evol Comput 38:251\u2013266. https:\/\/doi.org\/10.1016\/j.swevo.2017.08.002","journal-title":"Swarm Evol Comput"},{"key":"4917_CR7","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.cie.2019.06.060","volume":"135","author":"H Hakli","year":"2019","unstructured":"Hakli H, Ortacay Z (2019) An improved scatter search algorithm for the uncapacitated facility location problem. Comput Ind Eng 135:855\u2013867","journal-title":"Comput Ind Eng"},{"issue":"2","key":"4917_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10589-012-9521-8","volume":"55","author":"MH Kashan","year":"2013","unstructured":"Kashan MH, Kashan AH, Nahavandi N (2013) A novel differential evolution algorithm for binary optimization. Comput Optim Appl 55(2):481\u2013513. https:\/\/doi.org\/10.1007\/s10589-012-9521-8","journal-title":"Comput Optim Appl"},{"key":"4917_CR9","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"YQ Zhou","year":"2016","unstructured":"Zhou YQ, Chen X, Zhou G (2016) An improved monkey algorithm for a 0\u20131 knapsack problem. Appl Soft Comput 38:817\u2013830. https:\/\/doi.org\/10.1016\/j.asoc.2015.10.043","journal-title":"Appl Soft Comput"},{"issue":"22","key":"4917_CR10","doi-asserted-by":"publisher","first-page":"11042","DOI":"10.1016\/j.amc.2012.05.001","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Appl Math Comput 218(22):11042\u201311061. https:\/\/doi.org\/10.1016\/j.amc.2012.05.001","journal-title":"Appl Math Comput"},{"key":"4917_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.asoc.2019.03.002","volume":"78","author":"AR Jordehi","year":"2019","unstructured":"Jordehi AR (2019) Binary particle swarm optimisation with quadratic transfer function: a new binary optimisation algorithm for optimal scheduling of appliances in smart homes. Appl Soft Comput 78:465\u2013480. https:\/\/doi.org\/10.1016\/j.asoc.2019.03.002","journal-title":"Appl Soft Comput"},{"issue":"2","key":"4917_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.renene.2004.05.007","volume":"30","author":"SA Grady","year":"2005","unstructured":"Grady SA, Hussaini MY, Abdullah MM (2005) Placement of wind turbines using genetic algorithms. Renew Energy 30(2):259\u2013270. https:\/\/doi.org\/10.1016\/j.renene.2004.05.007","journal-title":"Renew Energy"},{"issue":"1","key":"4917_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.17559\/Tv-20170725231351","volume":"26","author":"M Beskirli","year":"2019","unstructured":"Beskirli M, Koc I, Kodaz H (2019) Optimal placement of wind turbines using novel binary invasive weed optimization. Teh Vjesn 26(1):56\u201363. https:\/\/doi.org\/10.17559\/Tv-20170725231351","journal-title":"Teh Vjesn"},{"key":"4917_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.eswa.2018.09.015","volume":"117","author":"M Mafarja","year":"2019","unstructured":"Mafarja M, Aljarah I, Faris H, Hammouri AI, Al-Zoubi AM, Mirjalili S (2019) Binary grasshopper optimisation algorithm approaches for feature selection problems. Expert Syst Appl 117:267\u2013286. https:\/\/doi.org\/10.1016\/j.eswa.2018.09.015","journal-title":"Expert Syst Appl"},{"key":"4917_CR15","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: 1995 IEEE international conference on neural networks proceedings, vols 1\u20136, pp 1942\u20131948. https:\/\/doi.org\/10.1109\/icnn.1995.488968","DOI":"10.1109\/icnn.1995.488968"},{"key":"4917_CR16","volume-title":"An idea based on honey bee swarm for numerical optimization","author":"D Karaboga","year":"2005","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Erciyes University, Engineering Faculty, Computer Engineering Department, Talas"},{"key":"4917_CR17","doi-asserted-by":"crossref","unstructured":"Storn R (1996) On the usage of differential evolution for function optimization. In: 1996 Biennial conference of the North American Fuzzy Information Processing Society, Nafips, pp 519\u2013523","DOI":"10.1109\/NAFIPS.1996.534789"},{"issue":"4","key":"4917_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ecoinf.2006.07.003","volume":"1","author":"AR Mehrabian","year":"2006","unstructured":"Mehrabian AR, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inf 1(4):355\u2013366. https:\/\/doi.org\/10.1016\/j.ecoinf.2006.07.003","journal-title":"Ecol Inf"},{"key":"4917_CR19","first-page":"165","volume":"2","author":"RQ Zhao","year":"2008","unstructured":"Zhao RQ, Tang WS (2008) Monkey algorithm for global numerical optimization. J Uncertain Syst 2:165\u2013176","journal-title":"J Uncertain Syst"},{"key":"4917_CR20","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 Softw 69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv Eng Softw"},{"key":"4917_CR21","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. https:\/\/doi.org\/10.1016\/j.asoc.2015.03.003","journal-title":"Appl Soft Comput"},{"key":"4917_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1923-y","author":"G-G Wang","year":"2015","unstructured":"Wang G-G, Deb S, Cui Z (2015) Monarch butterfly optimization. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-015-1923-y","journal-title":"Neural Comput Appl"},{"key":"4917_CR23","doi-asserted-by":"publisher","unstructured":"Wang GG, Deb S, Coelho LD (2015) Elephant herding optimization. In: 2015 3rd international symposium on computational and business intelligence (ISCBI 2015), pp 1\u20135. https:\/\/doi.org\/10.1109\/iscbi.2015.8","DOI":"10.1109\/iscbi.2015.8"},{"issue":"7","key":"4917_CR24","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1007\/s00521-015-2135-1","volume":"28","author":"Y Feng","year":"2017","unstructured":"Feng Y, Wang GG, Deb S, Lu M, Zhao XJ (2017) Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput Appl 28(7):1619\u20131634. https:\/\/doi.org\/10.1007\/s00521-015-2135-1","journal-title":"Neural Comput Appl"},{"key":"4917_CR25","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.renene.2017.12.087","volume":"121","author":"M Beskirli","year":"2018","unstructured":"Beskirli M, Koc I, Hakli H, Kodaz H (2018) A new optimization algorithm for solving wind turbine placement problem: binary artificial algae algorithm. Renew Energy 121:301\u2013308. https:\/\/doi.org\/10.1016\/j.renene.2017.12.087","journal-title":"Renew Energy"},{"key":"4917_CR26","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.knosys.2018.12.012","volume":"166","author":"MA Elhosseini","year":"2019","unstructured":"Elhosseini MA, El Sehiemy RA, Rashwan YI, Gao XZ (2019) On the performance improvement of elephant herding optimization algorithm. Knowl-Based Syst 166:58\u201370. https:\/\/doi.org\/10.1016\/j.knosys.2018.12.012","journal-title":"Knowl-Based Syst"},{"key":"4917_CR27","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig GB (1957) Discrete variable extremum problems. Oper Res 5:266\u2013277","journal-title":"Oper Res"},{"issue":"2","key":"4917_CR28","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"DX Zou","year":"2011","unstructured":"Zou DX, Gao LQ, Li S, Wu JH (2011) Solving 0\u20131 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11(2):1556\u20131564","journal-title":"Appl Soft Comput"},{"key":"4917_CR29","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New York"},{"key":"4917_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"4917_CR31","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/573731","author":"WL Xiang","year":"2014","unstructured":"Xiang WL, An MQ, Li YZ, He RC, Zhang JF (2014) A novel discrete global-best harmony search algorithm for solving 0\u20131 knapsack problems. Discrete Dyn Nat Soc. https:\/\/doi.org\/10.1155\/2014\/573731","journal-title":"Discrete Dyn Nat Soc"},{"issue":"19","key":"4917_CR32","doi-asserted-by":"publisher","first-page":"9959","DOI":"10.1016\/j.amc.2013.04.023","volume":"219","author":"XG Zhang","year":"2013","unstructured":"Zhang XG, Huang SY, Hu Y, Zhang YJ, Mahadevan S, Deng Y (2013) Solving 0\u20131 knapsack problems based on amoeboid organism algorithm. Appl Math Comput 219(19):9959\u20139970. https:\/\/doi.org\/10.1016\/j.amc.2013.04.023","journal-title":"Appl Math Comput"},{"key":"4917_CR33","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.cam.2013.09.052","volume":"259","author":"MAK Azad","year":"2014","unstructured":"Azad MAK, Rocha AMAC, Fernandes EMGP (2014) A simplified binary artificial fish swarm algorithm for 0\u20131 quadratic knapsack problems. J Comput Appl Math 259:897\u2013904. https:\/\/doi.org\/10.1016\/j.cam.2013.09.052","journal-title":"J Comput Appl Math"},{"key":"4917_CR34","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.asoc.2014.02.010","volume":"19","author":"KK Bhattacharjee","year":"2014","unstructured":"Bhattacharjee KK, Sarmah SP (2014) Shuffled frog leaping algorithm and its application to 0\/1 knapsack problem. Appl Soft Comput 19:252\u2013263","journal-title":"Appl Soft Comput"},{"issue":"3","key":"4917_CR35","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/0377-2217(91)90179-Y","volume":"52","author":"BR Sarker","year":"1991","unstructured":"Sarker BR (1991) Discrete location theory\u2014Mirchandani, Pb, Francis, Rl. Eur J Oper Res 52(3):388\u2013389. https:\/\/doi.org\/10.1016\/0377-2217(91)90179-Y","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4917_CR36","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.ejor.2003.10.031","volume":"162","author":"A Klose","year":"2005","unstructured":"Klose A, Drexl A (2005) Facility location models for distribution system design. Eur J Oper Res 162(1):4\u201329. https:\/\/doi.org\/10.1016\/j.ejor.2003.10.031","journal-title":"Eur J Oper Res"},{"issue":"3","key":"4917_CR37","doi-asserted-by":"publisher","first-page":"631","DOI":"10.2307\/1235442","volume":"45","author":"JF Stollsteimer","year":"1963","unstructured":"Stollsteimer JF (1963) A working model for plant numbers and locations. J Farm Econ 45(3):631\u2013645","journal-title":"J Farm Econ"},{"key":"4917_CR38","unstructured":"Balinski ML (1966) On finding integer solutions to linear programs. In: Proceedings of IBM scientific symposium on combinatorial problems, IBM, White Plains, pp 225\u2013248"},{"key":"4917_CR39","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cie.2014.04.010","volume":"73","author":"E Ardjmand","year":"2014","unstructured":"Ardjmand E, Park N, Weckman G, Amin-Naseri MR (2014) The discrete unconscious search and its application to uncapacitated facility location problem. Comput Ind Eng 73:32\u201340. https:\/\/doi.org\/10.1016\/j.cie.2014.04.010","journal-title":"Comput Ind Eng"},{"key":"4917_CR40","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.asoc.2018.01.001","volume":"64","author":"S Korkmaz","year":"2018","unstructured":"Korkmaz S, Kiran MS (2018) An artificial algae algorithm with stigmergic behavior for binary optimization. Appl Soft Comput 64:627\u2013640. https:\/\/doi.org\/10.1016\/j.asoc.2018.01.001","journal-title":"Appl Soft Comput"},{"issue":"6","key":"4917_CR41","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"JH Jaramillo","year":"2002","unstructured":"Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29(6):761\u2013779. https:\/\/doi.org\/10.1016\/S0305-0548(01)00021-1","journal-title":"Comput Oper Res"},{"key":"4917_CR42","unstructured":"A continuous particle swarm optimization algorithm for uncapacitated facility location problem. Lecture Notes in Computer Science, vol 4150, pp 316\u2013323"},{"key":"4917_CR43","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/861512","author":"AR Guner","year":"2008","unstructured":"Guner AR, Sevkli M (2008) A discrete particle swarm optimization algorithm for uncapacitated facility location problem. J Artif Evol Appl. https:\/\/doi.org\/10.1155\/2008\/861512","journal-title":"J Artif Evol Appl"},{"key":"4917_CR44","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.3906\/elk-1203-104","volume":"21","author":"MS Kiran","year":"2013","unstructured":"Kiran MS, Gunduz M (2013) XOR-based artificial bee colony algorithm for binary optimization. Turk J Electr Eng Comput Sci 21:2307\u20132328. https:\/\/doi.org\/10.3906\/elk-1203-104","journal-title":"Turk J Electr Eng Comput Sci"},{"issue":"1","key":"4917_CR45","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.asoc.2011.08.038","volume":"12","author":"MH Kashan","year":"2012","unstructured":"Kashan MH, Nahavandi N, Kashan AH (2012) DisABC: a new artificial bee colony algorithm for binary optimization. Appl Soft Comput 12(1):342\u2013352. https:\/\/doi.org\/10.1016\/j.asoc.2011.08.038","journal-title":"Appl Soft Comput"},{"key":"4917_CR46","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.renene.2015.11.021","volume":"88","author":"R Shakoor","year":"2016","unstructured":"Shakoor R, Hassan MY, Raheem A, Rasheed N (2016) Wind farm layout optimization using area dimensions and definite point selection techniques. Renew Energy 88:154\u2013163. https:\/\/doi.org\/10.1016\/j.renene.2015.11.021","journal-title":"Renew Energy"},{"key":"4917_CR47","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jweia.2018.03.023","volume":"176","author":"MN Kaya","year":"2018","unstructured":"Kaya MN, Kose F, Ingham D, Ma L, Pourkashanian M (2018) Aerodynamic performance of a horizontal axis wind turbine with forward and backward swept blades. J Wind Eng Ind Aerodyn 176:166\u2013173. https:\/\/doi.org\/10.1016\/j.jweia.2018.03.023","journal-title":"J Wind Eng Ind Aerodyn"},{"issue":"1","key":"4917_CR48","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0167-6105(94)90080-9","volume":"51","author":"G Mosetti","year":"1994","unstructured":"Mosetti G, Poloni C, Diviacco B (1994) Optimization of wind turbine positioning in large windfarms by means of a genetic algorithm. J Wind Eng Ind Aerodyn 51(1):105\u2013116. https:\/\/doi.org\/10.1016\/0167-6105(94)90080-9","journal-title":"J Wind Eng Ind Aerodyn"},{"key":"4917_CR49","doi-asserted-by":"publisher","unstructured":"Wan CQ, Wang J, Yang G, Li XL, Zhang X (2009) Optimal micro-siting of wind turbines by genetic algorithms based on improved wind and turbine models. In: Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, pp 5092\u20135096. https:\/\/doi.org\/10.1109\/cdc.2009.5399571","DOI":"10.1109\/cdc.2009.5399571"},{"key":"4917_CR50","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.renene.2015.07.100","volume":"86","author":"P Mittal","year":"2016","unstructured":"Mittal P, Kulkarni K, Mitra K (2016) A novel hybrid optimization methodology to optimize the total number and placement of wind turbines. Renew Energy 86:133\u2013147. https:\/\/doi.org\/10.1016\/j.renene.2015.07.100","journal-title":"Renew Energy"},{"key":"4917_CR51","doi-asserted-by":"publisher","DOI":"10.1063\/1.4896599","author":"K Chen","year":"2014","unstructured":"Chen K, Song MX, Zhang X (2014) Binary-real coding genetic algorithm for wind turbine positioning in wind farm. J Renew Sustain Energy. https:\/\/doi.org\/10.1063\/1.4896599","journal-title":"J Renew Sustain Energy"},{"issue":"1","key":"4917_CR52","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S0377-2217(02)00504-0","volume":"150","author":"D Ghosh","year":"2003","unstructured":"Ghosh D (2003) Neighborhood search heuristics for the uncapacitated facility location problem. Eur J Oper Res 150(1):150\u2013162. https:\/\/doi.org\/10.1016\/S0377-2217(02)00504-0","journal-title":"Eur J Oper Res"},{"key":"4917_CR53","volume-title":"A note on wind generator interaction","author":"NO Jensen","year":"1983","unstructured":"Jensen NO (1983) A note on wind generator interaction. Riso National Laboratory, Roskilde"},{"issue":"6","key":"4917_CR54","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1504\/IJBIC.2016.081335","volume":"8","author":"GG Wang","year":"2016","unstructured":"Wang GG, Deb S, Gao XZ, Coelho LD (2016) A new metaheuristic optimisation algorithm motivated by elephant herding behaviour. Int J Bio-Inspir Comput 8(6):394\u2013409","journal-title":"Int J Bio-Inspir Comput"},{"key":"4917_CR55","unstructured":"Wang GG (2016) Elephant herding optimization (EHO) Matlab Code. Accessed 07 Aug 2019"},{"key":"4917_CR56","doi-asserted-by":"publisher","first-page":"34738","DOI":"10.1109\/Access.2019.2904679","volume":"7","author":"AAK Ismaeel","year":"2019","unstructured":"Ismaeel AAK, Elshaarawy IA, Houssein EH, Ismail FH, Hassanien AE (2019) Enhanced elephant herding optimization for global optimization. IEEE Access 7:34738\u201334752. https:\/\/doi.org\/10.1109\/Access.2019.2904679","journal-title":"IEEE Access"},{"issue":"24","key":"4917_CR57","doi-asserted-by":"publisher","first-page":"194","DOI":"10.19101\/IJATEE.2016.324005","volume":"3","author":"S Gupta","year":"2016","unstructured":"Gupta S, Singh VP, Singh SP, Prakash T, Rathore NS (2016) Elephant herding optimization based PID controller tuning. Int J Adv Technol Eng Explor 3(24):194\u2013198","journal-title":"Int J Adv Technol Eng Explor"},{"key":"4917_CR58","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.enconman.2016.08.094","volume":"127","author":"M Tahani","year":"2016","unstructured":"Tahani M, Babayan N, Mehrnia S, Shadmehri M (2016) A novel heuristic method for optimization of straight blade vertical axis wind turbine. Energy Convers Manag 127:461\u2013476. https:\/\/doi.org\/10.1016\/j.enconman.2016.08.094","journal-title":"Energy Convers Manag"},{"key":"4917_CR59","doi-asserted-by":"crossref","unstructured":"Alihodzic A, Tuba E, Capor-Hrosik R, Dolicanin E, Tuba M (2017) Unmanned aerial vehicle path planning problem by adjusted elephant herding optimization. In: 2017 25th Telecommunication Forum (TELFOR):804-807","DOI":"10.1109\/TELFOR.2017.8249468"},{"key":"4917_CR60","doi-asserted-by":"crossref","unstructured":"Strumberger I, Bacanin N, Tomic S, Beko M, Tuba M (2017) Static drone placement by elephant herding optimization algorithm. In: 2017 25th Telecommunication Forum (TELFOR), pp 808-811","DOI":"10.1109\/TELFOR.2017.8249469"},{"key":"4917_CR61","doi-asserted-by":"crossref","first-page":"1969","DOI":"10.1049\/joe.2017.0673","volume":"13","author":"S Parashar","year":"2017","unstructured":"Parashar S, Swarnkar A, Niazi KR, Gupta N (2017) A modified elephant herding optimization for economic generation co-ordination of DERs and BESS in grid connected microgrid. J Eng 13:1969\u20131973","journal-title":"J Eng"},{"issue":"3","key":"4917_CR62","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1109\/Tii.2017.2748220","volume":"14","author":"NK Meena","year":"2018","unstructured":"Meena NK, Parashar S, Swarnkar A, Gupta N, Niazi KR (2018) Improved elephant herding optimization for multiobjective DER accommodation in distribution systems. IEEE Trans Ind Inf 14(3):1029\u20131039. https:\/\/doi.org\/10.1109\/Tii.2017.2748220","journal-title":"IEEE Trans Ind Inf"},{"key":"4917_CR63","doi-asserted-by":"crossref","unstructured":"Tuba E, Alihodzic A, Tuba M (2017) Multilevel image thresholding using elephant herding optimization algorithm. In: 2017 14th international conference on engineering of modern electric systems (EMES), pp 240\u2013243","DOI":"10.1109\/EMES.2017.7980424"},{"key":"4917_CR64","doi-asserted-by":"crossref","unstructured":"Correia SD, Beko M, Cruz LAD, Tomic S (2018) Implementation and validation of elephant herding optimization algorithm for acoustic localization. In: 2018 26th Telecommunications Forum (TELFOR), pp 420\u2013423","DOI":"10.1109\/TELFOR.2018.8611919"},{"issue":"9","key":"4917_CR65","doi-asserted-by":"publisher","first-page":"2849","DOI":"10.3390\/s18092849","volume":"18","author":"SD Correia","year":"2018","unstructured":"Correia SD, Beko M, Cruz LAD, Tomic S (2018) Elephant herding optimization for energy-based localization. Sensors-Basel 18(9):2849. https:\/\/doi.org\/10.3390\/s18092849","journal-title":"Sensors-Basel"},{"issue":"11","key":"4917_CR66","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.3390\/s19112515","volume":"19","author":"I Strumberger","year":"2019","unstructured":"Strumberger I, Minovic M, Tuba M, Bacanin N (2019) Performance of elephant herding optimization and tree growth algorithm adapted for node localization in wireless sensor networks. Sens-Basel 19(11):2515. https:\/\/doi.org\/10.3390\/s19112515","journal-title":"Sens-Basel"},{"key":"4917_CR67","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.bspc.2018.05.039","volume":"45","author":"AE Hassanien","year":"2018","unstructured":"Hassanien AE, Kilany M, Houssein EH, AlQaheri H (2018) Intelligent human emotion recognition based on elephant herding optimization tuned support vector regression. Biomed Signal Process 45:182\u2013191. https:\/\/doi.org\/10.1016\/j.bspc.2018.05.039","journal-title":"Biomed Signal Process"},{"key":"4917_CR68","unstructured":"Chen Q, Liu B, Zhang Q, Liang JJ, Suganthan PN, Qu BY (2014) Problem definitions and evaluation criteria for CEC 2015 special session and competition on bound constrained single-objective computationally expensive numerical optimization. In: Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Technical Report, Nanyang Technological University, Singapore, Technical Report"},{"key":"4917_CR69","unstructured":"Wu G, Mallipeddi R, Suganthan PN (2016) Problem definitions and evaluation criteria for the CEC 2017 competition and special session on constrained single objective real-parameter optimization. Technical Report, Nanyang Technological University, Singapore"},{"key":"4917_CR70","doi-asserted-by":"publisher","DOI":"10.1109\/Icsmc.2006.384598","author":"CY Lee","year":"2006","unstructured":"Lee CY, Lee ZJ, Su SF (2006) A new approach for solving 0\/1 knapsack problem. IEEE Syst Man Cybern. https:\/\/doi.org\/10.1109\/Icsmc.2006.384598","journal-title":"IEEE Syst Man Cybern"},{"issue":"11","key":"4917_CR71","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1038\/sj\/jors\/0411109","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) Or-library\u2014distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072. https:\/\/doi.org\/10.1038\/sj\/jors\/0411109","journal-title":"J Oper Res Soc"},{"key":"4917_CR72","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.renene.2017.02.017","volume":"107","author":"L Parada","year":"2017","unstructured":"Parada L, Herrera C, Flores P, Parada V (2017) Wind farm layout optimization using a Gaussian-based wake model. Renew Energy 107:531\u2013541. https:\/\/doi.org\/10.1016\/j.renene.2017.02.017","journal-title":"Renew Energy"},{"key":"4917_CR73","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jweia.2015.07.009","volume":"146","author":"LY Wang","year":"2015","unstructured":"Wang LY, Tan ACC, Gu YT (2015) Comparative study on optimizing the wind farm layout using different design methods and cost models. J Wind Eng Ind Aerod 146:1\u201310. https:\/\/doi.org\/10.1016\/j.jweia.2015.07.009","journal-title":"J Wind Eng Ind Aerod"},{"key":"4917_CR74","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: SMC \u201897 conference proceedings\u20141997 IEEE international conference on systems, man, and cybernetics, vols 1\u20135, pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"issue":"4","key":"4917_CR75","doi-asserted-by":"publisher","first-page":"8049","DOI":"10.1016\/j.eswa.2008.10.047","volume":"36","author":"XH Yuan","year":"2009","unstructured":"Yuan XH, Nie H, So AJ, Wang L, Yuan YB (2009) An improved binary particle swarm optimization for unit commitment problem. Expert Syst Appl 36(4):8049\u20138055. https:\/\/doi.org\/10.1016\/j.eswa.2008.10.047","journal-title":"Expert Syst Appl"},{"key":"4917_CR76","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.asoc.2015.04.007","volume":"33","author":"MS Kiran","year":"2015","unstructured":"Kiran MS (2015) The continuous artificial bee colony algorithm for binary optimization. Appl Soft Comput 33:15\u201323. https:\/\/doi.org\/10.1016\/j.asoc.2015.04.007","journal-title":"Appl Soft Comput"},{"key":"4917_CR77","doi-asserted-by":"publisher","unstructured":"Engelbrecht AP, Pampara G (2007) Binary differential evolution strategies. In: IEEE Congress on Evolutionary Computation, pp 1942\u20131947. https:\/\/doi.org\/10.1109\/Cec.2007.4424711","DOI":"10.1109\/Cec.2007.4424711"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-04917-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-04917-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-04917-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T08:40:12Z","timestamp":1618476012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-04917-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,15]]},"references-count":77,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["4917"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-04917-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,15]]},"assertion":[{"value":"31 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2020","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"}}]}}