<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462013000100006</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Metaheurísticas multiobjetivo adaptativas]]></article-title>
<article-title xml:lang="en"><![CDATA[Multiobjective Adaptive Metaheuristics]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Machin Navas]]></surname>
<given-names><![CDATA[Mirialys]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Nebro Urbaneja]]></surname>
<given-names><![CDATA[Antonio J.]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad de las Ciencias Informáticas Facultad Regional ]]></institution>
<addr-line><![CDATA[Ciego de Ávila ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidad de Málaga Departamento de Lenguajes y Ciencias de la Computación ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>España</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2013</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2013</year>
</pub-date>
<volume>17</volume>
<numero>1</numero>
<fpage>53</fpage>
<lpage>62</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462013000100006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462013000100006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462013000100006&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[La optimización de problemas en los que hay maximizar o minimizar a la vez varias funciones, que usualmente están en conflicto entre sí, usando metaheurísticas, es un campo de investigación cada vez más popular, que ha dado lugar a una disciplina conocida como optimización multiobjetivo. Las metaheurísticas son técnicas no exactas que intentan proporcionar soluciones satisfactorias a problemas complejos de optimización en los que las técnicas exactas no son viables, y se caracterizan por usar una serie de operadores que se aplican de forma estocástica de acuerdo a cierta parametrización. Los valores de estos parámetros suelen ser establecidos al inicio de la ejecución de las técnicas y permanecen invariados hasta que estas terminan, y recientemente estan surgiendo trabajos que sugieren que dichos parámetros se modifiquen de forma adaptativa, según la marcha del algoritmo. En este trabajo se propone estudiar el efecto de usar dos operadores de forma adaptativa en dos metaheurísticas multiobjetivo representativas. Los resultados obtenidos indican que es posible mejorar el rendimiento de los algoritmos usando adaptatividad.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Solution of Abstract Optimization problems with two or more conflicting functions or objectives by using metaheuristics has attracted attention of researches and become a rapidly developing area known as Multiobjective Optimization. Metaheuristics are non-exact techniques aimed to produce satisfactory solutions to complex optimization problems where exact techniques are not applicable; they are characterized by using some operators that are applied in a stochastic way according to a given parameterization. The settings of these parameters are usually established at the beginning of the execution of algorithms, and they remain unchanged until the search finishes. Recently, a number of papers studying adaptive modifications of these parameters on the fly have emerged. In this work, we report a study of the effect of using two operators in an adaptive way in two multiobjective metaheuristics representative of the state-of-the-art. The obtained results demonstrate that it is possible to improve the search performance of two chosen algorithms by using the adaptive scheme.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Estrategia adaptativa]]></kwd>
<kwd lng="es"><![CDATA[metaheurísticas]]></kwd>
<kwd lng="es"><![CDATA[optimización multiobjetivo]]></kwd>
<kwd lng="en"><![CDATA[Adaptive strategy]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[multiobjective optimization]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="justify"><font face="verdana" size="4">Art&iacute;culos</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="4"><b>Metaheur&iacute;sticas multiobjetivo adaptativas</b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>      <p align="center"><font face="verdana" size="3"><b>Multiobjective Adaptive Metaheuristics</b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="2"><b>Mirialys Machin Navas<sup>1</sup> y Antonio J. Nebro Urbaneja<sup>2</sup></b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><sup><i>1</i></sup> <i>Facultad Regional UCI Ciego de &Aacute;vila,</i> <i>Cuba.</i></font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><sup><i>2</i></sup> <i>Departamento de Lenguajes y Ciencias de la Computaci&oacute;n, Universidad de M&aacute;laga, Espa&ntilde;a</i> <a href="mailto:mmachin@cav.uci.cu">mmachin@cav.uci.cu</a>, <a href="mailto:antonio@lcc.uma.es">antonio@lcc.uma.es</a></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2">Article received on 28/09/2012    <br> 	Accepted on 12/01/2013.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Resumen</b></font></p>  	    <p align="justify"><font face="verdana" size="2">La optimizaci&oacute;n de problemas en los que hay maximizar o minimizar a la vez varias funciones, que usualmente est&aacute;n en conflicto entre s&iacute;, usando metaheur&iacute;sticas, es un campo de investigaci&oacute;n cada vez m&aacute;s popular, que ha dado lugar a una disciplina conocida como optimizaci&oacute;n multiobjetivo. Las metaheur&iacute;sticas son t&eacute;cnicas no exactas que intentan proporcionar soluciones satisfactorias a problemas complejos de optimizaci&oacute;n en los que las t&eacute;cnicas exactas no son viables, y se caracterizan por usar una serie de operadores que se aplican de forma estoc&aacute;stica de acuerdo a cierta parametrizaci&oacute;n. Los valores de estos par&aacute;metros suelen ser establecidos al inicio de la ejecuci&oacute;n de las t&eacute;cnicas y permanecen invariados hasta que estas terminan, y recientemente estan surgiendo trabajos que sugieren que dichos par&aacute;metros se modifiquen de forma adaptativa, seg&uacute;n la marcha del algoritmo. En este trabajo se propone estudiar el efecto de usar dos operadores de forma adaptativa en dos metaheur&iacute;sticas multiobjetivo representativas. Los resultados obtenidos indican que es posible mejorar el rendimiento de los algoritmos usando adaptatividad.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Palabras clave:</b> Estrategia adaptativa, metaheur&iacute;sticas, optimizaci&oacute;n multiobjetivo.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">Solution of Abstract Optimization problems with two or more conflicting functions or objectives by using metaheuristics has attracted attention of researches and become a rapidly developing area known as Multiobjective Optimization. Metaheuristics are non&#45;exact techniques aimed to produce satisfactory solutions to complex optimization problems where exact techniques are not applicable; they are characterized by using some operators that are applied in a stochastic way according to a given parameterization. The settings of these parameters are usually established at the beginning of the execution of algorithms, and they remain unchanged until the search finishes. Recently, a number of papers studying adaptive modifications of these parameters on the fly have emerged. In this work, we report a study of the effect of using two operators in an adaptive way in two multiobjective metaheuristics representative of the state&#45;of&#45;the&#45;art. The obtained results demonstrate that it is possible to improve the search performance of two chosen algorithms by using the adaptive scheme.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> Adaptive strategy, metaheuristics, multiobjective optimization.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v17n1/v17n1a6.pdf">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Referencias</b></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>1. Deb, K., Pratap, A., Agarwal, S., &amp; Meyarivan, T. (2002).</b> A fast and elitist multiobjective genetic algorithm: NSGA&#45;II. <i>IEEE Transactions on Evolutionary Computation,</i> 6(2), 182&#45;197.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2059195&pid=S1405-5546201300010000600001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>2. Gomez, J.C. &amp; Terashima, H. (2012).</b> Building General Hyper&#45;Heuristics for Multi&#45;Objective Cutting Stock Problems. <i>Computacion y Sistemas,</i> 16(3), 321&#45;334.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2059197&pid=S1405-5546201300010000600002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>3. Zhang, Q. &amp; Li, H. (2007).</b> MOEA/D: A multi&#45;objective evolutionary algorithm based on decomposition. <i>IEEE Transactions on Evolutionary Computation,</i> 11(6), 712&#45;731.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2059199&pid=S1405-5546201300010000600003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>4. Li, H. &amp; Zhang, Q. (2009).</b> Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA&#45;II. <i>IEEE Transactions on Evolutionary Computation,</i> 13(2), 284&#45;302.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2059201&pid=S1405-5546201300010000600004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>5. Durillo, J.J., Nebro, A.J., &amp; Alba, E. (2010).</b> The JMetal framework for multi&#45;objective optimization: Design and architecture. <i>2010 IEEE Congress on Evolutionary Computation (CEC),</i> Barcelona, Spain, 1&#45;8.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2059203&pid=S1405-5546201300010000600005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>6. Durillo, J.J., Nebro, A.J., Luna, F., Dorronsoro, B., &amp; Alba, E. (2006).</b> <i>JMetal: a java framework for developing multi&#45;objective optimization metaheuristics</i> (ITI&#45;2006&#45;10), Spain: University of Malaga.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2059205&pid=S1405-5546201300010000600006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>7. Vrugt, J. &amp; Robinson, B. (2007).</b> Improved evolutionary optimization from genetically adaptive multimethod search. <i>Proceedings of the National Academy of Sciences of the United States of America,</i> 104(3), 708&#45;711.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2059207&pid=S1405-5546201300010000600007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     ]]></body>
<body><![CDATA[ ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Pratap]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Agarwal]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Meyarivan]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A fast and elitist multiobjective genetic algorithm: NSGA-II]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2002</year>
<volume>6</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>182-197</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[Gomez]]></surname>
<given-names><![CDATA[J.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Terashima]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Building General Hyper-Heuristics for Multi-Objective Cutting Stock Problems]]></article-title>
<source><![CDATA[Computacion y Sistemas]]></source>
<year>2012</year>
<volume>16</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>321-334</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[Zhang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[MOEA/D: A multi-objective evolutionary algorithm based on decomposition]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2007</year>
<volume>11</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>712-731</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2009</year>
<volume>13</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>284-302</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Durillo]]></surname>
<given-names><![CDATA[J.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Nebro]]></surname>
<given-names><![CDATA[A.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Alba]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The JMetal framework for multi-objective optimization: Design and architecture]]></article-title>
<source><![CDATA[]]></source>
<year>2010</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-date>2010</conf-date>
<conf-loc>Barcelona </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Durillo]]></surname>
<given-names><![CDATA[J.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Nebro]]></surname>
<given-names><![CDATA[A.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Luna]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Dorronsoro]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Alba]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[JMetal: a java framework for developing multi-objective optimization metaheuristics (ITI-2006-10)]]></source>
<year>2006</year>
<publisher-name><![CDATA[University of Malaga]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vrugt]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Robinson]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Improved evolutionary optimization from genetically adaptive multimethod search]]></article-title>
<source><![CDATA[Proceedings of the National Academy of Sciences of the United States of America]]></source>
<year>2007</year>
<volume>104</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>708-711</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
