<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>J. N. (1995). Testing heuristics: We have it all wrong.
Journal of heuristics</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Sharks, Zombies and Volleyball: Lessons from the Evolutionary Computation Bestiary</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Felipe Campelo</string-name>
          <email>f.campelo@aston.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Claus Aranha</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>College of Engineering and Physical Sciences, Aston University UK</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Faculty of Systems and Information Engineering, University of Tsukuba</institution>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1942</year>
      </pub-date>
      <volume>4</volume>
      <fpage>33</fpage>
      <lpage>42</lpage>
      <abstract>
        <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 phenomena from 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>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>In 1865, August Kekule´ proposed that the structure of
benzene was a hexagonal ring of six carbon atoms, solving a
problem that had confounded chemists for decades. Kekule´
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 Kekule´ himself only
went on record about his original inspiration in 1890, at a
meeting held in his honor (Robinson, 2010).</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
        <xref ref-type="bibr" rid="ref16 ref18 ref20 ref20 ref4 ref7">(Bremermann et al., 1962;
Fogel and Fogel, 1995; Beyer and Schwefel, 2002; Holland,
1975; Kirkpatrick et al., 1983; Kennedy and Eberhart, 1995;
Dorigo et al., 1996)</xref>
        . 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>
    </sec>
    <sec id="sec-2">
      <title>The Age of the Metaphors</title>
      <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
        <xref ref-type="bibr" rid="ref1 ref28 ref32 ref8">(Campelo and Aranha, 2021)</xref>
        . As the website started to
attract attention, several colleagues contacted us to
recom1Notice the contrast with the opening anecdote about Kekule´’s
inspiration.
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 1 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>
    </sec>
    <sec id="sec-3">
      <title>Why is this a problem?</title>
      <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
differ2Direct citations of the papers describing the metaphor-based
methods mentioned in this work are intentionally not provided. The
original references are listed in
        <xref ref-type="bibr" rid="ref1 ref28 ref32 ref8">(Campelo and Aranha, 2021)</xref>
        , and
can be easily found by searching the name of the specific metaphor.
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
        <xref ref-type="bibr" rid="ref23">(Molina et al., 2020)</xref>
        .
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
        <xref ref-type="bibr" rid="ref13 ref14 ref28 ref29 ref32 ref8">(de Jong, 2006; Stegherr et al., 2020; Stegherr
and Ha¨hn, 2021; de Armas et al., 2021)</xref>
        .
      </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 So¨rensen (2013). For instance, careful
analysis by Weyland (2010, 2015) showed that Harmony Search
was nothing more than a special case of Evolutionary
Strategies.
        <xref ref-type="bibr" rid="ref24">Piotrowski et al. (2014)</xref>
        analysed the novelty (or lack
thereof) of the Black Hole algorithm, while Villalo´n et al.
(2018, 2020) 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
        <xref ref-type="bibr" rid="ref10 ref17 ref18 ref2 ref22 ref4">(Hooker, 1994, 1995; Barr et al.,
1995; Eiben and Jelasity, 2002; Garc´ıa-Mart´ınez et al., 2017;
Campelo and Takahashi, 2019)</xref>
        . The field of
metaheuristics has been continuously improving its standards and
developing better methodological practices
        <xref ref-type="bibr" rid="ref3">(Bartz-Beielstein
et al., 2020)</xref>
        , 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
        <xref ref-type="bibr" rid="ref10 ref17 ref18 ref22 ref4">(Hooker, 1994, 1995; Eiben and
Jelasity, 2002; Garc´ıa-Mart´ınez et al., 2017; Campelo and
Takahashi, 2019)</xref>
        , 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.
        <xref ref-type="bibr" rid="ref11">Chicco and Mazza (2020)</xref>
        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:
1. Covid-19 is overloading hospitals and causing death.
2. Covid-19 must be contained, and social distancing must
be ensured.
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.</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 2
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>
    </sec>
    <sec id="sec-4">
      <title>Where does this problem come from?</title>
      <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
        <xref ref-type="bibr" rid="ref17">(Edwards and Roy, 2017)</xref>
        .
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”
        <xref ref-type="bibr" rid="ref25">(Smaldino and McElreath, 2016)</xref>
        . 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.3 These algorithms, despite having in some
cases been shown to contain no novelty beyond the use of
a new metaphor
        <xref ref-type="bibr" rid="ref34 ref35">(Villalo´ n et al., 2018, 2020)</xref>
        , have gathered
