<?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>1870-9044</journal-id>
<journal-title><![CDATA[Polibits]]></journal-title>
<abbrev-journal-title><![CDATA[Polibits]]></abbrev-journal-title>
<issn>1870-9044</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1870-90442016000100083</article-id>
<article-id pub-id-type="doi">10.17562/PB-53-9</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Memetic Algorithm Applied to the Optimal Design of a Planar Mechanism for Trajectory Tracking]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Vega-Alvarado]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Portilla-Flores]]></surname>
<given-names><![CDATA[Edgar Alfredo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[Efrén]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Flores-Pulido]]></surname>
<given-names><![CDATA[Leticia]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Calva-Yañéz]]></surname>
<given-names><![CDATA[Maria Bárbara]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma de Tlaxcala Facultad de Ciencias Básicas, Ingeniería y Tecnología ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad Autónoma de Tlaxcala Facultad de Ciencias Básicas, Ingeniería y Tecnología ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Innovación y Desarrollo Tecnológico en Cómputo ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Veracruzana Centro de Investigación en Inteligencia Artificial ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<numero>53</numero>
<fpage>83</fpage>
<lpage>90</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1870-90442016000100083&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1870-90442016000100083&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1870-90442016000100083&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Memetic algorithms (MA), explored in recent literature, are hybrid metaheuristics formed by the synergistic combination of a population-based global search technique with one or more local search algorithms, which in turn can be exact or stochastic methods. Different versions of MAs have been developed, and although their use was focused originally on combinatorial optimization, nowadays there are memetic developments to solve a wide selection of numerical type problems: with or without constraints, mono or multi objective, static or dynamic, among others. This paper presents the design and application of a novel memetic algorithm, MemMABC, tested in a case study for optimizing the synthesis of a four-bar mechanism that follows a specific linear trajectory. The proposed method is based on the MABC algorithm as a global searcher, with the addition of a modified Random Walk as a local searcher. MABC is a modified version of the Artificial Bee Colony algorithm, adapted to handle design constraints by implementing the feasibility rules of Deb. Four-bar mechanisms are a good example of hard optimization problems, since they are used in a wide variety of industrial applications; simulation results show a high-precision control of the proposed trajectory for the designed mechanism, thus demonstrating that MemMABC can be applied successfully as a tool for solving real-world optimization cases.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Four-bar mechanism]]></kwd>
<kwd lng="en"><![CDATA[hard optimization]]></kwd>
<kwd lng="en"><![CDATA[memetic algorithm]]></kwd>
<kwd lng="en"><![CDATA[random walk]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A survey on optimization metaheuristics]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boussaid]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Lepagnot]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Siarry]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Information Sciences]]></source>
<year>2013</year>
<volume>237</volume>
<page-range>82-117</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[Harmony Search as a Metaheuristic Algorithm]]></source>
<year>2009</year>
<volume>191</volume>
<page-range>1-14</page-range><publisher-name><![CDATA[Springer Berlin]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Domínguez Isidro]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Leguizamon]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Memetic differential evolution for constrained numerical optimization problems]]></source>
<year>2013</year>
<conf-name><![CDATA[ 2013 IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>2996-3003</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Krasnogor]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Aragon]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pacheco]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Memetic Algorithms]]></source>
<year>2012</year>
<volume>2</volume>
<page-range>905-36</page-range><publisher-name><![CDATA[Springer Berlin]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A case study of memetic algorithms for constraint optimization]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ozcan]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Basaran]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing]]></source>
<year>2009</year>
<volume>13</volume>
<page-range>871-82</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A novel memetic algorithm based on invasive weed optimization and differential evolution for constrained optimization]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Fan]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing]]></source>
<year>2013</year>
<volume>17</volume>
<page-range>1893-910</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiao]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Memetic algorithm with double mutation for numerical optimization]]></source>
<year>2012</year>
<conf-name><![CDATA[ IScIDE 2011]]></conf-name>
<conf-loc> </conf-loc>
<page-range>66-73</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A comparison between memetic algorithm and genetic algorithm for the cryptoanalysis of simplified data encryption standard algorithm]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garg]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[International Journal of Network Security &amp; Its Applications (IJNSA)]]></source>
<year>2009</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>33-42</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Gruver]]></surname>
<given-names><![CDATA[W. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Dimensional synthesis of a flexible gripper with a high degree of stability]]></source>
<year>1996</year>
<volume>2</volume>
<conf-name><![CDATA[ IEEE International Conference on Systems, Man, and Cybernetics]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1025-30</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Memetic algorithms for the traveling salesman problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Merz]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Freisleben]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Complex Systems]]></source>
<year>2001</year>
<numero>13</numero>
<issue>13</issue>
<page-range>297-345</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="">
<article-title xml:lang=""><![CDATA[A novel memetic algorithm and its application to data clustering]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ni]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Qiao]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
</person-group>
<source><![CDATA[Memetic Computation]]></source>
<year>2013</year>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shigley]]></surname>
<given-names><![CDATA[J. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Uicker]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Teoria de Maquinas y Mecanismos]]></source>
<year>1988</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[McGraw Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Norton]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Disefio de Maquinaria, una Introduccicm a la Sintesis y Analisis de Mecanismos y Maquinas]]></source>
<year>1995</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[McGraw Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Una introducción a los algoritmos memeticos]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moscato]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Cotta]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Revista Iberoamericana de Inteligencia Artificial]]></source>
<year>2003</year>
<volume>19</volume>
<page-range>131-48</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moscato]]></surname>
<given-names><![CDATA[P. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms]]></source>
<year>1989</year>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<article-title xml:lang=""><![CDATA[A Primer on Memetic Algorithms]]></article-title>
<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>
<source><![CDATA[Handbook of Memetic Algorithms]]></source>
<year>2012</year>
<publisher-name><![CDATA[Springer Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Memetic computation: Past, present and future]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ong]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Computational Inteligence Magazine]]></source>
<year>2010</year>
<volume>5</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A multi-facet survey on memetic computation]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Ong]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Tan]]></surname>
<given-names><![CDATA[K. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2011</year>
<volume>15</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>591-607</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A tutorial for competent memetic algorithms: Model, taxonomy, and design issues]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Krasnogor]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2005</year>
<volume>9</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>474-88</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Montes de Oca]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cotta]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Neri]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Local Search]]></source>
<year>2012</year>
<volume>379</volume>
<page-range>29-42</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ong]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing]]></source>
<year>2007</year>
<volume>11</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>873-88</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rakshit]]></surname>
<given-names><![CDATA[S. D. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Konar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Nagar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[ABC-TDQL: An adaptive memetic algorithm]]></source>
<year>2013</year>
<conf-name><![CDATA[ 2013 IEEE Workshop on Hybrid Intelligent Models and Applications]]></conf-name>
<conf-loc> </conf-loc>
<page-range>35-42</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rakshit]]></surname>
<given-names><![CDATA[S. D. P.]]></given-names>
</name>
</person-group>
<source><![CDATA[A bee foraging-based memetic harmony search method]]></source>
<year>2012</year>
<conf-name><![CDATA[ 2012 IEEE International Conference on Systems, Man and Cybernetics]]></conf-name>
<conf-loc> </conf-loc>
<page-range>184-9</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Memetic firefly algorithm for combinatorial optimization]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fister]]></surname>
<given-names><![CDATA[I. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Fister]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Brest]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Research Gate]]></source>
<year>2012</year>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="book">
<source><![CDATA[A Gentle Introduction to Memetic Algorithms]]></source>
<year>2003</year>
<page-range>105-44</page-range><publisher-name><![CDATA[Kluwer Academic Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Classification of adaptive memetic algorithms: A comparative study]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ong]]></surname>
<given-names><![CDATA[N. Z. Y. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[M.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Wong]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Transactions on Systems, Man and Cybernetics]]></source>
<year>2006</year>
<volume>36</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>141-52</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[An idea based on honey bee swarm for numerical optimization]]></source>
<year>2005</year>
<publisher-name><![CDATA[Erciyes University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Empirical analysis of a modified artificial bee colony for constrained numerical optimization]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mezura Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Cetina Dommguez]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<source><![CDATA[Applied Mathematics and Computation]]></source>
<year>2012</year>
<volume>218</volume>
<page-range>10 943-73</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An efficient constraint handling method for genetic algorithms]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computer Methods in Applied Mechanics and Engineering]]></source>
<year>2000</year>
<volume>186</volume>
<page-range>311-38</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mernik]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Crepinsek]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Information Sciences]]></source>
<year>2015</year>
<volume>291</volume>
<page-range>115-27</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rao]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Engineering Optimization: Theory and Practice]]></source>
<year>2009</year>
<edition>4th</edition>
<publisher-name><![CDATA[John Wiley and Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Perez]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Analisis de Mecanismos y Problemas Resueltos]]></source>
<year>2006</year>
<publisher-name><![CDATA[Alfaomega Grupo Editor S.A. de C.V.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Sintesis optima de un mecanismo plano para seguimiento de trayectoria utilizando evolution diferencial]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vega-Alvarado]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Santiago-Valentín]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez-Márquez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Sola-no-Palma]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Portilla-Flores]]></surname>
<given-names><![CDATA[E. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Flores-Pulido]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Research in Computing Science]]></source>
<year>2014</year>
<volume>72</volume>
<page-range>85-9</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Runarsson]]></surname>
<given-names><![CDATA[T.]]></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.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C.]]></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]]></source>
<year>2006</year>
<publisher-name><![CDATA[Nanyang Technological University]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
