<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0121-1129</journal-id>
<journal-title><![CDATA[Revista Facultad de Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Fac. ing.]]></abbrev-journal-title>
<issn>0121-1129</issn>
<publisher>
<publisher-name><![CDATA[Universidad Pedagógica y Tecnológica de Colombia]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0121-11292024000300003</article-id>
<article-id pub-id-type="doi">10.19053/01211129.v33.n69.2024.17895</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[COMPARATIVE STUDY OF CUCKOO-INSPIRED ALGORITHMS TO SOLVE LARGE-SCALE CONTINUOUS OPTIMIZATION PROBLEMS]]></article-title>
<article-title xml:lang="es"><![CDATA[Estudio comparativo de algoritmos inspirados en el cuco para problemas de optimización continua a gran escala]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cobos-Lozada]]></surname>
<given-names><![CDATA[Carlos-Alberto]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Muñoz-Collazos]]></surname>
<given-names><![CDATA[Henry]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Urbano-Muñoz]]></surname>
<given-names><![CDATA[Richar]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad del Cauca  ]]></institution>
<addr-line><![CDATA[Popayán Cauca]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Credit One Bank  ]]></institution>
<addr-line><![CDATA[Las Vegas Nevada]]></addr-line>
<country>Estados, Unidos</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad del Cauca  ]]></institution>
<addr-line><![CDATA[Popayán Cauca]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2024</year>
</pub-date>
<volume>33</volume>
<numero>69</numero>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-11292024000300003&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0121-11292024000300003&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0121-11292024000300003&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT Two distinctive behaviors of the cuckoo bird have inspired several metaheuristic algorithms to solve continuous optimization problems. In addition to the well-known parasitic breeding behavior that gave rise to several cuckoo search (CS) algorithms, another behavior related to their clustering and the way they locate food sources has given rise to the COA algorithm. As a result, there are several variants to solve continuous optimization problems; however, it is necessary to define which one is the most suitable under specific requirements. This paper compares six of these algorithms, including CS+LEM (proposed in this paper), which consists of a hybridization of the CS algorithm with learning evolutionary models (IBM) using an approach known as "metaheuristics enhanced by artificial intelligence". Three assessments were performed using a set of 61 continuous test functions: 1) the optimal value achieved with a fixed execution time; 2) the number of objective function evaluations required to reach the global optimum; and 3) the optimal value achieved with a fixed number of objective function evaluations. CS+LEM presents the best results in evaluation 1, while COA presents the best results in evaluations 2 and 3. The results were analyzed using the Friedman and Wilcoxon nonparametric statistical tests.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN Dos comportamientos distintivos del pájaro cuco han inspirado varios algoritmos metaheurísticos para resolver problemas de optimización continua. Además del conocido comportamiento de reproducción parasitaria que dio origen a diversos algoritmos de búsqueda cuco (CS por sus siglas en inglés), otro comportamiento relacionado con sus agrupaciones y la forma en que localizan las fuentes de alimento ha dado lugar al algoritmo COA. Como resultado, existen diferentes variantes para resolver problemas de optimización continua; sin embargo, es necesario definir cuál es el más adecuado para resolver un problema bajo requerimientos específicos. En este trabajo se realiza una comparación entre seis de estos algoritmos incluido CS+LEM (propuesto en este artículo), una hibridación del algoritmo CS con modelos evolutivos que aprenden (LEM por sus siglas en inglés) usando un enfoque conocido como "metaheurística mejorada por inteligencia artificial". Se realizaron tres evaluaciones utilizando un conjunto de 61 funciones de prueba continuas: 1) el valor óptimo alcanzado con un tiempo fijo de ejecución; 2) el número de evaluaciones de la función objetivo necesarias para alcanzar el óptimo global; 3) el valor óptimo alcanzado con un número fijo de evaluaciones de la función objetivo. CS+LEM presenta los mejores resultados en la evaluación 1, mientras que COA presenta los mejores resultados en las evaluaciones 2 y 3. Los resultados se analizaron mediante las pruebas estadísticas no paramétricas de Friedman y Wilcoxon.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[artificial intelligence]]></kwd>
<kwd lng="en"><![CDATA[Cuckoo search algorithm]]></kwd>
<kwd lng="en"><![CDATA[large-scale continuous problems]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[optimization]]></kwd>
<kwd lng="es"><![CDATA[algoritmo de búsqueda del cuco]]></kwd>
<kwd lng="es"><![CDATA[inteligencia artificial]]></kwd>
<kwd lng="es"><![CDATA[metaheurísticas]]></kwd>
<kwd lng="es"><![CDATA[optimización]]></kwd>
<kwd lng="es"><![CDATA[problemas continuos a gran escala]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Velasco]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Guerrero]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Hospitaler]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Literature Review and Critical Analysis of Metaheuristics Recently Developed]]></article-title>
<source><![CDATA[Arch. Comput. Methods Eng]]></source>
<year>2023</year>
<volume>31</volume>
</nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abo-Alsabeh]]></surname>
<given-names><![CDATA[R. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Salhi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Genetic Algorithm: A study survey]]></article-title>
<source><![CDATA[Iraqi J. Sci]]></source>
<year>2022</year>
<volume>63</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1215-31</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Neri]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Cotta]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Memetic algorithms and memetic computing optimization: A literature review]]></article-title>
<source><![CDATA[Swarm Evol. Comput]]></source>
<year>2012</year>
<volume>2</volume>
<page-range>1-14</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prajapati]]></surname>
<given-names><![CDATA[V. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Chouhan]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Tabu Search Algorithm (TSA): A Comprehensive Survey]]></source>
<year>2020</year>
<conf-name><![CDATA[ 3rdInternational Conference on Emerging Technologies in Computer Engineering: Machine Learning and Internet of Things]]></conf-name>
<conf-date>2020</conf-date>
<conf-loc> </conf-loc>
<page-range>222-9</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nayar]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Gautam]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Mehta]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ant Colony Optimization: A Review of Literature and Application in Feature Selection]]></article-title>
<source><![CDATA[Lecture Notes in Networks and Systems]]></source>
<year>2021</year>
<page-range>285-97</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gad]]></surname>
<given-names><![CDATA[A. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review]]></article-title>
<source><![CDATA[Arch. Comput. Methods Eng]]></source>
<year>2022</year>
<volume>29</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>2531-61</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sharma]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Sharma]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Comprehensive Survey on Grey Wolf Optimization]]></article-title>
<source><![CDATA[Recent Adv. Comput. Sci. Commun]]></source>
<year>2022</year>
<volume>15</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>323-33</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wei]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Zeng]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey on firefly algorithms]]></article-title>
<source><![CDATA[Neurocomputing]]></source>
<year>2022</year>
<volume>500</volume>
<page-range>662-78</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>[9]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Akay]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A comparative study of Artificial Bee Colony algorithm]]></article-title>
<source><![CDATA[Appl. Math. Comput]]></source>
<year>2009</year>
<volume>214</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>108-32</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>[10]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ahmad]]></surname>
<given-names><![CDATA[M. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Isa]]></surname>
<given-names><![CDATA[N. A. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[W. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Ang]]></surname>
<given-names><![CDATA[K. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Differential evolution: A recent review based on state-of-the-art works]]></article-title>
<source><![CDATA[Alexandria Eng. J.]]></source>
<year>2022</year>
<volume>61</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>3831-72</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Qin]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zain]]></surname>
<given-names><![CDATA[A. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[K.-Q.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Harmony search algorithm and related variants: A systematic review]]></article-title>
<source><![CDATA[Swarm Evol. Comput]]></source>
<year>2022</year>
<volume>74</volume>
</nlm-citation>
</ref>
<ref id="B12">
<label>[12]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruano-Daza]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Cobos]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Torres-Jimenez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Mendoza]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Paz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multiobjective bilevel approach based on global-best harmony search for defining optimal routes and frequencies for bus rapid transit systems]]></article-title>
<source><![CDATA[Appl. Soft Comput. J.]]></source>
<year>2018</year>
<volume>67</volume>
<page-range>567-83</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Salhi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Thompson]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An overview of heuristics and metaheuristics]]></article-title>
<source><![CDATA[The Palgrave Handbook of Operations Research]]></source>
<year>2022</year>
<page-range>353-403</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[X.-S.]]></given-names>
</name>
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Cuckoo Search via Lévy flights]]></source>
<year>2009</year>
<conf-name><![CDATA[ World Congress on Nature &amp; Biologically Inspired Computing]]></conf-name>
<conf-date>2009</conf-date>
<conf-loc> </conf-loc>
<page-range>210-4</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>[15]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Safdar]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Abdul Rani]]></surname>
<given-names><![CDATA[K. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Rahim]]></surname>
<given-names><![CDATA[H. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rosli]]></surname>
<given-names><![CDATA[S. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Jamlos]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Review on Research Trends in using Cuckoo Search Algorithm: Applications and Open Research Challenges]]></article-title>
<source><![CDATA[Prz. Elektrotechniczny]]></source>
<year>2023</year>
<volume>1</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>18-24</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Valian]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Mohanna]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Tavakoli]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Improved Cuckoo Search Algorithm for Feed forward Neural Network Training]]></article-title>
<source><![CDATA[Int. J. Artif. Intell. Appl]]></source>
<year>2011</year>
<volume>2</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>36-43</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>[17]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Walton]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Hassan]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Morgan]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Brown]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modified cuckoo search: A new gradient free optimisation algorithm]]></article-title>
<source><![CDATA[Chaos, Solitons and Fractals]]></source>
<year>2011</year>
<volume>44</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>710-8</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>[18]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tuba]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Subotic]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Stanarevic]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Modified Cuckoo Search Algorithm for Unconstrained Optimization Problems]]></source>
<year>2011</year>
<conf-name><![CDATA[ 5thEur. Conf. Eur. Comput. Conf]]></conf-name>
<conf-loc> </conf-loc>
<page-range>263-8</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>[19]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rajabioun]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Cuckoo Optimization Algorithm]]></article-title>
<source><![CDATA[Appl. Soft Comput]]></source>
<year>2011</year>
<volume>11</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>5508-18</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[An]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Lei]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[G.-G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Survey of Lévy Flight-Based Metaheuristics for Optimization]]></article-title>
<source><![CDATA[Mathematics]]></source>
<year>2022</year>
<volume>10</volume>
<numero>15</numero>
<issue>15</issue>
</nlm-citation>
</ref>
<ref id="B21">
<label>[21]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalski]]></surname>
<given-names><![CDATA[R. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Learnable evolution model: evolutionary processes guided by machine learning]]></article-title>
<source><![CDATA[Mach. Learn]]></source>
<year>2000</year>
<volume>38</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>9-40</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[da Costa Oliveira]]></surname>
<given-names><![CDATA[A. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Britto]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Gusmão]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Machine learning enhancing metaheuristics: a systematic review]]></article-title>
<source><![CDATA[Soft Comput]]></source>
<year>2023</year>
</nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cobos]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Estupiñán]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Pérez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[GHS + LEM: Global-best Harmony Search using learnable evolution models]]></article-title>
<source><![CDATA[Appl. Math. Comput]]></source>
<year>2011</year>
<volume>218</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>2558-78</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>[24]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Suganthan]]></surname>
<given-names><![CDATA[P. N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Singapore ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B25">
<label>[25]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Benchmark functions for the CEC'2008 special session and competition on large scale global optimization]]></source>
<year>2008</year>
<conf-name><![CDATA[ World Congress on Computational Intelligence]]></conf-name>
<conf-loc>Rio de Janeiro </conf-loc>
<page-range>1-18</page-range><publisher-loc><![CDATA[Brazil ]]></publisher-loc>
<publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<label>[26]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ke]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Xiaodong]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[N.]]></surname>
<given-names><![CDATA[S. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhenyu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Thomas]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Benchmark Functions for the CEC'2010 Special Session and Competition on Large-Scale Global Optimization]]></source>
<year>2010</year>
<publisher-loc><![CDATA[Shanghai, China ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Molga]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Smutnicki]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Test functions for optimization needs]]></article-title>
<source><![CDATA[Test functions for optimization needs]]></source>
<year>2005</year>
<page-range>1-43</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wolpert]]></surname>
<given-names><![CDATA[D. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Macready]]></surname>
<given-names><![CDATA[W. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[No free lunch theorems for optimization]]></article-title>
<source><![CDATA[IEEE Trans. Evol. Comput]]></source>
<year>1997</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>67-82</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