tens of thousands of citations, a highly desirable prize in an
academic culture obsessed with bibliometrics.
        <xref ref-type="bibr" rid="ref32">Tzanetos and
Dounias (2021)</xref>
        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”
        <xref ref-type="bibr" rid="ref36">(Wawer, 2018)</xref>
        , 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”
        <xref ref-type="bibr" rid="ref19">(Feynman, 1974; Hanlon, 2013)</xref>
        : 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>
    </sec>
    <sec id="sec-5">
      <title>How to Solve the Metaphor Craze?</title>
      <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”
        <xref ref-type="bibr" rid="ref26">(So¨ rensen, 2013)</xref>
        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.
        <xref ref-type="bibr" rid="ref21">Fong et al. (2016)</xref>
        not
only list common design patterns among metaheuristics,
3There are at least 40 authors that have created two or more
methods.
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
        <xref ref-type="bibr" rid="ref1 ref24 ref33 ref34 ref35 ref37 ref38">(Weyland, 2010, 2015; Villalo´ n et al., 2018, 2020, 2021;
Piotrowski et al., 2014)</xref>
        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
        <xref ref-type="bibr" rid="ref14">(de Jong,
2006)</xref>
        . Later authors suggested a research agenda to solve
the issues with metaphor-heavy methods
        <xref ref-type="bibr" rid="ref31">(Swan et al., 2015)</xref>
        .
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. (2021)’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
        <xref ref-type="bibr" rid="ref29">Stegherr et al. (2020)</xref>
        ;
        <xref ref-type="bibr" rid="ref28">Stegherr and Ha¨hn
(2021)</xref>
        ;
        <xref ref-type="bibr" rid="ref23">Molina et al. (2020)</xref>
        ;
        <xref ref-type="bibr" rid="ref30">Stork et al. (2020)</xref>
        .4 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
        <xref ref-type="bibr" rid="ref12 ref13">(de
Armas et al., 2021; Cruz-Duarte et al., 2020)</xref>
        . 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
        <xref ref-type="bibr" rid="ref5 ref6 ref9">(Bezerra et al., 2015; Campelo et al., 2020; Bezerra et al., 2020)</xref>
        .
      </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
        <xref ref-type="bibr" rid="ref15">(Dorigo, 2016)</xref>
        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
4Of 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/
the attention of the editorial boards of application-oriented
as well as optimization journals, a group of researchers
        <xref ref-type="bibr" rid="ref1 ref8">(Aranha et al., 2021)</xref>
        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>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <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.5 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
        <xref ref-type="bibr" rid="ref27">So¨ rensen et al. (2018</xref>
        ) called the
“scientific phase of metaheuristic research” may already be well
underway.
      </p>
      <p>5For 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.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgements</title>
      <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>
      <p>Hanlon, M. (2013).</p>
      <p>21(S1):S51–S55.</p>
      <p>Cargo cult science.</p>
      <p>European Review,</p>
      <p>Hooker, J. N. (1994). Needed: An empirical science of algorithms.</p>
      <p>Operations research, 42(2):201–212.
