<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Sharks, Zombies and Volleyball: Lessons from the Evolutionary Computation Bestiary</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Felipe</forename><surname>Campelo</surname></persName>
							<email>f.campelo@aston.ac.uk</email>
							<affiliation key="aff0">
								<orgName type="department">College of Engineering and Physical Sciences</orgName>
								<orgName type="institution">Aston University UK</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Claus</forename><surname>Aranha</surname></persName>
							<affiliation key="aff1">
								<orgName type="department">Faculty of Systems and Information Engineering</orgName>
								<orgName type="institution">University of Tsukuba</orgName>
								<address>
									<country key="JP">Japan</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Sharks, Zombies and Volleyball: Lessons from the Evolutionary Computation Bestiary</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">0B5C4AD405F3542AF71E08599FDA6163</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-25T07:12+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The field of optimization metaheuristics has a long history of finding inspiration in natural systems. Starting from classic methods such as Genetic Algorithms and Ant Colony Optimization, more recent methods claim to be inspired by natural (and sometimes even supernatural) systems and phenomenafrom birds and barnacles to reincarnation and zombies. Since 2014 we publish a humorous website, The Bestiary of Evolutionary Computation, to catalog these methods, witnessing an explosion of metaphor-heavy algorithms in the literature. While metaphors can be powerful inspiration tools, we argue that the emergence of hundreds of barely discernible algorithmic variants under different labels and nomenclatures has been counterproductive to the scientific progress of the field, as it neither improves our ability to understand and simulate biological systems, nor contributes generalizable knowledge or design principles for global optimization approaches. In this short paper we discuss some of the possible causes of this trend, its negative consequences to the field, as well as some efforts aimed at moving the area of metaheuristics towards a better balance between inspiration and scientific soundness.</p><p>1 Notice the contrast with the opening anecdote about Kekulé's inspiration.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Introduction</head><p>In 1865, August Kekulé proposed that the structure of benzene was a hexagonal ring of six carbon atoms, solving a problem that had confounded chemists for decades. Kekulé championed visual scientific creativity, and mentioned that his inspiration came from a day-dream about an Ouroboros, which is a symbol depicting a serpent or dragon eating its own tail. However, it is clear to anyone who has gone through even a basic course in organic chemistry that scientists do not discuss their work using snake anatomy terminology, or try to come up with new compounds by carefully examining legendary reptiles. Despite the importance he attributed to visual creativity, August Kekulé himself only went on record about his original inspiration in 1890, at a meeting held in his honor <ref type="bibr" target="#b31">(Robinson, 2010)</ref>.</p><p>Throughout history, scientists and engineers have drawn inspiration from different sources, such as the natural world, dreams or personal experiences. Ideas from biology and observations of natural processes have inspired several interesting developments within computer science and engineering since at least the 1960s, suggesting innovative ways to solve optimization problems <ref type="bibr" target="#b6">(Bremermann et al., 1962;</ref><ref type="bibr" target="#b19">Fogel and Fogel, 1995;</ref><ref type="bibr" target="#b3">Beyer and Schwefel, 2002;</ref><ref type="bibr" target="#b23">Holland, 1975;</ref><ref type="bibr" target="#b27">Kirkpatrick et al., 1983;</ref><ref type="bibr" target="#b26">Kennedy and Eberhart, 1995;</ref><ref type="bibr" target="#b15">Dorigo et al., 1996)</ref>. The development of these methods was often experiment-driven rather than theory-led, which was not surprising for a new field without an existing theoretical framework. Although the algorithms were in most cases described and discussed using metaphor-specific language, beyond what would be necessary for the understanding of the computational concepts being implemented, 1 the elements of good scientific practice were present: an original idea would suggest a new method, which would be tested, refined and compared against state-of-the-art approaches for the problems they were intended to solve. Attempts at theoretical development would be advanced, discussed, adopted or refuted depending on their success in explaining the behavior of each method. This approach led to increased developments in metaheuristic methodologies, with excellent results for the solution of a variety of applied problems with characteristics that did not allow the use of traditional mathematical programming methods.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>The Age of the Metaphors</head><p>The success of these early nature-inspired metaheuristics naturally led to increasing attempts to find other phenomena that could provide insights for optimization. Around the end of the 1990s and early 2000s, this pursuit of insightful inspiration from natural processes started to transform into a different phenomenon: an increasing number of publications claiming to present revolutionary ideas or even "novel paradigms for optimization", based on ever more obscure social, natural, or even supernatural metaphors.</p><p>Inspired by a "Cat Swarm Optimization" paper, in 2014 we started gathering examples of particularly absurd metaphors published in peer-reviewed venues, in a humorous catalog named the Evolutionary Computation Bestiary <ref type="bibr" target="#b7">(Campelo and Aranha, 2021)</ref>. As the website started to attract attention, several colleagues contacted us to recom- mend entries based on new and progressively more bizarre metaphors. The raw number of different methods added to the Bestiary showed that this was a growing and concerning phenomenon.</p><p>Figure <ref type="figure" target="#fig_0">1</ref> illustrates this point. Between 2000 and 2008 we see the publication of a few methods per year (including algorithms based on sheep flocks, musicians, plant saplings, parliamentarism elections and the Big Bang). This increased to an average of over one per month on average between 2009 and 2013 (with methods referring to semi-intelligent water drops, group counselling, sports championships, fireflies, paddy fields and mountain climbers), and then to an average of two new metaphor-based methods being published every month in the peer-reviewed literature after 2014 (including not only the sharks, zombies and volleyball methods mentioned in the title of this paper, but also reincarnation, four different whale-based and three distinct footballbased methods, barnacles, chicken swarms, interior design and decoration, and several others). 2 .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Why is this a problem?</head><p>The sheer volume of papers following the same general pattern raises a few important questions. The first one is whether there really are hundreds of fundamentally differ-2 Direct citations of the papers describing the metaphor-based methods mentioned in this work are intentionally not provided. The original references are listed in <ref type="bibr" target="#b7">(Campelo and Aranha, 2021)</ref>, and can be easily found by searching the name of the specific metaphor.</p><p>ent ways to build an optimizer. As of July 2021, the Bestiary lists around 260 unique entries, and a recent comprehensive taxonomy of nature-and bio-inspired optimization approaches suggests as many as 360 <ref type="bibr" target="#b29">(Molina et al., 2020)</ref>. This massive amount of distinct algorithms, each claiming to present a unique way to solve optimization problems is at odds with the relatively simple structure that most of these techniques follow, as well as with the existence of general algorithmic design patterns that generalize many of these techniques <ref type="bibr" target="#b13">(de Jong, 2006;</ref><ref type="bibr" target="#b36">Stegherr et al., 2020;</ref><ref type="bibr" target="#b35">Stegherr and Hähn, 2021;</ref><ref type="bibr" target="#b12">de Armas et al., 2021)</ref>.</p><p>This explosion of metaphor-centered methods has led to an intense fragmentation of the literature into tens of small, barely-discernible niches. The use of metaphor-heavy language when proposing new methods is partly responsible for this, as it adds an unnecessary obstacle to comparing the similarities and differences between two methods at first glance. How should one compare the ability of a bird to drop a cuckoo egg from its nest to the behavior of a scouting bee? It takes a deeper reading to find out, for instance, that these two completely different descriptions refer to the same underlying computational action, namely generating a new random solution when the search has stalled.</p><p>This pattern of reinventing the wheel is seen quite frequently in the metaphor-based optimization literature, as denounced by <ref type="bibr" target="#b33">Sörensen (2013)</ref>. For instance, careful analysis by <ref type="bibr" target="#b44">Weyland (2010</ref><ref type="bibr" target="#b45">Weyland ( , 2015) )</ref> showed that Harmony Search was nothing more than a special case of Evolutionary Strategies. <ref type="bibr" target="#b30">Piotrowski et al. (2014)</ref> analysed the novelty (or lack thereof) of the Black Hole algorithm, while <ref type="bibr" target="#b41">Villalón et al. (2018</ref><ref type="bibr" target="#b42">Villalón et al. ( , 2020) )</ref> did the same for the Intelligent Water Drops, Grey Wolf, Firefly and Bat algorithms. In all these cases, the conclusions were unequivocal -the "novel" algorithm did not in fact contain any novelty beyond the use of a metaphorspecific language, and in fact described another well-known computational algorithm already in use -in some cases for several decades. Based on our reading of the literature, we would expect to find the same pattern of repeated or reinvented ideas in many -if not most -metaphor-based methods, if subject to similar scrutiny. Even in the few cases where new ideas may be found, they become tied to the specific nomenclature of the metaphor, instead of being described in a way that would allow analysis and comparisons to other methods.</p><p>Another common issue is the generally poor methodological standards of the experimental results reported in many of these papers. These problems were not exclusive to metaphor-based methods, but rather part of an area without a strong statistical tradition, as documented since at least the mid-1990s <ref type="bibr" target="#b24">(Hooker, 1994</ref><ref type="bibr" target="#b25">(Hooker, , 1995;;</ref><ref type="bibr" target="#b1">Barr et al., 1995;</ref><ref type="bibr" target="#b17">Eiben and Jelasity, 2002;</ref><ref type="bibr" target="#b21">García-Martínez et al., 2017;</ref><ref type="bibr" target="#b9">Campelo and Takahashi, 2019)</ref>. The field of metaheuristics has been continuously improving its standards and developing better methodological practices <ref type="bibr" target="#b2">(Bartz-Beielstein et al., 2020)</ref>, but the experimental validation presented in the majority of metaphor-centered papers continues to suffer from very serious issues. These include problems that have long been identified <ref type="bibr" target="#b24">(Hooker, 1994</ref><ref type="bibr" target="#b25">(Hooker, , 1995;;</ref><ref type="bibr" target="#b17">Eiben and Jelasity, 2002;</ref><ref type="bibr" target="#b21">García-Martínez et al., 2017;</ref><ref type="bibr" target="#b9">Campelo and Takahashi, 2019)</ref>, including the almost exclusive focus on competitive testing rather than on the underlying working principles of algorithms; overfitting of algorithms and implementations to test problems; the absence of well-defined underlying hypotheses; the exclusive use of very similar algorithms (i.e., other metaphor-based methods) as comparison baselines, instead of state-of-the-art methods; unbalanced tuning efforts between the proposed and competing algorithms; and a general lack of reproducibility.</p><p>Application-oriented venues are particularly vulnerable to being contaminated by "novel" metaphor-based methods. This appears to happen for two main reasons. First, researchers in application fields who look at metaheuristics for solutions to optimization problems get lost in the multitude of papers proposing methods with strange names, unclear connection to each other, and seemingly outstanding results. Often, the choice of which method to use is defined by which names appear more frequently or are cited most often. <ref type="bibr" target="#b10">Chicco and Mazza (2020)</ref> discuss the difficulties faced by application researchers when evaluating metaheuristics in more detail. Second, metaphor creators who find it difficult to publish their research in more optimization-focused journals sometimes opt for submitting their "novel" methods to application journals, where reviewers are less likely to be familiar with the technical shortcomings of these methods, or sometimes even with basic concepts of optimization. In more exasperating cases, the algorithm is submitted to a journal in the area of the the metaphor. A recent example is a "COVID-19 optimization algorithm", published in a high-impact biomedical and health informatics journal, even though the method does not actually address any issues related to these areas. The main justification of that particular paper, as presented in its abstract, can be briefly summarised as:</p><p>1. Covid-19 is overloading hospitals and causing death.</p><p>2. Covid-19 must be contained, and social distancing must be ensured.</p><p>3. Therefore, we need an efficient optimizer capable of "solving NP-hard (sic) in addition to applied optimization problems."</p><p>This argument presents not only a clear non sequitur ("Covid-19 is a problem, therefore we need a new optimization algorithm"), but also suggests lack of understanding of basic aspects of computational complexity. Regardless of that, the paper was published, which suggests that the reviewers themselves also lacked the particular skill set to detect these and other shortcomings of the work. ) by publication venue, highlighting the journals where two or more of these "novel" methods were published. This refers only to the journal where the methods first appeared, not journals that published later applications or refinements. Notice that although optimization / computational intelligence journals are present amongst the top publishers, there is a marked prevalence of application-oriented journals, particularly in engineering domains.</p><p>Another unfortunate result of this contamination is that optimization tracks of some application journals sometimes become "colonized" by cliques that keep publishing minute variations of bizarre methods with little oversight. Figure <ref type="figure" target="#fig_1">2</ref> illustrates part of this phenomenon, by showing the prevalence of application-oriented journals amongst the venues where the first papers describing metaphor-based methods have appeared.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Where does this problem come from?</head><p>The proliferation of metaphor-heavy algorithms in the metaheuristics literature is a multi-faceted problem, involving multiple actors with different motivations. Some factors, however, may be identified as potential contributors to this problem.</p><p>The first is a structure of perverse incentives that permeates the academic environment <ref type="bibr" target="#b16">(Edwards and Roy, 2017)</ref>. The pressure to "publish or perish", coupled with a heavy focus on short-term results to the detriment of a broader and more reflective scientific education in computer science and engineering degrees, tends to reward poor methodological standards and lead to a "natural selection of bad science" <ref type="bibr" target="#b32">(Smaldino and McElreath, 2016)</ref>. In this context, publishing metaphor-based methods is perceived as a low-effort, low-risk process with high potential rewards, a perception that is fueled by "success stories" of authors that have built professional careers out of creating not one, but often multiple metaphor-based methods. As an example, the 6 author names that appear most often in the Bestiary entries have each created between six and ten different metaphorbased methods.<ref type="foot" target="#foot_0">3</ref> These algorithms, despite having in some cases been shown to contain no novelty beyond the use of a new metaphor <ref type="bibr" target="#b41">(Villalón et al., 2018</ref><ref type="bibr" target="#b42">(Villalón et al., , 2020))</ref>, have gathered tens of thousands of citations, a highly desirable prize in an academic culture obsessed with bibliometrics. <ref type="bibr" target="#b39">Tzanetos and Dounias (2021)</ref> highlights this issue, focusing on groups of metaphors proposed by the same research groups and showing the possibility that metaphors may be used to disguise the practice of "salami science" <ref type="bibr" target="#b43">(Wawer, 2018)</ref>, i.e., the slicing down of a single scientific work into several smaller pieces to artificially inflate publication count.</p><p>The lack of a statistically sound tradition in the field also compounds the problem, leading to generally poor practices by the authors and, in many cases, the inability of reviewers to pick up on the main methodological problems of some of these papers, resulting in a particular brand of "cargo cult science" <ref type="bibr" target="#b18">(Feynman, 1974;</ref><ref type="bibr" target="#b22">Hanlon, 2013)</ref>: work that emulates scientific practices -implementation of methods, running of tests, publication of papers, etc. -without actually representing an actual scientific process of defining, testing and refining hypotheses, and incrementally building generalizable knowledge about what works and what does not.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>How to Solve the Metaphor Craze?</head><p>Any potential solution to the metaphor problem must begin by increasing awareness about the problems associated with metaphor-oriented research. This paper is clearly an effort in this direction, but hardly the first. "Metaheuristics -the metaphor exposed" <ref type="bibr" target="#b33">(Sörensen, 2013)</ref> is probably the highest-profile paper raising this issue, and it has become a focal point that inspired several later works discussing the proliferation of those methods. <ref type="bibr" target="#b20">Fong et al. (2016)</ref> not only list common design patterns among metaheuristics, but also show how improper experimentation is being used to claim spurious results in the metaphor-based literature. Works showing the lack of novelty in many of these methods <ref type="bibr" target="#b44">(Weyland, 2010</ref><ref type="bibr" target="#b45">(Weyland, , 2015;;</ref><ref type="bibr" target="#b41">Villalón et al., 2018</ref><ref type="bibr" target="#b42">Villalón et al., , 2020</ref><ref type="bibr" target="#b40">Villalón et al., , 2021;;</ref><ref type="bibr" target="#b30">Piotrowski et al., 2014)</ref> have also brought the issue to the attention of the wider community, helping raise the awareness of the field as a whole.</p><p>In parallel to criticizing the focus on metaphors, it is important to provide and disseminate more constructive alternatives to developing research on metaheuristics. The most common approach is to re-imagine search-based metaheuristic optimization as a framework of semi-independent modules that modify one (or a few) core algorithmic structures. The concept of unified approaches and models for nature-inspired optimization algorithms precedes the proliferation of metaphor-based methods, and it has been discussed in the literature at least since the mid 2000s <ref type="bibr" target="#b13">(de Jong, 2006)</ref>. Later authors suggested a research agenda to solve the issues with metaphor-heavy methods <ref type="bibr" target="#b38">(Swan et al., 2015)</ref>. Other initiatives in that direction include Lones (2020)'s description of a large number of metaphor optimizers using common, non-metaphor language, highlighting the similarities and differences among the algorithms; and de Armas et al. ( <ref type="formula">2021</ref>)'s initial work on defining similarity metrics for metaheuristics, which can greatly simplify the analysis of methods and the investigation of which algorithms can be seen as particular cases of others.</p><p>Several authors have recently proposed taxonomies of search-based optimization methods, where several methods are explained by an unifying framework and its associated components <ref type="bibr" target="#b36">Stegherr et al. (2020)</ref>; <ref type="bibr" target="#b35">Stegherr and Hähn (2021)</ref>; <ref type="bibr" target="#b29">Molina et al. (2020)</ref>; <ref type="bibr" target="#b37">Stork et al. (2020)</ref>. <ref type="foot" target="#foot_2">4</ref> Some of these works go so far as describing specific code for the framework and its components, and using this code to reimplement some of the existing metaphor methods (de <ref type="bibr" target="#b12">Armas et al., 2021;</ref><ref type="bibr" target="#b11">Cruz-Duarte et al., 2020)</ref>. Once we have a framework to describe a generic metaheuristic and components to provide variation in the algorithm, a natural next step is to use automated processes to generate algorithmic variations better tailored to specific problem classes <ref type="bibr" target="#b4">(Bezerra et al., 2015;</ref><ref type="bibr" target="#b8">Campelo et al., 2020;</ref><ref type="bibr" target="#b5">Bezerra et al., 2020)</ref>.</p><p>A more aggressive approach to change the current structure of incentives is the implementation of strict editorial policies against this sort of practice. This has recently become more common, with journals such as the Journal of Heuristics, Evolutionary Computation, 4OR, ACM Trans. Evolutionary Learning and Optimization and Swarm Intelligence <ref type="bibr" target="#b14">(Dorigo, 2016)</ref> including specific statements against the submission of methods that fail to describe their contributions in metaphor-free, standard computational/mathematical terms. To help bring the issue to the attention of the editorial boards of application-oriented as well as optimization journals, a group of researchers <ref type="bibr" target="#b0">(Aranha et al., 2021)</ref> has recently started to circulate an open letter to the editors-in-chief of several venues, recommending that explicit editorial policies be put in place to prevent or mitigate the "colonization" problem described earlier. We hope that an editorial barrier to the publication of works that fail to reach some minimal methodological standards, coupled with the increase in awareness not only of these issues, but also of alternative, more methodologically sound approaches to research in metaheuristics, may help gradually improve the quality of works developed in the field.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Conclusions</head><p>In the last 20 years, the field of metaheuristic optimization has seen a flood of "novel" metaphor-inspired methods, which are neither novel nor based on metaphors that are particularly connected to optimization. Cataloguing these methods through the Evolutionary Computation Bestiary, we have observed how this phenomenon has had a negative impact on the field, wasting the work of scientists and reviewers on methods that reinvent the wheel over and over again, hiding sloppy or dubious practices, and confusing application researchers through sheer quantity of similarsounding optimization methods.</p><p>There is now a push-back from the metaheuristics community. Several papers have been published about the issues with metaphor-heavy optimization, and journals are starting to change their policies to reject papers that provide no novelty other than a new metaphor. However, our experience tells us that change is still likely to be slow. <ref type="foot" target="#foot_3">5</ref> Even when metaheuristics journals cease to become a breeding ground for the metaphors, this change will take time to spread to application venues, where groups that have specialized into the regular publication of new metaphors managed to acquire a stronghold.</p><p>On a more positive note, the continued efforts by the community to fix this problem may have helped steer the metaheuristics field towards more scientific practices. Recent works criticizing the metaphor phenomenon have focused on how to improve the experimental soundness, reproducibility, and standardization of new approaches, which hopefully indicates that the full transition from the "Age of Metaphors" into what <ref type="bibr" target="#b34">Sörensen et al. (2018)</ref> called the "scientific phase of metaheuristic research" may already be well underway.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: New metaphor-based methods between 2000 and 2020, as catalogued in the Evolutionary Computation Bestiary. The apparent decline in 2020 is, unfortunately, unlikely to represent a true reduction in the number of new metaphors, and is possibly the consequence of delays in finding and recording new entries on the website.</figDesc><graphic coords="2,72.45,54.00,201.60,201.60" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Distribution of new metaphor-based methods (since 2000) by publication venue, highlighting the journals where two or more of these "novel" methods were published. This refers only to the journal where the methods first appeared, not journals that published later applications or refinements. Notice that although optimization / computational intelligence journals are present amongst the top publishers, there is a marked prevalence of application-oriented journals, particularly in engineering domains.</figDesc><graphic coords="3,332.91,54.00,211.68,352.80" type="bitmap" /></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_0">There are at least</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="40" xml:id="foot_1">authors that have created two or more methods.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_2">Of course, one should note that the proposal of any standard framework for metaheuristics can raise its own issues, as illustrated in https://xkcd.com/927/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="5" xml:id="foot_3">For instance, although the critical tone of the Bestiary is clearly stated in the repository, we are often contacted by authors of "novel" metaphor-based metaheuristics requesting that their work be listed. It has never been quite clear to us if these authors didn't understand the tone of the page, or if they assume that the exposition would be a net positive for their work.</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgements</head><p>We would like to thank the contributors to the Evolutionary Computation Bestiary for their suggestions of new entries, as well as for several interesting discussions over the years about how to deal with the metaphor craze in metaheuristics.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Metaphorbased metaheuristics: a call for action</title>
		<author>
			<persName><forename type="first">C</forename><surname>Aranha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">L C</forename><surname>Villalón</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Campelo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dorigo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Ruiz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sevaux</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Sörensen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Stützle</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
	<note>To appear in Swarm Intelligence</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Designing and reporting on computational experiments with heuristic methods</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">S</forename><surname>Barr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">L</forename><surname>Golden</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">P</forename><surname>Kelly</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">G</forename><surname>Resende</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">R</forename><surname>Stewart</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of heuristics</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="9" to="32" />
			<date type="published" when="1995">1995</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Benchmarking in optimization: Best practice and open issues</title>
		<author>
			<persName><forename type="first">T</forename><surname>Bartz-Beielstein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Doerr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">V D</forename><surname>Berg</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Bossek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Chandrasekaran</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Eftimov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Fischbach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Kerschke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>La Cava</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Lopez-Ibanez</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2007.03488</idno>
		<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Evolution strategies-a comprehensive introduction</title>
		<author>
			<persName><forename type="first">H.-G</forename><surname>Beyer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H.-P</forename><surname>Schwefel</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Natural computing</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="3" to="52" />
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Automatic component-wise design of multiobjective evolutionary algorithms</title>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">C</forename><surname>Bezerra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>López-Ibánez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Stützle</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Evolutionary Computation</title>
		<imprint>
			<biblScope unit="volume">20</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="403" to="417" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Automatically designing state-of-the-art multi-and many-objective evolutionary algorithms</title>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">C</forename><surname>Bezerra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Manuel</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Evolutionary computation</title>
		<imprint>
			<biblScope unit="volume">28</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="195" to="226" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Optimization through evolution and recombination</title>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">J</forename><surname>Bremermann</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Self-organizing systems</title>
		<imprint>
			<biblScope unit="volume">93</biblScope>
			<biblScope unit="page">106</biblScope>
			<date type="published" when="1962">1962</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<title level="m" type="main">Evolutionary Computation Bestiary</title>
		<author>
			<persName><forename type="first">F</forename><surname>Campelo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Aranha</surname></persName>
		</author>
		<ptr target="https://fcampelo.github.io/EC-Bestiary" />
		<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">The moeadr package: A component-based framework for multiobjective evolutionary algorithms based on decomposition</title>
		<author>
			<persName><forename type="first">F</forename><surname>Campelo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">S</forename><surname>Batista</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Aranha</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Statistical Software</title>
		<imprint>
			<biblScope unit="volume">92</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="1" to="39" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Sample size estimation for power and accuracy in the experimental comparison of algorithms</title>
		<author>
			<persName><forename type="first">F</forename><surname>Campelo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Takahashi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Heuristics</title>
		<imprint>
			<biblScope unit="volume">25</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="305" to="338" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Metaheuristic optimization of power and energy systems: Underlying principles and main issues of the &quot;rush to heuristics</title>
		<author>
			<persName><forename type="first">G</forename><surname>Chicco</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Mazza</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Energies</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="issue">19</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Towards a generalised metaheuristic model for continuous optimisation problems</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">M</forename><surname>Cruz-Duarte</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">C</forename><surname>Ortiz-Bayliss</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Amaya</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Shi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Terashima-Marín</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Pillay</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Mathematics</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="issue">11</biblScope>
			<biblScope unit="page">2046</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Similarity in metaheuristics: a gentle step towards a comparison methodology</title>
		<author>
			<persName><forename type="first">J</forename><surname>De Armas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Lalla-Ruiz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">L</forename><surname>Tilahun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Voß</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Natural Computing</title>
		<imprint>
			<biblScope unit="page" from="1" to="23" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<title level="m" type="main">Evolutionary Computation: A Unified Approach</title>
		<author>
			<persName><forename type="first">Jong</forename><surname>De</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename></persName>
		</author>
		<imprint>
			<date type="published" when="2006">2006</date>
			<publisher>MIT Press</publisher>
		</imprint>
	</monogr>
	<note>1st edition</note>
