{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T14:26:14Z","timestamp":1784125574321,"version":"3.55.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T00:00:00Z","timestamp":1612915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T00:00:00Z","timestamp":1612915200000},"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":["Nat Comput"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11047-020-09837-9","type":"journal-article","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T12:25:48Z","timestamp":1612959948000},"page":"265-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":68,"title":["Similarity in metaheuristics: a gentle step towards a comparison methodology"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7619-7407","authenticated-orcid":false,"given":"Jesica","family":"de Armas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7286-9501","authenticated-orcid":false,"given":"Eduardo","family":"Lalla-Ruiz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4917-981X","authenticated-orcid":false,"given":"Surafel Luleseged","family":"Tilahun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,2,10]]},"reference":[{"key":"9837_CR1","doi-asserted-by":"publisher","unstructured":"Akbari R, Mohammadi A, Ziarati K (2009) A powerful bee swarm optimization algorithm. In: IEEE 13th international multitopic conference (INMIC), pp 1 \u2013 6, https:\/\/doi.org\/10.1109\/INMIC.2009.5383155","DOI":"10.1109\/INMIC.2009.5383155"},{"issue":"3","key":"9837_CR2","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surv 35(3):268\u2013308. https:\/\/doi.org\/10.1145\/937503.937505","journal-title":"ACM Computing Surv"},{"issue":"2","key":"9837_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/opre.6.2.244","volume":"6","author":"SH Brooks","year":"1958","unstructured":"Brooks SH (1958) A discussion of random methods for seeking maxima. Op Res 6(2):244\u2013251. https:\/\/doi.org\/10.1287\/opre.6.2.244","journal-title":"Op Res"},{"key":"9837_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-030-60376-2_10","volume-title":"Swarm intelligence","author":"CL Camacho Villal\u00f3n","year":"2020","unstructured":"Camacho Villal\u00f3n CL, St\u00fctzle T, Dorigo M (2020) Grey wolf, firefly and bat algorithms: three widespread algorithms that do not contain any novelty. In: Dorigo M, St\u00fctzle T, Blesa MJ, Blum C, Hamann H, Heinrich MK, Strobel V (eds) Swarm intelligence. Springer International Publishing, Cham, pp 121\u2013133"},{"key":"9837_CR5","doi-asserted-by":"publisher","first-page":"651","DOI":"10.4304\/jsw.7.3.651-656","volume":"7","author":"T Chen","year":"2012","unstructured":"Chen T, Wang Y, Li J (2012) Artificial tribe algorithm and its performance analysis. J Softw 7:651\u2013656. https:\/\/doi.org\/10.4304\/jsw.7.3.651-656","journal-title":"J Softw"},{"key":"9837_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1155\/2012\/638275","volume":"2012638275","author":"E Cuevas","year":"2012","unstructured":"Cuevas E, Gonz\u00e1lez M, Zaldivar D, P\u00e9rez-Cisneros M, G G, (2012) An algorithm for global optimization inspired by collective animal behavior. Discrete Dyn Nat Soc 2012638275:24. https:\/\/doi.org\/10.1155\/2012\/638275","journal-title":"Discrete Dyn Nat Soc"},{"key":"9837_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68119-1_1","volume-title":"Introduction to spreadsheet modeling and metaheuristics","author":"A Duarte","year":"2018","unstructured":"Duarte A, Laguna M, Mart\u00ed R (2018) Introduction to spreadsheet modeling and metaheuristics. Springer International Publishing, Cham. https:\/\/doi.org\/10.1007\/978-3-319-68119-1_1"},{"key":"9837_CR8","doi-asserted-by":"publisher","unstructured":"Greistorfer P, Vo\u00df S (2005) Controlled pool maintenance for metaheuristics. In: Rego C, Alidaee B (ed) Metaheuristic optimization via memory and\nevolution. Kluwer, Boston, pp 387\u2212424. https:\/\/doi.org\/10.1007\/0-387-23667-8_18","DOI":"10.1007\/0-387-23667-8_18"},{"key":"9837_CR9","first-page":"479","volume":"2","author":"O Hasan\u00e7ebi","year":"2012","unstructured":"Hasan\u00e7ebi O, Azad SK (2012) An efficient metaheuristic algorithm for engineering optimization: SOPT. Int J Optim Civ Eng 2:479\u2013487","journal-title":"Int J Optim Civ Eng"},{"key":"9837_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inform Sci 222:175\u2013184. https:\/\/doi.org\/10.1016\/j.ins.2012.08.023","journal-title":"Inform Sci"},{"key":"9837_CR11","doi-asserted-by":"publisher","unstructured":"Havens TC, Spain CJ, Salmon NG, Keller JM (2008) Roach infestation optimization. In: IEEE Swarm Intelligence Symposium, September 21\u201323, 2008, St. Louis MO, USA, pp 1\u20137, https:\/\/doi.org\/10.1109\/SIS.2008.4668317","DOI":"10.1109\/SIS.2008.4668317"},{"key":"9837_CR12","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Neural Networks, 1995. Proceedings., IEEE International Conference on, vol\u00a04, pp 1942\u20131948 vol.4, https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"5","key":"9837_CR13","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s10732-016-9318-5","volume":"22","author":"M Laguna","year":"2016","unstructured":"Laguna M (2016) Editor\u2019s note on the MIC 2013 special issue of the Journal of Heuristics (Volume 22, Issue 4, August 2016). J Heuristics 22(5):665\u2013666. https:\/\/doi.org\/10.1007\/s10732-016-9318-5","journal-title":"J Heuristics"},{"key":"9837_CR14","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1007\/s00521-013-1433-8","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Zhang J, Yin M (2014) Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Computing Appl 24:1867\u20131877. https:\/\/doi.org\/10.1007\/s00521-013-1433-8","journal-title":"Neural Computing Appl"},{"key":"9837_CR15","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 Inform 1:355\u2013366. https:\/\/doi.org\/10.1016\/j.ecoinf.2006.07.003","journal-title":"Ecol Inform"},{"key":"9837_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ins.2014.01.026","volume":"267","author":"AP Piotrowski","year":"2014","unstructured":"Piotrowski AP, Napiorkowski JJ, Rowinski PM (2014) How novel is the \u201cnovel\u201d black hole optimization approach? Inform Sci 267:191\u2013200","journal-title":"Inform Sci"},{"key":"9837_CR17","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inform Sci 179:2232\u20132248. https:\/\/doi.org\/10.1016\/j.ins.2009.03.004","journal-title":"Inform Sci"},{"key":"9837_CR18","first-page":"1337","volume":"24","author":"LA Rastrigin","year":"1963","unstructured":"Rastrigin LA (1963) The convergence of the random search method in the extremal control of a many parameter system. Autom Remote Control 24:1337\u20131342","journal-title":"Autom Remote Control"},{"key":"9837_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen K (2015) Metaheuristics - the metaphor exposed. Int Trans Op Res 22:3\u201318. https:\/\/doi.org\/10.1111\/itor.12001","journal-title":"Int Trans Op Res"},{"key":"9837_CR20","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1007\/978-1-4419-1153-7","volume-title":"Encyclopedia of operations research and management science","author":"K S\u00f6rensen","year":"2013","unstructured":"S\u00f6rensen K, Glover F (2013) Metaheuristics. In: Gass SI, Fu M (eds) Encyclopedia of operations research and management science. Springer, New York, pp 960\u2013970. https:\/\/doi.org\/10.1007\/978-1-4419-1153-7"},{"key":"9837_CR21","unstructured":"Swan J, Adriaensen S, Bishr M, Burke EK, Clark JA, De\u00a0Causmaecker P, Durillo J, Hammond K, Hart E, Johnson CG, et\u00a0al. (2015) A research agenda for metaheuristic standardization. In: Proceedings of the XI metaheuristics international conference"},{"key":"9837_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5775-3","volume-title":"Meta-Heuristics: advances and trends in local search paradigms for optimization","year":"1999","unstructured":"Vo\u00df S, Martello S, Osman I, Roucairol C (eds) (1999) Meta-Heuristics: advances and trends in local search paradigms for optimization. Kluwer, Boston. https:\/\/doi.org\/10.1007\/978-1-4615-5775-3"},{"issue":"9","key":"9837_CR23","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1016\/j.cor.2005.07.016","volume":"33","author":"JP Watson","year":"2006","unstructured":"Watson JP, Howe AE, Whitley LD (2006) Deconstructing Nowicki and Smutnicki\u2019s i-TSAB tabu search algorithm for the job-shop scheduling problem. Computers Op Res 33(9):2623\u20132644. https:\/\/doi.org\/10.1016\/j.cor.2005.07.016","journal-title":"Computers Op Res"},{"key":"9837_CR24","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4018\/jamc.2010040104","volume":"1\u20132","author":"D Weyland","year":"2010","unstructured":"Weyland D (2010) A rigorous analysis of the harmony search algorithm - how the research community can be misled by a \u201cnovel\u201d methodology. Int J Appl Metaheuristic Computing 1\u20132:50\u201360. https:\/\/doi.org\/10.4018\/jamc.2010040104","journal-title":"Int J Appl Metaheuristic Computing"},{"key":"9837_CR25","first-page":"97","volume":"2","author":"D Weyland","year":"2015","unstructured":"Weyland D (2015) A critical analysis of the harmony search algorithm\u2013how not to solve sudoku. Op Res Perspecti 2:97\u2013105","journal-title":"Op Res Perspecti"},{"issue":"2","key":"9837_CR26","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley D (1994) A genetic algorithm tutorial. Stat Computing 4(2):65\u201385. https:\/\/doi.org\/10.1007\/BF00175354","journal-title":"Stat Computing"},{"key":"9837_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03404-1","volume-title":"Innovative computational intelligence: a rough guide to 134 clever algorithms","author":"B Xing","year":"2014","unstructured":"Xing B, Gao WJ (2014) Innovative computational intelligence: a rough guide to 134 clever algorithms. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-319-03404-1"},{"key":"9837_CR28","doi-asserted-by":"publisher","unstructured":"Yang C, Tu X, Chen J (2007) Algorithm of marriage in honey bees optimization based on the wolf pack search. In: IEEE International conference on intelligent pervasive computing (IPC), pp 462 \u2013 467, https:\/\/doi.org\/10.1109\/IPC.2007.104","DOI":"10.1109\/IPC.2007.104"},{"key":"9837_CR29","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2008","unstructured":"Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, UK"},{"key":"9837_CR30","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature inspired cooperative strategies for optimization (NICSO 2010). Studies in computational intelligence","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) A new Metaheuristic Bat-Inspired algorithm. In: Gonz\u00e1lez JR, Pelta DA, Cruz C, Terrazas G, Krasnogor N (eds) Nature inspired cooperative strategies for optimization (NICSO 2010). Studies in computational intelligence, vol 284. Springer, Berlin, Heidelberg, pp 65\u201374. https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6"},{"key":"9837_CR31","doi-asserted-by":"publisher","unstructured":"Zhang X, Chen W, Dai C (2008) Application of oriented search algorithm in reactive power optimization of power system. In: Third international conference on electric utility deregulation and restructuring and power technologies, DRPT 2008, Nanjing, China, pp 2856 \u2013 2861, https:\/\/doi.org\/10.1109\/DRPT.2008.4523896","DOI":"10.1109\/DRPT.2008.4523896"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09837-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-020-09837-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09837-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T13:46:11Z","timestamp":1654609571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-020-09837-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,10]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["9837"],"URL":"https:\/\/doi.org\/10.1007\/s11047-020-09837-9","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,10]]},"assertion":[{"value":"16 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}