<?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-24332013000200006</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[An optimization algorithm inspired by musical composition in constrained optimization problems]]></article-title>
<article-title xml:lang="es"><![CDATA[Un algoritmo de optimización inspirado en composición musical para el problema de optimización con restricciones]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[Roman Anselmo]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[Javier]]></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 Alfredo]]></given-names>
</name>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ponsich]]></surname>
<given-names><![CDATA[Antonin]]></given-names>
</name>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Herrera-Alcántara]]></surname>
<given-names><![CDATA[Oscar]]></given-names>
</name>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad Autónoma Metropolitana Departamento de Sistemas ]]></institution>
<addr-line><![CDATA[Tamaulipas México D. F.]]></addr-line>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidad Autónoma Metropolitana Departamento de Sistemas ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2013</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2013</year>
</pub-date>
<volume>20</volume>
<numero>2</numero>
<fpage>183</fpage>
<lpage>202</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332013000200006&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-24332013000200006&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-24332013000200006&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Many real-world problems can be expressed as an instance of the constrained nonlinear optimization problem (CNOP). This problem has a set of constraints specifies the feasible solution space. In the last years several algorithms have been proposed and developed for tackling CNOP. In this paper, we present a cultural algorithm for constrained optimization, which is an adaptation of &#8220;Musical Composition Method&#8221; or MCM, which was proposed in [33] by Mora et al. We evaluated and analyzed the performance of MCM on five test cases benchmark of the CNOP. Numerical results were compared to evolutionary algorithm based on homomorphous mapping [23], Artificial Immune System [9] and anti-culture population algorithm [39]. The experimental results demonstrate that MCM significantly improves the global performances of the other tested metaheuristics on same of benchmark functions.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Muchos de los problemas reales se pueden expresar como una instancia del problema de optimización no lineal con restricciones (CNOP). Este problema tiene un conjunto de restricciones, el cual especifica el espacio de soluciones factibles. En los últimos años se han propuesto y desarrollado varios algoritmos para resolver el CNOP. En este trabajo, se presenta un algoritmo cultural para optimización con restricciones, el cual es una adaptación del &#8220;Método de Composición Musical&#8221; o MCM, propuesto en [33] por Mora et al., para resolver instancias del CNOP. La adaptación propuesta del MCM se aplicó a cinco instancias de prueba del CNOP a fin de evaluar y analizar su comportamiento Los resultados experimentales del MCM se compararon con los resultados obtenidos por algoritmo evolutivo basado en homomorfismo [23] , Sistema Inmune Artificial [9] y el algoritmo de anti-cultural [39]. Los resultados experimentales muestran que el MCM genera resultados significativamente mejores que los obtenidos por las otras metaheurísticas probadas en algunos de los problemas de referencia.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Constrained nonlinear optimization]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[cultural algorithms]]></kwd>
<kwd lng="en"><![CDATA[system socio-cultural of creativity]]></kwd>
<kwd lng="en"><![CDATA[musical composition]]></kwd>
<kwd lng="es"><![CDATA[optimización no lineal con restricciones]]></kwd>
<kwd lng="es"><![CDATA[metaheurísticas]]></kwd>
<kwd lng="es"><![CDATA[algoritmos culturales]]></kwd>
<kwd lng="es"><![CDATA[sistema socio-cultural de la creatividad]]></kwd>
<kwd lng="es"><![CDATA[composición musical]]></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">An optimization algorithm inspired by musical composition in constrained optimization problems</font><br  style="font-family: verdana; font-weight: bold;"> <br style="font-family: verdana; font-weight: bold;"> <font style="font-family: verdana; font-weight: bold;" size="4">Un algoritmo de optimizaci&oacute;n inspirado en composici&oacute;n musical para el problema de optimizaci&oacute;n con restricciones</font><br  style="font-family: verdana;"> </div> <br style="font-family: verdana;">     <div style="text-align: center;"><font style="font-family: verdana;"  size="2">Roman Anselmo Mora-Guti&eacute;rrez<sup><a href="#1">*</a><a name="7"></a>+</sup>, Javier Ram&iacute;rez-Rodr&iacute;guez<sup><a href="#2">&#8224;</a><a name="8"></a>+</sup>, Eric Alfredo Rinc&oacute;n-Garc&iacute;a<sup><a href="#3">&#8225;</a><a name="9"></a>+</sup>, Antonin Ponsich<sup><a href="#4">&sect;</a><a name="10"></a>+</sup>, Oscar Herrera-Alc&aacute;ntara<sup><a href="#5">&para;</a><a name="11"></a>+</sup>, Pedro Lara-Vel&aacute;zquez<sup><a href="#6">/</a><a name="12"></a>+</sup></font><br  style="font-family: verdana;"> </div>     <br> <font style="font-family: verdana;" size="-1"><a name="Correspondencia2"></a>*<a  href="#Correspondencia1">Direcci&oacute;n para correspondencia:</a></font><br style="font-family: verdana;"> <hr style="width: 100%; height: 2px;"><font  style="font-family: verdana; font-weight: bold;" size="3">Abstract</font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">Many real-world problems can be expressed as an instance of the constrained nonlinear optimization problem (CNOP). This problem has a set of constraints specifies the feasible solution space. In the last years several algorithms have been proposed and developed for tackling CNOP. In this paper, we present a cultural algorithm for constrained optimization, which is an adaptation of &#8220;Musical Composition Method&#8221; or MCM, which was proposed in [33] by Mora et al. We evaluated and analyzed the performance of MCM on five test cases benchmark of the CNOP. Numerical results were compared to evolutionary algorithm based on homomorphous mapping [23], Artificial Immune System [9] and anti-culture population algorithm [39]. The experimental results demonstrate that MCM significantly improves the global performances of the other tested metaheuristics on same of benchmark functions.</font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2"><span  style="font-weight: bold;">Keywords:</span> Constrained nonlinear optimization, metaheuristics, cultural algorithms, system socio-cultural of creativity, musical composition.</font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana; font-weight: bold;" size="3">Resumen</font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">Muchos de los problemas reales se pueden expresar como una instancia del problema de optimizaci&oacute;n no lineal con restricciones (CNOP). Este problema tiene un conjunto de restricciones, el cual especifica el espacio de soluciones factibles. En los &uacute;ltimos a&ntilde;os se han propuesto y desarrollado varios algoritmos para resolver el CNOP. En este trabajo, se presenta un algoritmo cultural para optimizaci&oacute;n con restricciones, el cual es una adaptaci&oacute;n del &#8220;M&eacute;todo de Composici&oacute;n Musical&#8221; o MCM, propuesto en [33] por Mora et al., para resolver instancias del CNOP. La adaptaci&oacute;n propuesta del MCM se aplic&oacute; a cinco instancias de prueba del CNOP a fin de evaluar y analizar su comportamiento Los resultados experimentales del MCM se compararon con los resultados obtenidos por algoritmo evolutivo basado en homomorfismo [23] , Sistema Inmune Artificial [9] y el algoritmo de anti-cultural [39]. Los resultados experimentales muestran que el MCM genera resultados significativamente mejores que los obtenidos por las otras metaheur&iacute;sticas probadas en algunos de los problemas de referencia.</font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2"><span  style="font-weight: bold;">Palabras clave:</span> optimizaci&oacute;n no lineal con restricciones, metaheur&iacute;sticas, algoritmos culturales, sistema socio-cultural de la creatividad, composici&oacute;n musical.</font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2"><span  style="font-weight: bold;">Mathematics Subject Classification:</span> 97M40, 90C59, 68T20.</font><br style="font-family: verdana;"> <hr style="width: 100%; height: 2px;">    <br> <font style="font-family: verdana;" size="-1">Contenido disponible en pdf</font>    <br> <br style="font-family: verdana;"> <hr style="width: 100%; height: 2px;">    <!-- ref --><br> <font style="font-family: verdana; font-weight: bold;" size="3">References</font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[1] Biles, J.A. (1994) &#8220;GenJam: A genetic algorithm for generating jazz solos&#8221;, <span style="font-style: italic;">International Computer Music Conference. Aarhus, Denmark: International. Computer Music Association</span>: 131&#8211;137.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950862&pid=S1409-2433201300020000600001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[2] Bekrar, A.; Chaabane, S.; Trentesaux, S.; Bornschlegell, A.; Pell&eacute;, J.; Harmand, S. (2011) &#8220;Hybrid PSO-tabu search for constrained nonlinear optimization problems &#8221;, <span  style="font-style: italic;">ICSI 2011: International Conference on Swarm Intelligence.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950863&pid=S1409-2433201300020000600002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></span> </font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[3] Cai, Z.;Wang, Y.A. (2006) &#8220;Multiobjective optimization based evolutionary algorithm for constrained optimization&#8221;. <span  style="font-style: italic;">IEEE Transactions on evolutionary computation</span> 10: 658&#8211;675.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950864&pid=S1409-2433201300020000600003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[4] Chung, C.J.; Reynolds, R.G. (1996) &#8220;A testbed for solving optimization problems using cultural algorithms&#8221;, <span  style="font-style: italic;">Proceedings of the Fifth Annual Conference on Evolutionary Programming</span>: 225&#8211;236.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950865&pid=S1409-2433201300020000600004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[5] Coello, C.A.C.; Becerra, R.L. (2002) &#8220;Constrained optimization using an evolutionary programming-based cultural algorithm&#8221;. <span  style="font-style: italic;">Adaptive Computing in Design and Manufacture</span> V, Springer, London: 317&#8211;328.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950866&pid=S1409-2433201300020000600005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[6] Coello, C.A.C.; Becerra, R.L. (2003) &#8220;Evolutionary multiobjective optimization using a cultural algorithm&#8221;, <span  style="font-style: italic;">Swarm Intelligence Symposium</span>, 2003. SIS-03. Proceedings of the 2003 IEEE: 6&#8211;13.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950867&pid=S1409-2433201300020000600006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[7] Cope, D. (2000) <span  style="font-style: italic;">The Algorithmic Composer</span>. A-R Editions Inc. Wisconsin USA.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950868&pid=S1409-2433201300020000600007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[8] Cope, D. (2005) <span style="font-style: italic;">Computer Model of Musical Creativity</span>. MIT Press, Cambridge MA.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950869&pid=S1409-2433201300020000600008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[9] Cruz Cort&eacute;s, N. (2004) <span style="font-style: italic;">Sistema Inmune Artificial para Solucionar Problemas de Optimizaci&oacute;n</span>. Doctoral Thesis, CINVESTAV-Instituto Polit&eacute;cnico Nacional. Ciudad de M&eacute;xico.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950870&pid=S1409-2433201300020000600009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[10] de Bono, E. (1991) <span  style="font-style: italic;">El Pensamiento Lateral: Manual de Creatividad</span>. Espsa libros S.L.U.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950871&pid=S1409-2433201300020000600010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[11] Dorigo, M.; Maniezzo, V.; Colorni, A. (1996) &#8220;Ant system: optimization by a colony of cooperating agents&#8221;, <span  style="font-style: italic;">IEEE Transactions on Systems, Man, and Cybernetics </span>26: 29&#8211;41.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950872&pid=S1409-2433201300020000600011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[12] Geem, Z.W. (2009) <span style="font-style: italic;">Recent Advances in Harmony Search Algorithm</span>. Springer, New York.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950873&pid=S1409-2433201300020000600012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[13] Geem, Z.W. (2010) <span style="font-style: italic;">Music-Inspired Harmony Search Algorithm</span>. Springer, New York.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950874&pid=S1409-2433201300020000600013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><br> <br style="font-family: verdana;"> </font><font style="font-family: verdana;" size="2">[14] Geem, Z.W., Kim J.-H., Loganathan G.V. (2001) &#8220;A new heuristic optimization algorithm: harmony search&#8221;, <span  style="font-style: italic;">Simulation </span>76(2): 60&#8211;68.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950875&pid=S1409-2433201300020000600014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[15] Gessler, N. (2003) &#8220;Evolving cultural things-that-think&#8221;, <span style="font-style: italic;">Computational Synthesis: From Basic Building Blocks to High Level Functionality</span>, Papers from the 2003 AAAI Spring Symposium, Technical Report SS&#8211;03&#8211;02. Menlo Park, AAAI Press: 75&#8211;81.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950876&pid=S1409-2433201300020000600015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[16] Gould N., Orban D., Toint P.L. (2001) &#8220; CUTTEr a Constrained and Unconstrained Testing Environment, revisited&#8221;, in: http://www.cuter.rl.ac.uk/problems.html, consulted on 20/05/13.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950877&pid=S1409-2433201300020000600016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[17] Horner, A.; Goldberg, D.E. (1991) &#8220;Genetic algorithms and computer assisted music composition&#8221;, <span style="font-style: italic;">Music Composition. ICMC&acute;91 Proceedings</span>, International Computer Music Association, San Francisco: 479&#8211;482.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950878&pid=S1409-2433201300020000600017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[18] Hu, X.; Eberhart, R.(2002) &#8220;Solving constrained nonlinear optimization problems with particle swarm optimization&#8221;, in: <span  style="font-style: italic;">6th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2002)</span>: 203&#8211;206.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950879&pid=S1409-2433201300020000600018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[19] Jacob B.L. (1996) &#8220;Algorithmic composition as a model of creativity&#8221;, <span style="font-style: italic;">Organised Sound</span>, Cambridge University Press: 157&#8211;165.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950880&pid=S1409-2433201300020000600019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --> </font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[20] Jacob B.L. (1995) &#8220;Composing with genetic algorithms&#8221;, <span style="font-style: italic;">International Computer Music</span> <span  style="font-style: italic;">Association</span>: 452&#8211;455.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950881&pid=S1409-2433201300020000600020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[21] Jin, X.; Reynolds, R.G. (1999) &#8220;Using knowledge based evolutionary computation to solve nonlinear constraint optimization problems: a cultural algorithm approach&#8221;, <span style="font-style: italic;">Proceedings of the 1999 Congress on Evolutionary Computation</span> 3: 1678.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950882&pid=S1409-2433201300020000600021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[22] Kennedy, J., Eberhart, R.C. (1995) &#8220;Particle swarm optimization&#8221;, <span style="font-style: italic;">International Conference Neuronal Networks</span>: 1942&#8211;1948.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950883&pid=S1409-2433201300020000600022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[23] Koziel, S.; Michalewicz, Z. (1999) &#8220;Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization&#8221;, <span style="font-style: italic;">Evolutionary Computation</span> 7: 19&#8211;44.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950884&pid=S1409-2433201300020000600023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[24] Landa Becerra, R.; Coello Coello, C.A. (2005) &#8220;Optimization with constraints using a cultured differential evolution approach&#8221;, in: <span style="font-style: italic;">Proceedings of the GECCO Conference</span>: 34&#8211;35.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950885&pid=S1409-2433201300020000600024&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[25] Lee, K.S.; Geem, Z.W. (2004) &#8220;A new structural optimizationmethod based on the harmony search algorithm&#8221;, <span  style="font-style: italic;">Computers &amp; Structures</span> 82: 781&#8211;798.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950886&pid=S1409-2433201300020000600025&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[26] Leyffer, S.; Mahajan, A.; Cochran, J.J.; Cox, L.A.; Keskinocak, P.; Kharoufeh, J.P.; Smith J.C. (2010) <span  style="font-style: italic;">Software for Nonlinearly Constrained Optimization</span>. John Wiley &amp; Sons, New York.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950887&pid=S1409-2433201300020000600026&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[27] Liu Y.T. (2000) &#8220;Creativity or novelty?: Cognitive-computational versus social-cultural&#8221;, <span style="font-style: italic;">Design Studies</span>: 261&#8211;276.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950888&pid=S1409-2433201300020000600027&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --> </font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[28] McDonnell, J.; Reynolds, R.; Fogel, D.(1995) &#8220;Using cultural algorithms for constraint handling in GENOCOP&#8221;, <span  style="font-style: italic;">Evolutionary Programming IV: Proceedings of the Fourth Annual Conference on Evolutionary Programming</span>, MIT Press: 289&#8211;305.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950889&pid=S1409-2433201300020000600028&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[29] Michalewicz, Z. (1995) &#8220;Genetic algorithms, numerical optimization, and constraints&#8221;, <span style="font-style: italic;">Proceedings of the 6th International Conference on Genetic Algorithms</span>: 151&#8211;158.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950890&pid=S1409-2433201300020000600029&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[30] Michalewicz, Z.; Janikow, C.Z. (1996) &#8220;Genocop: a genetic algorithm for numerical optimization problems with linear constraints&#8221;. <span style="font-style: italic;">Communications of the ACM - Electronic supplement to the December issue</span> 39, article 175.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950891&pid=S1409-2433201300020000600030&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[31] Michalewicz, Z.; Fogel, D.B. (1998) How to Solve it: <span style="font-style: italic;">Modern Heuristics</span>. Springer, New York.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950892&pid=S1409-2433201300020000600031&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[32] Michalewicz, Z.; Deb, K.; Schmidtz, M.; Stidsenx, T. (2000) &#8220;Testcase generator for nonlinear continuous parameter optimization techniques&#8221;, <span style="font-style: italic;">IEEE Transactions on Evolutionary Computation</span> 4: 197&#8211;215.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950893&pid=S1409-2433201300020000600032&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[33] Mora-Guti&eacute;rrez, R.; Ram&iacute;rez-Rodr&iacute;guez, J.; Rinc&oacute;n-Garc&iacute;a, E.(2012) &#8220; An optimization algorithm inspired by musical composition&#8221;, <span style="font-style: italic;">Artificial Intelligence Review</span>. Springer Netherlands: 1&#8211;15 .    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950894&pid=S1409-2433201300020000600033&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --> </font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[34] Mora-Guti&eacute;rrez, R.; Ram&iacute;rez-Rodr&iacute;guez, J.; Rinc&oacute;n-Garc&iacute;a, E.; Ponsich, A.; Herrera O. (2012) &#8220;An optimization algorithm inspired by social creativity systems&#8221;, <span style="font-style: italic;">Computing </span>94(11): 887&#8211;914.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950895&pid=S1409-2433201300020000600034&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[35] Mora-Guti&eacute;rrez, R. (2013) <span style="font-style: italic;">Dise&ntilde;o y desarrollo de un m&eacute;todo heur&iacute;stico basado en un sitema socio-cultural de creatividad para la resoluci&oacute;n de problemas de optimizaci&oacute;n continuos no lineales y dise&ntilde;os de zonas electorales.</span> Thesis Ph. D. Universidad Nacional Aut&oacute;noma de M&eacute;xico. Ciudad de Mexico.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950896&pid=S1409-2433201300020000600035&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[36] Ray, T.; Kang, T.; Chye, S.K. (2000) &#8220;An evolutionary algorithm for constrained optimization&#8221;, <span style="font-style: italic;">GECCO-00</span> : 771&#8211;777.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950897&pid=S1409-2433201300020000600036&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[37] Ray, T.; Liew, K.M. (2003) &#8220;Society and civilitation: an optimization algorithm based on the simulation of social behavior&#8221;. <span style="font-style: italic;">IEEE Transaction on evolutionary computation</span> 7: 386&#8211;396.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950898&pid=S1409-2433201300020000600037&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[38] Reynolds, R.G. (1994) &#8220;An introduction to cultural algorithms&#8221;. <span style="font-style: italic;">Proceedings of the 3rd Annual Conference on Evolutionary Programming</span>, World Scientific Publishing: 131&#8211;139.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950899&pid=S1409-2433201300020000600038&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></font><br  style="font-family: verdana;"> <br style="font-family: verdana;"> <font style="font-family: verdana;" size="2">[39] Tang, W.; Li, Y. (2008) &#8220;Constrained optimization using triple spaces cultured genetic algorithm&#8221;. <span style="font-style: italic;">International Conference on Natural Computation</span> 6: 589&#8211;593.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1950900&pid=S1409-2433201300020000600039&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font><br style="font-family: verdana;">     <br> <font style="font-family: verdana;" size="-1"><a name="Correspondencia1"></a><a  href="#Correspondencia2">*</a>Correspondencia a:    <br> </font><font style="font-family: verdana;" size="2">Roman Anselmo Mora-Guti&eacute;rrez. </font><font style="font-family: verdana;"  size="2">Departamento de Sistemas, Universidad Aut&oacute;noma Metropolitana - Azcapotzalco. Avenida San Pablo 180, Colonia Reynosa Tamaulipas, 02200 M&eacute;xico D. F. E-Mail: ing.romanmora@gmail.com</font>    <br> <font style="font-family: verdana;" size="2">Javier Ram&iacute;rez-Rodr&iacute;guez. </font><font  style="font-family: verdana;" size="2">Departamento de Sistemas, Universidad Aut&oacute;noma Metropolitana and LIA Universit&eacute; d&#8217;Avignon et des Pays de Vaucluse, same address that Mora, jararo@azc.uam.mx</font>    <br> <font style="font-family: verdana;" size="2">Eric Alfredo Rinc&oacute;n-Garc&iacute;a. </font><font style="font-family: verdana;"  size="2">Misma direcci&oacute;n que/Same address as: R.A. Mora, E-Mail: rigaeral@azc.uam.mx</font><font style="font-family: verdana;" size="2">     ]]></body>
<body><![CDATA[<br> Antonin Ponsich. </font><font style="font-family: verdana;" size="2">Misma direcci&oacute;n que/Same address as: R.A. Mora, E-Mail: aspo@azc.uam.mx</font>    <br> <font style="font-family: verdana;" size="2">Oscar Herrera-Alc&aacute;ntara. </font><font style="font-family: verdana;"  size="2">Misma direcci&oacute;n que/Same address as: R.A. Mora, E-Mail: oha@azc.uam.mx </font>    <br> <font style="font-family: verdana;" size="2">Pedro Lara-Vel&aacute;zquez. </font><font style="font-family: verdana;"  size="2">Misma direcci&oacute;n que/Same address as: R.A. Mora, E-Mail: pedro lara@azc.uam.mx    <br> </font><font style="font-family: verdana;" size="2"><a name="1"></a><a  href="#7">*</a>Departamento de Sistemas, Universidad Aut&oacute;noma Metropolitana - Azcapotzalco. Avenida San Pablo 180, Colonia Reynosa Tamaulipas, 02200 M&eacute;xico D. F. E-Mail: ing.romanmora@gmail.com</font><br  style="font-family: verdana;"> <font style="font-family: verdana;" size="2"><a name="2"></a><a  href="#8">&#8224;</a>Departamento de Sistemas, Universidad Aut&oacute;noma Metropolitana and LIA Universit&eacute; d&#8217;Avignon et des Pays de Vaucluse, same address that Mora, jararo@azc.uam.mx</font><br  style="font-family: verdana;"> <font style="font-family: verdana;" size="2"><a name="3"></a><a  href="#9">&#8225;</a>Misma direcci&oacute;n que/Same address as: R.A. Mora, E-Mail: rigaeral@azc.uam.mx</font><br style="font-family: verdana;"> <font style="font-family: verdana;" size="2"><a name="4"></a><a  href="#10">&sect;</a>Misma direcci&oacute;n que/Same address as: R.A. Mora, E-Mail: aspo@azc.uam.mx</font><br style="font-family: verdana;"> <font style="font-family: verdana;" size="2"><a name="5"></a><a  href="#11">&para;</a>Misma direcci&oacute;n que/Same address as: R.A. Mora, E-Mail: oha@azc.uam.mx </font><br style="font-family: verdana;"> <font style="font-family: verdana;" size="2"><a name="6"></a><a  href="#12">/</a>Misma direcci&oacute;n que/Same address as: R.A. Mora, E-Mail: pedro lara@azc.uam.mx</font><br style="font-family: verdana;"> <hr style="width: 100%; height: 2px;">     <div style="text-align: center; font-weight: bold;"><font  style="font-family: verdana;" size="2">Received: 14/Mar/2012; Revised: 22/May/2013; Accepted: 28/May/2013</font>    <br> </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[Biles]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;GenJam: A genetic algorithm for generating jazz solos&#8221;]]></source>
<year>1994</year>
<conf-name><![CDATA[ International Computer Music Conference]]></conf-name>
<conf-loc>Aarhus Aarhus</conf-loc>
<page-range>131-137</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bekrar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaabane]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Trentesaux]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Bornschlegell]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pellé]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Harmand]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Hybrid PSO-tabu search for constrained nonlinear optimization problems &#8221;]]></source>
<year>2011</year>
<conf-name><![CDATA[ICSI 2011 International Conference on Swarm Intelligence]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Multiobjective optimization based evolutionary algorithm for constrained optimization&#8221;]]></article-title>
<source><![CDATA[IEEE Transactions on evolutionary computation]]></source>
<year>2006</year>
<volume>10</volume>
<page-range>658-675</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chung]]></surname>
<given-names><![CDATA[C.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Reynolds]]></surname>
<given-names><![CDATA[R.G.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;A testbed for solving optimization problems using cultural algorithms&#8221;]]></source>
<year>1996</year>
<conf-name><![CDATA[ Proceedings of the Fifth Annual Conference on Evolutionary Programming]]></conf-name>
<conf-loc> </conf-loc>
<page-range>225-236</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C.A.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Becerra]]></surname>
<given-names><![CDATA[R.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Constrained optimization using an evolutionary programming-based cultural algorithm&#8221;: Adaptive Computing in Design and Manufacture V]]></source>
<year>2002</year>
<page-range>317-328</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C.A.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Becerra]]></surname>
<given-names><![CDATA[R.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Evolutionary multiobjective optimization using a cultural algorithm&#8221;]]></source>
<year>2003</year>
<conf-name><![CDATA[ Swarm Intelligence Symposium]]></conf-name>
<conf-loc> </conf-loc>
<page-range>6-13</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cope]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Algorithmic Composer]]></source>
<year>2000</year>
<publisher-loc><![CDATA[^eWisconsin Wisconsin]]></publisher-loc>
<publisher-name><![CDATA[A-R Editions Inc]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cope]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computer Model of Musical Creativity]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Cambridge^eMA MA]]></publisher-loc>
<publisher-name><![CDATA[MIT Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cruz Cortés]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Sistema Inmune Artificial para Solucionar Problemas de Optimización]]></source>
<year>2004</year>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[de Bono]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[El Pensamiento Lateral: Manual de Creatividad]]></source>
<year>1991</year>
<publisher-name><![CDATA[Espsa libros S.L.U]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><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="en"><![CDATA[&#8220;Ant system: optimization by a colony of cooperating agents&#8221;]]></article-title>
<source><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics]]></source>
<year>1996</year>
<volume>26</volume>
<page-range>29-41</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geem]]></surname>
<given-names><![CDATA[Z.W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Recent Advances in Harmony Search Algorithm]]></source>
<year>2009</year>
<publisher-loc><![CDATA[^eNew York New York]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geem]]></surname>
<given-names><![CDATA[Z.W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Music-Inspired Harmony Search Algorithm]]></source>
<year>2010</year>
<publisher-loc><![CDATA[^eNew York New York]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geem]]></surname>
<given-names><![CDATA[Z.W.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[J.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Loganathan]]></surname>
<given-names><![CDATA[G.V.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;A new heuristic optimization algorithm: harmony search&#8221;]]></article-title>
<source><![CDATA[Simulation]]></source>
<year>2001</year>
<volume>76</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>60-68</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gessler]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Evolving cultural things-that-think&#8221;: Computational Synthesis: From Basic Building Blocks to High Level Functionality]]></source>
<year>2003</year>
<page-range>75-81</page-range><publisher-name><![CDATA[Menlo ParkAAAI Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gould]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Orban]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Toint]]></surname>
<given-names><![CDATA[P.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;CUTTEr a Constrained and Unconstrained Testing Environment, revisited&#8221;]]></source>
<year>2001</year>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Horner]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Goldberg]]></surname>
<given-names><![CDATA[D.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Genetic algorithms and computer assisted music composition&#8221;]]></source>
<year>1991</year>
<page-range>479-482</page-range><publisher-loc><![CDATA[^eSan Francisco San Francisco]]></publisher-loc>
<publisher-name><![CDATA[International Computer Music Association]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Eberhart]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Solving constrained nonlinear optimization problems with particle swarm optimization&#8221;]]></source>
<year>2002</year>
<conf-name><![CDATA[6th World Multiconference on Systemics]]></conf-name>
<conf-loc> </conf-loc>
<page-range>203-206</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jacob]]></surname>
<given-names><![CDATA[B.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Algorithmic composition as a model of creativity&#8221;]]></source>
<year>1996</year>
<page-range>157-165</page-range><publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jacob]]></surname>
<given-names><![CDATA[B.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Composing with genetic algorithms&#8221;]]></source>
<year>1995</year>
<page-range>452-455</page-range><publisher-name><![CDATA[International Computer Music Association]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jin]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Reynolds]]></surname>
<given-names><![CDATA[R.G.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Using knowledge based evolutionary computation to solve nonlinear constraint optimization problems: a cultural algorithm approach&#8221;]]></source>
<year>1999</year>
<volume>3</volume>
<page-range>1678</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kennedy]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Eberhart]]></surname>
<given-names><![CDATA[R.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Particle swarm optimization&#8221;]]></source>
<year>1995</year>
<conf-name><![CDATA[ International Conference Neuronal Networks]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1942-1948</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koziel]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization&#8221;]]></article-title>
<source><![CDATA[Evolutionary Computation]]></source>
<year>1999</year>
<volume>7</volume>
<page-range>19-44</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Landa Becerra]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello Coello]]></surname>
<given-names><![CDATA[C.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Optimization with constraints using a cultured differential evolution approach&#8221;]]></source>
<year>2005</year>
<conf-name><![CDATA[ Proceedings of the GECCO Conference]]></conf-name>
<conf-loc> </conf-loc>
<page-range>34-35</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[K.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Geem]]></surname>
<given-names><![CDATA[Z.W.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;A new structural optimizationmethod based on the harmony search algorithm&#8221;]]></article-title>
<source><![CDATA[Computers & Structures]]></source>
<year>2004</year>
<volume>82</volume>
<page-range>781-798</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leyffer]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahajan]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cochran]]></surname>
<given-names><![CDATA[J.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cox]]></surname>
<given-names><![CDATA[L.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Keskinocak]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kharoufeh]]></surname>
<given-names><![CDATA[J.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[J.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Software for Nonlinearly Constrained Optimization]]></source>
<year>2010</year>
<publisher-loc><![CDATA[^eNew York New York]]></publisher-loc>
<publisher-name><![CDATA[John Wiley & Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y.T.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Creativity or novelty?:: -computational versus social-cultural&#8221;]]></article-title>
<source><![CDATA[Design Studies]]></source>
<year>2000</year>
<page-range>261-276</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[McDonnell]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Reynolds]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Fogel]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Using cultural algorithms for constraint handling in GENOCOP&#8221;]]></source>
<year>1995</year>
<conf-name><![CDATA[IV Proceedings of the Fourth Annual Conference on Evolutionary Programming]]></conf-name>
<conf-loc> </conf-loc>
<page-range>289-305</page-range><publisher-name><![CDATA[MIT Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Genetic algorithms, numerical optimization, and constraints&#8221;]]></source>
<year>1995</year>
</nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Janikow]]></surname>
<given-names><![CDATA[C.Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Genocop: a genetic algorithm for numerical optimization problems with linear constraints&#8221;]]></article-title>
<source><![CDATA[Communications of the ACM]]></source>
<year>1996</year>
<volume>39</volume>
<numero>175</numero>
<issue>175</issue>
</nlm-citation>
</ref>
<ref id="B31">
<label>31</label><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>1998</year>
<publisher-loc><![CDATA[^eNew York New York]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Schmidtz]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Stidsenx]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Testcase generator for nonlinear continuous parameter optimization techniques&#8221;]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2000</year>
<volume>4</volume>
<page-range>197-215</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220; An optimization algorithm inspired by musical composition&#8221;]]></source>
<year>2012</year>
<page-range>1-15</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ponsich]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;An optimization algorithm inspired by social creativity systems&#8221;]]></article-title>
<source><![CDATA[Computing]]></source>
<year>2012</year>
<volume>94</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>887-914</page-range></nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Diseño y desarrollo de un método heurístico basado en un sitema socio-cultural de creatividad para la resolución de problemas de optimización continuos no lineales y diseños de zonas electorales]]></source>
<year>2013</year>
</nlm-citation>
</ref>
<ref id="B36">
<label>36</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ray]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Kang]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Chye]]></surname>
<given-names><![CDATA[S.K.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;An evolutionary algorithm for constrained optimization&#8221;]]></article-title>
<source><![CDATA[GECCO-00]]></source>
<year>2000</year>
<page-range>771-777</page-range></nlm-citation>
</ref>
<ref id="B37">
<label>37</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ray]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Liew]]></surname>
<given-names><![CDATA[K.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Society and civilitation: an optimization algorithm based on the simulation of social behavior&#8221;]]></article-title>
<source><![CDATA[IEEE Transaction on evolutionary computation]]></source>
<year>2003</year>
<volume>7</volume>
<page-range>386-396</page-range></nlm-citation>
</ref>
<ref id="B38">
<label>38</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reynolds]]></surname>
<given-names><![CDATA[R.G.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;An introduction to cultural algorithms&#8221;]]></source>
<year>1994</year>
<conf-name><![CDATA[ Proceedings of the 3rd Annual Conference on Evolutionary Programming]]></conf-name>
<conf-loc> </conf-loc>
<page-range>131-139</page-range><publisher-name><![CDATA[World Scientific Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B39">
<label>39</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[&#8220;Constrained optimization using triple spaces cultured genetic algorithm&#8221;]]></article-title>
<source><![CDATA[International Conference on Natural Computation]]></source>
<year>2008</year>
<volume>6</volume>
<page-range>589-593</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
