<?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>1409-2433</journal-id>
<journal-title><![CDATA[Revista de Matemática Teoría y Aplicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Mat]]></abbrev-journal-title>
<issn>1409-2433</issn>
<publisher>
<publisher-name><![CDATA[Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1409-24332013000100004</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Estimación de parámetros de regresión no lineal mediante colonia de abejas artificiales]]></article-title>
<article-title xml:lang="en"><![CDATA[Parameter estimation in nonlinear regression using artificial bee colony]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[de-los-Cobos-Silva]]></surname>
<given-names><![CDATA[Sergio G.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gutiérrez-Andrade]]></surname>
<given-names><![CDATA[Miguel A.]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[Eric A.]]></given-names>
</name>
<xref ref-type="aff" rid="A03"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
<xref ref-type="aff" rid="A04"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Aguilar-Cornejo]]></surname>
<given-names><![CDATA[Manuel]]></given-names>
</name>
<xref ref-type="aff" rid="A05"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa Departamento de Ingeniería Eléctrica ]]></institution>
<addr-line><![CDATA[ México D.F.]]></addr-line>
<country>México</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Misma dirección  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<aff id="A03">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Azcapotzalco Departamento de Sistemas ]]></institution>
<addr-line><![CDATA[ México D.F.]]></addr-line>
<country>México</country>
</aff>
<aff id="A04">
<institution><![CDATA[,Misma dirección  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<aff id="A05">
<institution><![CDATA[,Misma dirección  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>01</month>
<year>2013</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>01</month>
<year>2013</year>
</pub-date>
<volume>20</volume>
<numero>1</numero>
<fpage>49</fpage>
<lpage>60</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332013000100004&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1409-24332013000100004&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1409-24332013000100004&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Este traba jo presenta los resultados de la técnica heurística de ABC (Artificial Bee Colony) utilizada para estimar los parámetros de modelos de regresión no lineal. El algoritmo fue probado sobre 27 bases de datos de la colección NIST (2001), de las cuales 8 se consideran con un alto grado de dificultad. Se presentan los resultados experimentales.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[This article shows the results of ABC heuristic techniques (Artificial Bee Colony) that were used to estimate parameters for nonlinear regression models. The algorithm was tested on 27 data bases from the NIST collection (2001), 8 of these are considered to be high difficulty. Experimental results are presented.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[ABC]]></kwd>
<kwd lng="es"><![CDATA[PSO]]></kwd>
<kwd lng="es"><![CDATA[Regresión No Lineal]]></kwd>
<kwd lng="en"><![CDATA[ABC]]></kwd>
<kwd lng="en"><![CDATA[PSO]]></kwd>
<kwd lng="en"><![CDATA[Nonlinear Regression]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <div style="text-align: justify;">     <div style="text-align: center;"><font  style="font-family: verdana; font-weight: bold;" size="4">Estimaci&oacute;n&nbsp; de par&aacute;metros&nbsp; de regresi&oacute;n no lineal&nbsp; mediante&nbsp; colonia&nbsp; de abejas artificiales</font><br  style="font-weight: bold;"> <br style="font-weight: bold;"> <font style="font-family: verdana; font-weight: bold;" size="4">Parameter&nbsp; estimation&nbsp; in nonlinear regression&nbsp; using artificial&nbsp; bee&nbsp; colony</font>    <br> </div>     <br>     <div style="text-align: center;"><font style="font-family: verdana;"  size="-1">Sergio G. de-los-Cobos-Silva<sup><a href="#Afiliacion1">*</a><a name="Afiliacion6"></a>+</sup> ,Miguel A. Guti&eacute;rrez-Andrade<sup><a href="#Afiliacion2">+</a><a  name="Afiliacion7"></a>*</sup>, Eric A. Rinc&oacute;n-Garc&iacute;a<sup><a href="#Afiliacion3">&#8225;</a><a  name="Afiliacion8"></a>+</sup>, Pedro Lara-Vel&aacute;zquez<sup><a href="#Afiliacion4">&sect;</a><a  name="Afiliacion9"></a>*</sup>, Manuel Aguilar-Cornejo<sup><a href="#Afiliacion5">&para;</a><a  name="Afiiliacion10"></a>*</sup></font>    <br> </div>     <br> <font style="font-family: verdana;" size="-1"><a name="Correspondencia2"></a>*<a  href="#Correspondencia1">Direcci&oacute;n para correspondencia</a></font><a href="#Correspondencia1"> </a>    <br> <hr  style="width: 100%; height: 2px; margin-left: 0px; margin-right: 0px;"><font  style="font-family: verdana; font-weight: bold;" size="3">Resumen</font>    <br>     <br> <font style="font-family: verdana;" size="-1">Este&nbsp; traba jo presenta&nbsp; los resultados&nbsp; de la t&eacute;cnica&nbsp; heur&iacute;stica&nbsp; de ABC&nbsp; (Artificial&nbsp; Bee Colony)&nbsp; utilizada&nbsp; para&nbsp; estimar&nbsp; los par&aacute;metros de modelos de regresi&oacute;n no lineal.&nbsp; El algoritmo fue probado&nbsp; sobre 27 bases de datos de la colecci&oacute;n NIST&nbsp; (2001),&nbsp; de las cuales 8 se consideran&nbsp; con un alto grado de dificultad.&nbsp; Se presentan los resultados experimentales.</font>    ]]></body>
<body><![CDATA[<br> <br style="font-weight: bold;"> <font style="font-family: verdana;" size="-1"><span  style="font-weight: bold;">Palabras&nbsp; clave:</span> ABC, PSO,&nbsp; Regresi&oacute;n No Lineal.</font>    <br>     <br> <font style="font-family: verdana; font-weight: bold;" size="3">Abstract</font>    <br>     <br> <font style="font-family: verdana;" size="-1">This article shows the results of ABC heuristic techniques (Artificial Bee Colony) that were used to estimate parameters for nonlinear regression models.&nbsp; The&nbsp; algorithm was tested on 27 data bases from the NIST&nbsp; collection (2001), 8 of these are considered&nbsp; to be high difficulty.&nbsp; Experimental results are presented.</font>    <br> <br style="font-weight: bold;"> <font style="font-family: verdana;" size="-1"><span  style="font-weight: bold;">Keywords:</span> ABC, PSO, Nonlinear&nbsp; Regression.</font>    <br> <font style="font-family: verdana;" size="-1"><br  style="font-weight: bold;"> <span style="font-weight: bold;">Mathematics Subject Classification: </span>90C59, 62J02</font>.    <br> <hr style="width: 100%; height: 2px;"><font  style="font-family: verdana;" size="-1">    <br> Ver contenido disponible en pdf    <br>     ]]></body>
<body><![CDATA[<br> </font> <hr  style="width: 100%; height: 2px; margin-left: 0px; margin-right: 0px;"><font  style="font-family: verdana; font-weight: bold;" size="3">Referencias</font>    <br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[1]&nbsp; Abbass, H.A. (2001) &#8220;Marriage&nbsp; in honey-bee optimization (MBO):&nbsp; a haplometrosis polygynous&nbsp; swarming&nbsp; approach&#8221;, en:&nbsp; <span style="font-style: italic;">Proceedings&nbsp; The Congress&nbsp; on&nbsp; Evolutionary&nbsp;&nbsp; Computation</span>&nbsp; (CEC2001),&nbsp;&nbsp; Seoul,&nbsp; Korea: 207&#8211;214.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948644&pid=S1409-2433201300010000400001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[2]&nbsp; Afshar,&nbsp; A.;&nbsp; Bozog&nbsp; Haddad,&nbsp; O;&nbsp; Marino,&nbsp; M.A.;&nbsp; Adams,&nbsp; B.J. (2007) &#8220;Honey-bee&nbsp;&nbsp; mating&nbsp;&nbsp; optimization&nbsp;&nbsp; (HBMO)&nbsp;&nbsp; algorithm&nbsp;&nbsp; for&nbsp; optimal reservoir&nbsp; operation&#8221;, <span style="font-style: italic;">Journal of the Franklin&nbsp; Institute</span> <span style="font-weight: bold;">344</span>:&nbsp; 452&#8211;462.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948647&pid=S1409-2433201300010000400002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[3]&nbsp; Karaboga&nbsp; D. (2005) <span style="font-style: italic;">An idea based on honey bee swarm for numerical optimization</span>. Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering&nbsp; Department.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948650&pid=S1409-2433201300010000400003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    ]]></body>
<body><![CDATA[<br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[4]&nbsp; Karaboga&nbsp; D.; Akay, B. (2007) &#8220;Artificial bee colony (ABC) algorithm on training artificial neural&nbsp; networks&#8221;, en:&nbsp; <span style="font-style: italic;">Proceedings&nbsp; of 15</span><span  style="font-style: italic;">th</span><span style="font-style: italic;"> IEEE Signal Processing&nbsp; and Communications Applications</span>:&nbsp; 1&#8211;4.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948653&pid=S1409-2433201300010000400004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[5]&nbsp; Karaboga, D.; Akay, B. (2009) &#8220;A comparative study of artificial bee colony algorithm&#8221;, <span style="font-style: italic;">Applied Mathematics and Computation</span> <span style="font-weight: bold;">214</span>: 108&#8211;</font><font  style="font-family: verdana;" size="-1">132.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948656&pid=S1409-2433201300010000400005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[6]&nbsp; Karaboga, D.; Osturk, C. (2010) &#8220;Fuzzy&nbsp; clustering with artificial bee colony algorithm&#8221;, <span style="font-style: italic;">Scientific&nbsp; research&nbsp; and Essays</span>&nbsp; <span style="font-weight: bold;">5</span>(14):&nbsp; 1899&#8211;1902.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948659&pid=S1409-2433201300010000400006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     ]]></body>
<body><![CDATA[<!-- ref --><br> <font style="font-family: verdana;" size="-1">[7]&nbsp; McCullough,&nbsp; B.D.; Wilson, B. (2005) &#8220;On the accuracy&nbsp; of stastistical procedures&nbsp; in Microsoft Excel 2003&#8221;, <span style="font-style: italic;">Comput.&nbsp; Stast.&nbsp; and Data&nbsp; Anal. </span><span style="font-weight: bold;">49</span>:&nbsp; 1244&#8211;1252.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948662&pid=S1409-2433201300010000400007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[8]&nbsp; NIST &nbsp;&nbsp; &nbsp;(2001), &nbsp;&nbsp; &nbsp;en: &nbsp;&nbsp; &nbsp;http://www.itl.nist.gov/div898/strd/general/dataarchive.html,&nbsp; consultada 20-Feb-2012,&nbsp; 11:35 a.m.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948665&pid=S1409-2433201300010000400008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[9]&nbsp; Ozturk, C.; Karaboga, D. (2008) &#8220;Classifications by neural&nbsp; networks and clustering with artificial bee colony (ABC)&nbsp; algorithm&#8221;,&nbsp; en:&nbsp; <span  style="font-style: italic;">Proceedings of the 6th International Symposium on Intelligent&nbsp; and Manufacturing&nbsp; Systems,&nbsp;&nbsp; Features,&nbsp; Strategies&nbsp;&nbsp; and&nbsp; Innovation</span>,&nbsp; Sakarya,&nbsp; Turkey.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948668&pid=S1409-2433201300010000400009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[10]&nbsp; Pham,&nbsp;&nbsp; D.T.;&nbsp;&nbsp; Koc,&nbsp; E.;&nbsp; Lee,&nbsp; J.Y.;&nbsp; Phrueksanant,&nbsp; J. (2007)&nbsp; &#8220;Using the&nbsp; bees algorithm to schedule jobs for a machine&#8221;,&nbsp; en:&nbsp; <span style="font-style: italic;">Proceedings Eighth International Conference&nbsp; on Laser&nbsp; Metrology, CMM and Machine&nbsp; Tool&nbsp; Performance</span>, LAMDAMAP,&nbsp; Euspen,&nbsp; UK, Cardiff:&nbsp; 430&#8211;</font><font  style="font-family: verdana;" size="-1">439.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948671&pid=S1409-2433201300010000400010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     <!-- ref --><br> <font style="font-family: verdana;" size="-1">[11]&nbsp; Tvrd&iacute;k, J. (2009) &#8220;Adaptation in differential evolution:&nbsp; a numerical comparison&#8221;, <span  style="font-style: italic;">Applied Soft Computing&nbsp;</span> <span style="font-weight: bold;">9</span>:&nbsp; 1149&#8211;1155.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1948674&pid=S1409-2433201300010000400011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font>    <br>     <br> <font style="font-family: verdana;" size="-1"><a name="Correspondencia1"></a><a  href="#Correspondencia2">*</a>Correspondencia a:</font>    <br> <font style="font-family: verdana;" size="-1">Sergio G. de-los-Cobos-Silva. </font><font style="font-family: verdana;"  size="-1">Universidad Aut&oacute;noma&nbsp;&nbsp; Metropolitana-Iztapalapa,&nbsp;&nbsp; Departamento&nbsp;&nbsp; de&nbsp;&nbsp; Ingenier&iacute;a El&eacute;ctrica,&nbsp; Av.&nbsp; San&nbsp; Rafael&nbsp; Atlixco&nbsp; 186, Col.&nbsp; Vicentina,&nbsp; Del.&nbsp; Iztapalapa,&nbsp; M&eacute;xico&nbsp; D.F., C.P.&nbsp; 09340, M&eacute;xico.&nbsp; E-Mail:&nbsp; cobos@xanum.uam.mx</font>    <br> <font style="font-family: verdana;" size="-1">Miguel A. Guti&eacute;rrez-Andrade. </font><font style="font-family: verdana;"  size="-1">Misma direcci&oacute;n&nbsp;&nbsp; &nbsp;que/Same&nbsp;&nbsp; &nbsp;address &nbsp;&nbsp; &nbsp;as &nbsp;&nbsp; &nbsp;S. &nbsp;&nbsp; &nbsp;de &nbsp;&nbsp; &nbsp;los &nbsp;&nbsp; &nbsp;Cobos. &nbsp;&nbsp; &nbsp;E-Mail: </font><font  style="font-family: verdana;" size="-1">gamma@xanum.uam.mx</font>    <br> <font style="font-family: verdana;" size="-1">Eric A. Rinc&oacute;n-Garc&iacute;a. </font><font  style="font-family: verdana;" size="-1">Universidad Aut&oacute;noma&nbsp; Metropolitana-Azcapotzalco,&nbsp; Departamento&nbsp; de&nbsp; Sistemas, Av.&nbsp; San&nbsp; Pablo&nbsp; 180, Colonia&nbsp; Reynosa&nbsp; Tamauluipas, M&eacute;xico&nbsp; D.F.,&nbsp; C.P.&nbsp; 02200, M&eacute;xico. E-Mail:&nbsp; rigaeral@correo.azc.uam.mx</font>    <br> <font style="font-family: verdana;" size="-1">Pedro Lara-Vel&aacute;zquez. </font><font style="font-family: verdana;"  size="-1">Misma&nbsp; direcci&oacute;n&nbsp;&nbsp; &nbsp;que/Same&nbsp;&nbsp; &nbsp;address &nbsp;&nbsp; &nbsp;as &nbsp;&nbsp; &nbsp;E. &nbsp;&nbsp; &nbsp;Rinc&oacute;n.&nbsp;&nbsp; &nbsp;E-Mail: </font><font style="font-family: verdana;" size="-1">pedrolara@correo.azc.uam.mx</font>    ]]></body>
<body><![CDATA[<br> <font style="font-family: verdana;" size="-1">Manuel Aguilar-Cornejo. </font><font  style="font-family: verdana;" size="-1">Misma&nbsp; direcci&oacute;n que/Same address as S. de los Cobos.&nbsp; E-Mail:&nbsp; mac@xanum.uam.mx    <br> </font><font style="font-family: verdana;" size="-1"><a  name="Afiliacion1"></a><a href="#Afiliacion6">*</a> Universidad Aut&oacute;noma&nbsp;&nbsp; Metropolitana-Iztapalapa,&nbsp;&nbsp; Departamento&nbsp;&nbsp; de&nbsp;&nbsp; Ingenier&iacute;a El&eacute;ctrica,&nbsp; Av.&nbsp; San&nbsp; Rafael&nbsp; Atlixco&nbsp; 186, Col.&nbsp; Vicentina,&nbsp; Del.&nbsp; Iztapalapa,&nbsp; M&eacute;xico&nbsp; D.F., C.P.&nbsp; 09340, M&eacute;xico.&nbsp; E-Mail:&nbsp; cobos@xanum.uam.mx</font>    <br> <font style="font-family: verdana;" size="-1"><a name="Afiliacion2"></a><a  href="#Afiliacion7">+</a> Misma &nbsp;&nbsp; &nbsp;direcci&oacute;n&nbsp;&nbsp; &nbsp;que/Same&nbsp;&nbsp; &nbsp;address &nbsp;&nbsp; &nbsp;as &nbsp;&nbsp; &nbsp;S. &nbsp;&nbsp; &nbsp;de &nbsp;&nbsp; &nbsp;los &nbsp;&nbsp; &nbsp;Cobos. &nbsp;&nbsp; &nbsp;E-Mail: </font><font  style="font-family: verdana;" size="-1">gamma@xanum.uam.mx</font>    <br> <font style="font-family: verdana;" size="-1"><a name="Afiliacion3"></a><a  href="#Afiliacion8">&#8225;</a> Universidad Aut&oacute;noma&nbsp; Metropolitana-Azcapotzalco,&nbsp; Departamento&nbsp; de&nbsp; Sistemas, Av.&nbsp; San&nbsp; Pablo&nbsp; 180, Colonia&nbsp; Reynosa&nbsp; Tamauluipas, M&eacute;xico&nbsp; D.F.,&nbsp; C.P.&nbsp; 02200, M&eacute;xico. E-Mail:&nbsp; rigaeral@correo.azc.uam.mx</font>    <br> <font style="font-family: verdana;" size="-1"><a name="Afiliacion4"></a><a  href="#Afiliacion9">&sect;</a> Misma &nbsp;&nbsp; &nbsp;direcci&oacute;n&nbsp;&nbsp; &nbsp;que/Same&nbsp;&nbsp; &nbsp;address &nbsp;&nbsp; &nbsp;as &nbsp;&nbsp; &nbsp;E. &nbsp;&nbsp; &nbsp;Rinc&oacute;n.&nbsp;&nbsp; &nbsp;E-Mail: </font><font style="font-family: verdana;" size="-1">pedrolara@correo.azc.uam.mx</font>    <br> <font style="font-family: verdana;" size="-1"><a name="Afiliacion5"></a><a  href="#Afiiliacion10">&para;</a> Misma&nbsp; direcci&oacute;n que/Same address as S. de los Cobos.&nbsp; E-Mail:&nbsp; mac@xanum.uam.mx</font>    <br> <font style="font-family: verdana;" size="-1"><span  style="font-weight: bold;"></span></font> <hr  style="width: 100%; height: 2px; margin-left: 0px; margin-right: 0px;">     <div style="text-align: center;"><font style="font-family: verdana;"  size="-1"><span style="font-weight: bold;">Received: 22/Feb/2012; Revised: 20/Sep/2012; Accepted:&nbsp; 27/Nov/2012</span></font>    <br> <font style="font-family: verdana;" size="-1"></font></div> </div>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abbass]]></surname>
<given-names><![CDATA[H.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Marriage in honey-bee optimization (MBO): a haplometrosis polygynous swarming approach&#8221;]]></source>
<year>2001</year>
<conf-name><![CDATA[ Proceedings The Congress on Evolutionary Computation (CEC2001)]]></conf-name>
<conf-loc>Seoul Seoul</conf-loc>
<page-range>207-214</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Afshar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bozog Haddad]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
<name>
<surname><![CDATA[Marino]]></surname>
<given-names><![CDATA[M.A]]></given-names>
</name>
<name>
<surname><![CDATA[Adams]]></surname>
<given-names><![CDATA[B.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation]]></article-title>
<source><![CDATA[Journal of the Franklin Institute]]></source>
<year>2007</year>
<volume>344</volume>
<page-range>452-462</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><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, Engineering Faculty, Computer Engineering Department]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="confpro">
<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>
<source><![CDATA[&#8220;Artificial bee colony (ABC) algorithm on training artificial neural networks&#8221;]]></source>
<year>2007</year>
<conf-name><![CDATA[ Proceedings of 15th IEEE Signal Processing and Communications Applications]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-4</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[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="en"><![CDATA[&#8220;A comparative study of artificial bee colony algorithm&#8221;]]></article-title>
<source><![CDATA[Applied Mathematics and Computation]]></source>
<year>2009</year>
<volume>214</volume>
<page-range>108-132</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[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Osturk]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Fuzzy clustering with artificial bee colony algorithm&#8221;]]></article-title>
<source><![CDATA[Scientific research and Essays]]></source>
<year>2010</year>
<volume>5</volume>
<numero>14</numero>
<issue>14</issue>
<page-range>1899-1902</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[McCullough]]></surname>
<given-names><![CDATA[B.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Wilson]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;On the accuracy of stastistical procedures in Microsoft Excel 2003&#8221;]]></article-title>
<source><![CDATA[Comput. Stast. and Data Anal.]]></source>
<year>2005</year>
<volume>49</volume>
<page-range>1244-1252</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="">
<collab>NIST</collab>
<source><![CDATA[]]></source>
<year>2001</year>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ozturk]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Classifications by neural networks and clustering with artificial bee colony (ABC) algorithm&#8221;]]></source>
<year>2008</year>
<conf-name><![CDATA[ Proceedings of the 6th International Symposium on Intelligent and Manufacturing Systems, Features, Strategies and Innovation,]]></conf-name>
<conf-loc>Sakarya Sakarya</conf-loc>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pham]]></surname>
<given-names><![CDATA[D.T.]]></given-names>
</name>
<name>
<surname><![CDATA[Koc]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[J.Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Phrueksanant]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Using the bees algorithm to schedule jobs for a machine&#8221;]]></source>
<year>2007</year>
<conf-name><![CDATA[ Proceedings Eighth International Conference on Laser Metrology, CMM and Machine Tool Performance]]></conf-name>
<conf-loc>Euspen Cardiff</conf-loc>
<page-range>430-439</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[Tvrdík]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Adaptation in differential evolution: a numerical comparison&#8221;]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2009</year>
<volume>9</volume>
<page-range>1149-1155</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
