<?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>0188-6266</journal-id>
<journal-title><![CDATA[Acta universitaria]]></journal-title>
<abbrev-journal-title><![CDATA[Acta univ]]></abbrev-journal-title>
<issn>0188-6266</issn>
<publisher>
<publisher-name><![CDATA[Universidad de Guanajuato, Dirección de Investigación y Posgrado]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0188-62662019000100214</article-id>
<article-id pub-id-type="doi">10.15174/au.2019.2335</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Bacterial foraging optimization algorithm with mutation to solve constrained problems]]></article-title>
<article-title xml:lang="es"><![CDATA[Algoritmo basado en el Forrajeo de Bacterias con mutación para resolver problemas con restricciones]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Hernández-Ocaña]]></surname>
<given-names><![CDATA[Betania]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Hernández-Torruco]]></surname>
<given-names><![CDATA[José]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Chávez-Bosquez]]></surname>
<given-names><![CDATA[Oscar]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Canul-Reich]]></surname>
<given-names><![CDATA[Juana]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Montané-Jiménez]]></surname>
<given-names><![CDATA[Luis Gerardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Juárez Autónoma de Tabasco División Académica de Informática y Sistemas ]]></institution>
<addr-line><![CDATA[ Tabasco]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Veracruzana Facultad de Estadística e Informática ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2019</year>
</pub-date>
<volume>29</volume>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S0188-62662019000100214&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S0188-62662019000100214&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S0188-62662019000100214&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract A simple version of a Swarm Intelligence algorithm called bacterial foraging optimization algorithm with mutation and dynamic stepsize (BFOAM-DS) is proposed. The bacterial foraging algorithm has the ability to explore and exploit the search space through its chemotactic operator. However, premature convergence is a disadvantage. This proposal uses a mutation operator in a swim, similar to evolutionary algorithms, combined with a dynamic stepsize operator to improve its performance and allows a better balance between the exploration and exploitation of the search space. BFOAM-DS was tested in three well-known engineering design optimization problems. Results were analyzed with basic statistics and common measures for nature-inspired constrained optimization problems to evaluate the behavior of the swim with a mutation operator and the dynamic stepsize operator. Results were compared against a previous version of the proposed algorithm to conclude that BFOAM-DS is competitive and better than a previous version of the algorithm.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Se propone una versión simplificada de un algoritmo de Inteligencia Colectiva denominado algoritmo de optimización basado en el forrajeo de bacterias con mutación y tamaño de paso dinámico (BFOAM-DS). Este algoritmo tiene la habilidad de explorar y explotar el espacio de búsqueda mediante su operador quimiotáxico. Sin embargo, la convergencia prematura es una desventaja particular. Esta propuesta implementa un operador de mutación en el nado, similar al utilizado por los algoritmos evolutivos, y un tamaño de paso dinámico para mejorar el desempeño del algoritmo. BFOAM-DS se probó en tres problemas de optimización de diseño ingenieril. Los resultados obtenidos fueron analizados con estadísticas básicas y medidas de rendimiento comunes para evaluar el comportamiento del operador de nado con mutación y el operador de tamaño de paso dinámico. Se concluye que BFOAM-DS obtiene soluciones mejores que una versión previa del algoritmo y similares a la mejor solución conocida en la literatura especializada.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Metaheuristic]]></kwd>
<kwd lng="en"><![CDATA[mutation operator]]></kwd>
<kwd lng="en"><![CDATA[dynamic stepsize]]></kwd>
<kwd lng="en"><![CDATA[engineering problem]]></kwd>
<kwd lng="en"><![CDATA[performance measures]]></kwd>
<kwd lng="es"><![CDATA[Metaheurística]]></kwd>
<kwd lng="es"><![CDATA[operador de mutación]]></kwd>
<kwd lng="es"><![CDATA[tamaño de paso dinámico]]></kwd>
<kwd lng="es"><![CDATA[problema de diseño ingenieril]]></kwd>
<kwd lng="es"><![CDATA[medidas de desempeño]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arora]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Optimum Design]]></source>
<year>2012</year>
<publisher-loc><![CDATA[New York, NY ]]></publisher-loc>
<publisher-name><![CDATA[McGraw-Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Biswas]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Dasgupta]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Das]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Abraham]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Synergy of Differential Evolution and Bacterial Foraging Optimization for global optimization]]></article-title>
<source><![CDATA[Neural Network World]]></source>
<year>2007</year>
<volume>17</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>607-26</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Calva-Yáñez]]></surname>
<given-names><![CDATA[M. B.]]></given-names>
</name>
<name>
<surname><![CDATA[Niño-Suárez]]></surname>
<given-names><![CDATA[P. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Villarreal-Cervantes]]></surname>
<given-names><![CDATA[M. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Sepúlveda-Cervantes]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Portilla-Flores]]></surname>
<given-names><![CDATA[E. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Differential evolution for the control gain&#8217;s optimal tuning of a four-bar mechanism]]></article-title>
<source><![CDATA[Polibits]]></source>
<year>2013</year>
<volume>47</volume>
<page-range>67-73</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coello-Coello]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art]]></article-title>
<source><![CDATA[Computer Methods in Applied Mechanics and Engineering]]></source>
<year>2002</year>
<volume>191</volume>
<numero>11-12</numero>
<issue>11-12</issue>
<page-range>1245-87</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An Efficient Constraint Handling Method for Genetic Algorithms]]></article-title>
<source><![CDATA[Computer Methods in Applied Mechanics and Engineering]]></source>
<year>2000</year>
<volume>186</volume>
<numero>2-4</numero>
<issue>2-4</issue>
<page-range>311-38</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dorigo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Maniezzo]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Colorni]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Ant System: Optimization by a Colony of Cooperating Agents]]></article-title>
<source><![CDATA[IEEE Transactions of Systems, Man and Cybernetics, Part B]]></source>
<year>1996</year>
<volume>26</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>29-41</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eiben]]></surname>
<given-names><![CDATA[A. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[J. E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Evolutionary Computing]]></source>
<year>2003</year>
<publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eberhart]]></surname>
<given-names><![CDATA[R.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Shi]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Kennedy]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Swarm Intelligence]]></source>
<year>2001</year>
<publisher-loc><![CDATA[San Francisco, CA ]]></publisher-loc>
<publisher-name><![CDATA[Morgan Kaufmann]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Engelbrecht]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational Intelligence. An Introduction]]></source>
<year>2007</year>
<publisher-loc><![CDATA[New York, NY ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fogel]]></surname>
<given-names><![CDATA[L. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Intelligence Through Simulated Evolution. Forty years of Evolutionary Programming]]></source>
<year>1999</year>
<publisher-loc><![CDATA[New York, NY ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hernández-Ocaña]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Pozos-Parra]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[A review of the bacterial foraging algorithm in constrained numerical optimization]]></source>
<year>2013</year>
<conf-name><![CDATA[ Congress on Evolutionary Computation (CEC&#8217;2013)]]></conf-name>
<conf-loc>Cancún, México </conf-loc>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hernández-Ocaña]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Pozos-Parra]]></surname>
<given-names><![CDATA[M. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Stepsize control on the modified bacterial foraging algorithm for constrained numerical optimization]]></source>
<year>2014</year>
<conf-name><![CDATA[ Conference on Genetic and Evolutionary Computation (GECCO &#8217;14)]]></conf-name>
<conf-loc>Vancouver, DB, Canada </conf-loc>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hernández-Ocaña]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Pozos-Parra]]></surname>
<given-names><![CDATA[M. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Portilla-Flores]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Vega-Alvarado]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Calva-Yáñez]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Two swim operators in the modified bacterial foraging algorithm for the optimal synthesis of four-bar mechanisms]]></article-title>
<source><![CDATA[Computational Intelligence and Neuroscience]]></source>
<year>2016</year>
<volume>2016</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-18</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hernández-Ocaña]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Chávez-Bosquez]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández-Torruco]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Canul-Reich]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Pozos-Parra]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bacterial foraging optimization algorithm for menu planning]]></article-title>
<source><![CDATA[IEEE Access]]></source>
<year>2018</year>
<volume>6</volume>
<page-range>8619-29</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[H. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Abraham]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimized watermarking using swarm-based bacterial foraging]]></article-title>
<source><![CDATA[Information Hiding and Multimedia Signal Processing]]></source>
<year>2010</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>51-8</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[D. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Abraham]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cho]]></surname>
<given-names><![CDATA[J. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid genetic algorithm and bacterial foraging approach for global optimization]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2007</year>
<volume>177</volume>
<numero>18</numero>
<issue>18</issue>
<page-range>3918-37</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koza]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Keane]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Streeter]]></surname>
<given-names><![CDATA[M. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Mydlowec]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lanza]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic Programming IV: Routine Human-Competitive Machine Intelligence]]></source>
<year>2003</year>
<publisher-loc><![CDATA[Verlag US ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kushwaha]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Bisht]]></surname>
<given-names><![CDATA[V. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Shah]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic algorithm based bacterial foraging approach for optimization]]></source>
<year>2012</year>
<conf-name><![CDATA[ National Conference on Future Aspects of Artificial intelligence in Industrial Automation (NCFAAIIA 12)]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liang]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Runarsson]]></surname>
<given-names><![CDATA[T. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Clerc]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Suganthan]]></surname>
<given-names><![CDATA[P. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello-Coello]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization]]></source>
<year>2006</year>
<publisher-loc><![CDATA[Singapore ]]></publisher-loc>
<publisher-name><![CDATA[Nanyang Technological University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[López-Ibáñez]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Dubois-Lacoste]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Pérez Cáceres]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Birattari]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Stützle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The iRace package, Iterated Race for Automatic Algorithm Configuration]]></article-title>
<source><![CDATA[Operations Research Perspectives]]></source>
<year>2011</year>
<volume>3</volume>
<page-range>43-5</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Luo]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimization for PID control parameters on hydraulic servo control system based on the novel compound evolutionary algorithm]]></source>
<year>2010</year>
<conf-name><![CDATA[ SecondInternational Conference on Computer Modeling and Simulation]]></conf-name>
<conf-loc>Sanya, Hainan, China </conf-loc>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Constraint-Handling in Evolutionary Optimization]]></source>
<year>2009</year>
<publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello-Coello]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Constraint-handling in nature-inspired numerical optimization: Past, present and future]]></article-title>
<source><![CDATA[Swarm and Evolutionary Computation]]></source>
<year>2011</year>
<volume>1</volume>
<page-range>173-94</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández-Ocaña]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modified bacterial foraging optimization for engineering design]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Cihan]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Dagli]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Bryden]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Corns]]></surname>
<given-names><![CDATA[S. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Gen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Tumer]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Suer]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Intelligent Engineering Systems through Artificial Neural Networks]]></source>
<year>2009</year>
<page-range>357-64</page-range><publisher-loc><![CDATA[USA ]]></publisher-loc>
<publisher-name><![CDATA[ASME Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[López-Davila]]></surname>
<given-names><![CDATA[E. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Adaptation and local search in the modified bacterial foraging algorithm for constrained optimization]]></source>
<year>2012</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation (CEC&#8216;12)]]></conf-name>
<conf-loc>Brisbane, QLD, Australia </conf-loc>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Fogel]]></surname>
<given-names><![CDATA[D. B.]]></given-names>
</name>
</person-group>
<source><![CDATA[How to Solve It: Modern Heuristics]]></source>
<year>2004</year>
<publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Niu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Fan]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Xiao]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Xue]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bacterial foraging based approaches to portfolio optimization with liquidity risk]]></article-title>
<source><![CDATA[Neurocomputing]]></source>
<year>2012</year>
<volume>98</volume>
<page-range>90-100</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nouri]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Hong]]></surname>
<given-names><![CDATA[T. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A bacterial foraging algorithm based cell information considering operation time]]></article-title>
<source><![CDATA[Journal of Manufacturing Systems]]></source>
<year>2012</year>
<volume>31</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>326-36</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pandit]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Tripathi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Tapaswi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Pandit]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved bacterial foraging algorithm for combined static/dynamic environmental economic dispatch]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2012</year>
<volume>12</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>3500-13</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Passino]]></surname>
<given-names><![CDATA[K. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Biomimicry of bacterial foraging for distributed optimization and control]]></article-title>
<source><![CDATA[IEEE Control Systems Magazine]]></source>
<year>2002</year>
<volume>22</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>52-67</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Praveena]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Vaisakh]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Mohana Rao]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[A bacterial foraging and PSO-DE algorithm for solving dynamic economic dispatch problem with valve-point effects]]></source>
<year>2010</year>
<conf-name><![CDATA[ FirstInternational Conference on Integrated Intelligent Computing]]></conf-name>
<conf-loc>Bangalore, India </conf-loc>
</nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Price]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Storn]]></surname>
<given-names><![CDATA[R. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lampinen]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Differential Evolution: A Practical Approach to Global Optimization]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Saber]]></surname>
<given-names><![CDATA[A. Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Economic dispatch using particle swarm optimization with bacterial foraging effect]]></article-title>
<source><![CDATA[International Journal of Electrical Power &amp; Energy Systems]]></source>
<year>2012</year>
<volume>34</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>38-46</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sandgren]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Nonlinear integer and discrete programming in mechanical design optimization]]></article-title>
<source><![CDATA[Journal of Mechanical Design]]></source>
<year>1990</year>
<volume>112</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>223-9</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schwefel]]></surname>
<given-names><![CDATA[H. P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Evolution and Optimization Seeking: The Sixth Generation]]></source>
<year>1993</year>
<publisher-loc><![CDATA[New York, NY ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