</biblStruct>

<biblStruct xml:id="b14">
	<monogr>
		<title level="m" type="main">Swarm intelligence: A few things you need to know if you want to publish in this journal</title>
		<author>
			<persName><forename type="first">M</forename><surname>Dorigo</surname></persName>
		</author>
		<ptr target="https://www.springer.com/cda/content/document/cda_downloaddocument/Additional_submission_instructions.pdf" />
		<imprint>
			<date type="published" when="2016-07-26">2016. July 26, 2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Ant system: optimization by a colony of cooperating agents</title>
		<author>
			<persName><forename type="first">M</forename><surname>Dorigo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Maniezzo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Colorni</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)</title>
		<imprint>
			<biblScope unit="volume">26</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="29" to="41" />
			<date type="published" when="1996">1996</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Academic research in the 21st century: Maintaining scientific integrity in a climate of perverse incentives and hypercompetition</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Edwards</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Roy</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Environmental engineering science</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="51" to="61" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">A critical note on experimental research methodology in ec</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">E</forename><surname>Eiben</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Jelasity</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2002 Congress on Evolutionary Computation</title>
				<meeting>the 2002 Congress on Evolutionary Computation</meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2002">2002</date>
			<biblScope unit="page" from="582" to="587" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Cargo cult science</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">P</forename><surname>Feynman</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Engineering and Science</title>
		<imprint>
			<biblScope unit="volume">37</biblScope>
			<biblScope unit="issue">7</biblScope>
			<biblScope unit="page" from="10" to="13" />
			<date type="published" when="1974">1974</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">An introduction to evolutionary programming</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">B</forename><surname>Fogel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">J</forename><surname>Fogel</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">European conference on artificial evolution</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="1995">1995</date>
			<biblScope unit="page" from="21" to="33" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Recent advances in metaheuristic algorithms: Does the makara dragon exist?</title>
		<author>
			<persName><forename type="first">S</forename><surname>Fong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Wong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Fiaidhi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Mohammed</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">The Journal of Supercomputing</title>
		<imprint>
			<biblScope unit="volume">72</biblScope>
			<biblScope unit="issue">10</biblScope>
			<biblScope unit="page" from="3764" to="3786" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Since CEC 2005 competition on real-parameter optimisation: a decade of research, progress and comparative analysis&apos;s weakness</title>
		<author>
			<persName><forename type="first">C</forename><surname>García-Martínez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">D</forename><surname>Gutiérrez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Molina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Lozano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Herrera</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Soft Computing</title>
		<imprint>
			<biblScope unit="volume">21</biblScope>
			<biblScope unit="issue">19</biblScope>
			<biblScope unit="page" from="5573" to="5583" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Cargo cult science</title>
		<author>
			<persName><forename type="first">M</forename><surname>Hanlon</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">European Review</title>
		<imprint>
			<biblScope unit="volume">21</biblScope>
			<biblScope unit="issue">S1</biblScope>
			<biblScope unit="page" from="S51" to="S55" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<monogr>
		<title level="m" type="main">Adaptation in Natural and Artificial Systems</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Holland</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1975">1975</date>
			<publisher>University of Michigan Press</publisher>
			<pubPlace>Ann Arbor, MI</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Needed: An empirical science of algorithms</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">N</forename><surname>Hooker</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Operations research</title>
		<imprint>
			<biblScope unit="volume">42</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="201" to="212" />
			<date type="published" when="1994">1994</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Testing heuristics: We have it all wrong</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">N</forename><surname>Hooker</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of heuristics</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="33" to="42" />
			<date type="published" when="1995">1995</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Particle swarm optimization</title>
		<author>
			<persName><forename type="first">J</forename><surname>Kennedy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Eberhart</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of ICNN&apos;95-international conference on neural networks</title>
				<meeting>ICNN&apos;95-international conference on neural networks</meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="1995">1995</date>
			<biblScope unit="volume">4</biblScope>
			<biblScope unit="page" from="1942" to="1948" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Optimization by simulated annealing</title>
		<author>
			<persName><forename type="first">S</forename><surname>Kirkpatrick</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">D</forename><surname>Gelatt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">P</forename><surname>Vecchi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Science</title>
		<imprint>
			<biblScope unit="volume">220</biblScope>
			<biblScope unit="page" from="671" to="680" />
			<date type="published" when="1983">1983. 4598</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">Mitigating metaphors: A comprehensible guide to recent nature-inspired algorithms</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Lones</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">SN Computer Science</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="1" to="12" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Comprehensive taxonomies of natureand bio-inspired optimization: Inspiration versus algorithmic behavior, critical analysis recommendations</title>
		<author>
			<persName><forename type="first">D</forename><surname>Molina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Poyatos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">D</forename><surname>Ser</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>García</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Hussain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Herrera</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Cognitive Computation</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="897" to="939" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">How novel is the &quot;novel&quot; black hole optimization approach?</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">P</forename><surname>Piotrowski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">J</forename><surname>Napiorkowski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">M</forename><surname>Rowinski</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Information Sciences</title>
		<imprint>
			<biblScope unit="volume">267</biblScope>
			<biblScope unit="page" from="191" to="200" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">Chemistry&apos;s visual origins</title>
		<author>
			<persName><forename type="first">A</forename><surname>Robinson</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Nature</title>
		<imprint>
			<biblScope unit="volume">465</biblScope>
			<biblScope unit="page" from="36" to="36" />
			<date type="published" when="2010">2010. 7294</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<analytic>
		<title level="a" type="main">The natural selection of bad science</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">E</forename><surname>Smaldino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Mcelreath</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Royal Society Open Science</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="issue">9</biblScope>
			<biblScope unit="page">160384</biblScope>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<analytic>
		<title level="a" type="main">Metaheuristics-the metaphor exposed</title>
		<author>
			<persName><forename type="first">K</forename><surname>Sörensen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Transactions in Operational Research</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="3" to="18" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<monogr>
		<title level="m" type="main">A History of Metaheuristics</title>
		<author>
			<persName><forename type="first">K</forename><surname>Sörensen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sevaux</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Glover</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2018">2018</date>
			<publisher>Springer International Publishing</publisher>
			<biblScope unit="page" from="791" to="808" />
			<pubPlace>Cham</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b35">
	<analytic>
		<title level="a" type="main">Analysing metaheuristic components</title>
		<author>
			<persName><forename type="first">H</forename><surname>Stegherr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Hähn</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 9th LIFELIKE Workshop</title>
				<meeting>the 9th LIFELIKE Workshop</meeting>
		<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b36">
	<analytic>
		<title level="a" type="main">Classifying metaheuristics: Towards a unified multi-level classification system</title>
		<author>
			<persName><forename type="first">H</forename><surname>Stegherr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Heider</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Hähner</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Natural Computing</title>
		<imprint>
			<biblScope unit="page" from="1" to="17" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b37">
	<analytic>
		<title level="a" type="main">A new taxonomy of global optimization algorithms</title>
		<author>
			<persName><forename type="first">J</forename><surname>Stork</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">E</forename><surname>Eiben</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Bartz-Beielstein</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Natural Computing</title>
		<imprint>
			<biblScope unit="page" from="1" to="24" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b38">
	<analytic>
		<title level="a" type="main">A research agenda for metaheuristic standardization</title>
		<author>
			<persName><forename type="first">J</forename><surname>Swan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Adriaensen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bishr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">K</forename><surname>Burke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Clark</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>De Causmaecker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Durillo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Hammond</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Hart</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">G</forename><surname>Johnson</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the XI Metaheuristics International Conference</title>
				<meeting>the XI Metaheuristics International Conference</meeting>
		<imprint>
			<date type="published" when="2015">2015</date>
			<biblScope unit="page" from="1" to="3" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b39">
	<analytic>
		<title level="a" type="main">Nature inspired optimization algorithms or simply variations of metaheuristics?</title>
		<author>
			<persName><forename type="first">A</forename><surname>Tzanetos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Dounias</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Artificial Intelligence Review</title>
		<imprint>
			<biblScope unit="volume">54</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="1841" to="1862" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b40">
	<monogr>
		<title level="m" type="main">Cuckoo search ≡ (µ + λ)-evolution strategy: A rigorous analysis of an algorithm that has been misleading the research community for more than 10 years and nobody seems to have noticed</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">C</forename><surname>Villalón</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Stützle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dorigo</surname></persName>
		</author>
		<idno>TR/IRIDIA/2021- 006</idno>
		<ptr target="https://iridia.ulb.ac.be/IridiaTrSeries/link/IridiaTr2021-006.pdf" />
		<imprint>
			<date type="published" when="2021">2021</date>
			<pubPlace>Belgium</pubPlace>
		</imprint>
		<respStmt>
			<orgName>IRIDIA, Université Libre de Bruxelles</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Technical Report</note>