Lones, M. A. (2020). Mitigating metaphors: A comprehensible
guide to recent nature-inspired algorithms. SN Computer
Science, 1(1):1–12.</p>
      <p>Robinson, A. (2010).</p>
      <p>465(7294):36–36.</p>
      <p>Chemistry’s visual origins.</p>
      <p>Nature,</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Aranha</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , Villalo´n,
          <string-name>
            <given-names>C. L. C.</given-names>
            ,
            <surname>Campelo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Dorigo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ruiz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Sevaux</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          , So¨rensen,
          <string-name>
            <surname>K.</surname>
          </string-name>
          , and Stu¨tzle,
          <string-name>
            <surname>T.</surname>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>Metaphorbased metaheuristics: a call for action</article-title>
          . To appear in Swarm Intelligence.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Barr</surname>
            ,
            <given-names>R. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Golden</surname>
            ,
            <given-names>B. L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kelly</surname>
            ,
            <given-names>J. P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Resende</surname>
            ,
            <given-names>M. G.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Stewart</surname>
            ,
            <given-names>W. R.</given-names>
          </string-name>
          (
          <year>1995</year>
          ).
          <article-title>Designing and reporting on computational experiments with heuristic methods</article-title>
          .
          <source>Journal of heuristics</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ):
          <fpage>9</fpage>
          -
          <lpage>32</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Bartz-Beielstein</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Doerr</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berg</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          v. d.,
          <string-name>
            <surname>Bossek</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chandrasekaran</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eftimov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fischbach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kerschke</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>La Cava</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lopez-Ibanez</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , et al. (
          <year>2020</year>
          ).
          <article-title>Benchmarking in optimization: Best practice and open issues</article-title>
          . arXiv preprint arXiv:
          <year>2007</year>
          .03488.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Beyer</surname>
          </string-name>
          , H.-G. and
          <string-name>
            <surname>Schwefel</surname>
            ,
            <given-names>H.-P.</given-names>
          </string-name>
          (
          <year>2002</year>
          ).
          <article-title>Evolution strategies-a comprehensive introduction</article-title>
          .
          <source>Natural computing</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ):
          <fpage>3</fpage>
          -
          <lpage>52</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Bezerra</surname>
            ,
            <given-names>L. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lo´</surname>
            pez-Iba´nez, M., and Stu¨tzle,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2015</year>
          ).
          <article-title>Automatic component-wise design of multiobjective evolutionary algorithms</article-title>
          .
          <source>IEEE Transactions on Evolutionary Computation</source>
          ,
          <volume>20</volume>
          (
          <issue>3</issue>
          ):
          <fpage>403</fpage>
          -
          <lpage>417</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Bezerra</surname>
            ,
            <given-names>L. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manuel</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , et al. (
          <year>2020</year>
          ).
          <article-title>Automatically designing state-of-the-art multi-and many-objective evolutionary algorithms</article-title>
          .
          <source>Evolutionary computation</source>
          ,
          <volume>28</volume>
          (
          <issue>2</issue>
          ):
          <fpage>195</fpage>
          -
          <lpage>226</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Bremermann</surname>
            ,
            <given-names>H. J.</given-names>
          </string-name>
          et al. (
          <year>1962</year>
          ).
          <article-title>Optimization through evolution and recombination</article-title>
          .
          <source>Self-organizing systems</source>
          ,
          <volume>93</volume>
          :
          <fpage>106</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Campelo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Aranha</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>Evolutionary Computation Bestiary</article-title>
          . Online: https://fcampelo.github.io/EC-Bestiary.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Campelo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Batista</surname>
            ,
            <given-names>L. S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Aranha</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>The moeadr package: A component-based framework for multiobjective evolutionary algorithms based on decomposition</article-title>
          .
          <source>Journal of Statistical Software</source>
          ,
          <volume>92</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>39</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Campelo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Takahashi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2019</year>
          ).
          <article-title>Sample size estimation for power and accuracy in the experimental comparison of algorithms</article-title>
          .
          <source>Journal of Heuristics</source>
          ,
          <volume>25</volume>
          (
          <issue>2</issue>
          ):
          <fpage>305</fpage>
          -
          <lpage>338</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Chicco</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Mazza</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Metaheuristic optimization of power and energy systems: Underlying principles and main issues of the “rush to heuristics”</article-title>
          .
          <source>Energies</source>
          ,
          <volume>13</volume>
          (
          <issue>19</issue>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Cruz-Duarte</surname>
            ,
            <given-names>J. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ortiz-Bayliss</surname>
            ,
            <given-names>J. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Amaya</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shi</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , Terashima-Mar´ın, H., and
          <string-name>
            <surname>Pillay</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Towards a generalised metaheuristic model for continuous optimisation problems</article-title>
          . Mathematics,
          <volume>8</volume>
          (
          <issue>11</issue>
          ):
          <year>2046</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>de Armas</surname>
          </string-name>
          , J.,
          <string-name>
            <surname>Lalla-Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tilahun</surname>
            ,
            <given-names>S. L.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Voß</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>Similarity in metaheuristics: a gentle step towards a comparison methodology</article-title>
          .
          <source>Natural Computing</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          de Jong, K. (
          <year>2006</year>
          ).
          <article-title>Evolutionary Computation: A Unified Approach</article-title>
          . MIT Press,
          <article-title>1st edition</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Dorigo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2016</year>
          ).
          <article-title>Swarm intelligence: A few things you need to know if you want to publish in this journal</article-title>
          . https://www.springer.com/cda/ content/document/cda_downloaddocument/ Additional_submission_instructions.pdf.
          <source>Acessed on July 26</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Dorigo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maniezzo</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Colorni</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>1996</year>
          ).
          <article-title>Ant system: optimization by a colony of cooperating agents</article-title>
          .
          <source>IEEE Transactions on Systems, Man, and Cybernetics</source>
          ,
          <string-name>
            <surname>Part</surname>
            <given-names>B</given-names>
          </string-name>
          (Cybernetics),
          <volume>26</volume>
          (
          <issue>1</issue>
          ):
          <fpage>29</fpage>
          -
          <lpage>41</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <surname>Edwards</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Roy</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>Academic research in the 21st century: Maintaining scientific integrity in a climate of perverse incentives and hypercompetition</article-title>
          .
          <source>Environmental engineering science</source>
          ,
          <volume>34</volume>
          (
          <issue>1</issue>
          ):
          <fpage>51</fpage>
          -
          <lpage>61</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <surname>Eiben</surname>
            ,
            <given-names>A. E.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Jelasity</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2002</year>
          ).
          <article-title>A critical note on experimental research methodology in ec</article-title>
          .
          <source>In Proceedings of the 2002 Congress on Evolutionary Computation.</source>
          , pages
          <fpage>582</fpage>
          -
          <lpage>587</lpage>
          . IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <surname>Feynman</surname>
            ,
            <given-names>R. P.</given-names>
          </string-name>
          (
          <year>1974</year>
          ).
          <article-title>Cargo cult science</article-title>
          .
          <source>Engineering and Science</source>
          ,
          <volume>37</volume>
          (
          <issue>7</issue>
          ):
          <fpage>10</fpage>
          -
          <lpage>13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <surname>Fogel</surname>
            ,
            <given-names>D. B.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Fogel</surname>
            ,
            <given-names>L. J.</given-names>
          </string-name>
          (
          <year>1995</year>
          ).
          <article-title>An introduction to evolutionary programming</article-title>
          .
          <source>In European conference on artificial evolution</source>
          , pages
          <fpage>21</fpage>
          -
          <lpage>33</lpage>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <string-name>
            <surname>Fong</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wong</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fiaidhi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Mohammed</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2016</year>
          ).
          <article-title>Recent advances in metaheuristic algorithms: Does the makara dragon exist?</article-title>
          <source>The Journal of Supercomputing</source>
          ,
          <volume>72</volume>
          (
          <issue>10</issue>
          ):
          <fpage>3764</fpage>
          -
          <lpage>3786</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <surname>Garc´</surname>
            ıa-Mart´ınez,
            <given-names>C.</given-names>
          </string-name>
          , Gutie´rrez, P. D.,
          <string-name>
            <surname>Molina</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lozano</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Herrera</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>Since CEC 2005 competition on real-parameter optimisation: a decade of research, progress and comparative analysis's weakness</article-title>
          .
          <source>Soft Computing</source>
          ,
          <volume>21</volume>
          (
          <issue>19</issue>
          ):
          <fpage>5573</fpage>
          -
          <lpage>5583</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <string-name>
            <surname>Molina</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poyatos</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ser</surname>
            ,
            <given-names>J. D.</given-names>
          </string-name>
          , Garc´ıa,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Hussain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            , and
            <surname>Herrera</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Comprehensive taxonomies of natureand bio-inspired optimization: Inspiration versus algorithmic behavior, critical analysis recommendations</article-title>
          .
          <source>Cognitive Computation</source>
          ,
          <volume>12</volume>
          (
          <issue>5</issue>
          ):
          <fpage>897</fpage>
          -
          <lpage>939</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <string-name>
            <surname>Piotrowski</surname>
            ,
            <given-names>A. P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napiorkowski</surname>
            ,
            <given-names>J. J.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Rowinski</surname>
            ,
            <given-names>P. M.</given-names>
          </string-name>
          (
          <year>2014</year>
          ).
          <article-title>How novel is the “novel” black hole optimization approach?</article-title>
          <source>Information Sciences</source>
          ,
          <volume>267</volume>
          :
          <fpage>191</fpage>
          -
          <lpage>200</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <string-name>
            <surname>Smaldino</surname>
            ,
            <given-names>P. E.</given-names>
          </string-name>
          and
          <string-name>
            <surname>McElreath</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2016</year>
          ).
          <article-title>The natural selection of bad science</article-title>
          .
          <source>Royal Society Open Science</source>
          ,
          <volume>3</volume>
          (
          <issue>9</issue>
          ):
          <fpage>160384</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <string-name>
            <surname>So</surname>
            ¨ rensen,
            <given-names>K.</given-names>
          </string-name>
          (
          <year>2013</year>
          ).
          <article-title>Metaheuristics-the metaphor exposed</article-title>
          .
          <source>International Transactions in Operational Research</source>
          ,
          <volume>22</volume>
          (
          <issue>1</issue>
          ):
          <fpage>3</fpage>
          -
          <lpage>18</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          <string-name>
            <surname>So</surname>
            ¨ rensen,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sevaux</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Glover</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2018</year>
          ).
          <source>A History of Metaheuristics</source>
          , pages
          <fpage>791</fpage>
          -
          <lpage>808</lpage>
          . Springer International Publishing, Cham.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          <string-name>
            <surname>Stegherr</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          and
          <article-title>Ha¨hn</article-title>
          , J. (
          <year>2021</year>
          ).
          <article-title>Analysing metaheuristic components</article-title>
          .
          <source>In Proceedings of the 9th LIFELIKE Workshop.</source>
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          <string-name>
            <surname>Stegherr</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heider</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , and Ha¨hner, J. (
          <year>2020</year>
          ).
          <article-title>Classifying metaheuristics: Towards a unified multi-level classification system</article-title>
          .
          <source>Natural Computing</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          <string-name>
            <surname>Stork</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eiben</surname>
            ,
            <given-names>A. E.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Bartz-Beielstein</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>A new taxonomy of global optimization algorithms</article-title>
          .
          <source>Natural Computing</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>24</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          <string-name>
            <surname>Swan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Adriaensen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bishr</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burke</surname>
            ,
            <given-names>E. K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Causmaecker</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Durillo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hammond</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hart</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Johnson</surname>
          </string-name>
          , C. G., et al. (
          <year>2015</year>
          ).
          <article-title>A research agenda for metaheuristic standardization</article-title>
          .
          <source>In Proceedings of the XI Metaheuristics International Conference</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>3</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          <string-name>
            <surname>Tzanetos</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Dounias</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>Nature inspired optimization algorithms or simply variations of metaheuristics?</article-title>
          <source>Artificial Intelligence Review</source>
          ,
          <volume>54</volume>
          (
          <issue>3</issue>
          ):
          <fpage>1841</fpage>
          -
          <lpage>1862</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          <string-name>
            <surname>Villal o´n</surname>
            ,
            <given-names>C. C.</given-names>
          </string-name>
          , St u¨tzle, T., and
          <string-name>
            <surname>Dorigo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>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</article-title>
          .
          <source>Technical Report TR/IRIDIA/2021- 006</source>
          , IRIDIA, Universite´ Libre de Bruxelles, Belgium. https://iridia.ulb.ac.be/IridiaTrSeries/link/IridiaTr2021- 006.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          <string-name>
            <surname>Villal o´n</surname>
            ,
            <given-names>C. L. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dorigo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , and Stu¨ tzle,
          <string-name>
            <surname>T.</surname>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>Why the intelligent water drops cannot be considered as a novel algorithm</article-title>
          .
          <source>In International Conference on Swarm Intelligence</source>
          , pages
          <fpage>302</fpage>
          -
          <lpage>314</lpage>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          <string-name>
            <surname>Villal o´n</surname>
            ,
            <given-names>C. L. C.</given-names>
          </string-name>
          , Stu¨ tzle, T., and
          <string-name>
            <surname>Dorigo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Grey wolf, firefly and bat algorithms: Three widespread algorithms that do not contain any novelty</article-title>
          .
          <source>In International Conference on Swarm Intelligence</source>
          , pages
          <fpage>121</fpage>
          -
          <lpage>133</lpage>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          <string-name>
            <surname>Wawer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>How to stop salami science: promotion of healthy trends in publishing behavior</article-title>
          .
          <source>Accountability in Research</source>
          ,
          <volume>26</volume>
          (
          <issue>1</issue>
          ):
          <fpage>33</fpage>
          -
          <lpage>48</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          <string-name>
            <surname>Weyland</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2010</year>
          ).
          <article-title>A rigorous analysis of the harmony search algorithm: How the research community can be misled by a “novel” methodology</article-title>
          .
          <source>International Journal of Applied Metaheuristic Computing (IJAMC)</source>
          ,
          <volume>1</volume>
          (
          <issue>2</issue>
          ):
          <fpage>50</fpage>
          -
          <lpage>60</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          <string-name>
            <surname>Weyland</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2015</year>
          ).
          <article-title>A critical analysis of the harmony search algorithm-how not to solve sudoku</article-title>
          .
          <source>Operations Research Perspectives</source>
          ,
          <volume>2</volume>
          :
          <fpage>97</fpage>
          -
          <lpage>105</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>