</biblStruct>

<biblStruct xml:id="b41">
	<analytic>
		<title level="a" type="main">Why the intelligent water drops cannot be considered as a novel algorithm</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">L C</forename><surname>Villalón</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dorigo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Stützle</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Swarm Intelligence</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="302" to="314" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b42">
	<analytic>
		<title level="a" type="main">Grey wolf, firefly and bat algorithms: Three widespread algorithms that do not contain any novelty</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">L C</forename><surname>Villalón</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Stützle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dorigo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Swarm Intelligence</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="121" to="133" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b43">
	<analytic>
		<title level="a" type="main">How to stop salami science: promotion of healthy trends in publishing behavior</title>
		<author>
			<persName><forename type="first">J</forename><surname>Wawer</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Accountability in Research</title>
		<imprint>
			<biblScope unit="volume">26</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="33" to="48" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b44">
	<analytic>
		<title level="a" type="main">A rigorous analysis of the harmony search algorithm: How the research community can be misled by a &quot;novel&quot; methodology</title>
		<author>
			<persName><forename type="first">D</forename><surname>Weyland</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Applied Metaheuristic Computing (IJAMC)</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="50" to="60" />
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b45">
	<analytic>
		<title level="a" type="main">A critical analysis of the harmony search algorithm-how not to solve sudoku</title>
		<author>
			<persName><forename type="first">D</forename><surname>Weyland</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Operations Research Perspectives</title>
		<imprint>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="page" from="97" to="105" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
