<?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-55462016000200173</article-id>
<article-id pub-id-type="doi">10.13053/cys-20-2-2334</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Self-Adaptive Differential Evolution Hyper-Heuristic with Applications in Process Design]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Peraza-Vázquez]]></surname>
<given-names><![CDATA[Hernán]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Torres-Huerta]]></surname>
<given-names><![CDATA[Aidé M.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Flores-Vela]]></surname>
<given-names><![CDATA[Abelardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Politécnico Nacional CICATA ]]></institution>
<addr-line><![CDATA[ Tamaulipas]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Instituto Politécnico Nacional CMP ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<volume>20</volume>
<numero>2</numero>
<fpage>173</fpage>
<lpage>193</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462016000200173&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-55462016000200173&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-55462016000200173&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract. The paper presents a differential evolution (DE)-based hyper-heuristic algorithm suitable for the optimization of mixed-integer non-linear programming (MINLP) problems. The hyper-heuristic framework includes self-adaptive parameters, an &#949;-constrained method for handling constraints, and 18 DE variants as low-level heuristics. Using the proposed approach, we solved a set of classical test problems on process synthesis and design and compared the results with those of several state-of-the-art evolutionary algorithms. To verify the consistency of the proposed approach, the above-mentioned comparison was made with respect to the percentage of convergences to the global optimum (NRC) and the average number of objective function evaluations (NFE) over several trials. Thus, we found that the proposed methodology significantly improves performance in terms of NRC and NFE.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Processes synthesis]]></kwd>
<kwd lng="en"><![CDATA[mixed-integer nonlinear programming (MINLP) problems]]></kwd>
<kwd lng="en"><![CDATA[differential evolution (DE)]]></kwd>
<kwd lng="en"><![CDATA[hyper-heuristics]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Optimization of process synthesis and design problems: A modified differential evolution approach.]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Angira]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Babu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Chemical Engineering Science]]></source>
<year>2006</year>
<volume>61</volume>
<numero>14</numero>
<issue>14</issue>
<page-range>4707-21</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Modified differential evolution (MDE) for optimization of non-linear chemical processes]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Babu]]></surname>
<given-names><![CDATA[B.V.]]></given-names>
</name>
<name>
<surname><![CDATA[Angira]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Chemical Engineering]]></source>
<year>2006</year>
<volume>30</volume>
<numero>6-7</numero>
<issue>6-7</issue>
<page-range>989-1002</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A survey on optimization metaheuristics]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boussad]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Lepagnot]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Siarry]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Inf. Sci.]]></source>
<year>2013</year>
<volume>237</volume>
<page-range>82-117</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brest]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Boskovic]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Zamuda]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Fister]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Maucec]]></surname>
<given-names><![CDATA[M.S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Self-adaptive differential evolution algorithm with a small and varying population size]]></source>
<year>2012</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brest]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zamuda]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Boskovic]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Adaptation in the Differential Evolution]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Fister Jr.]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<source><![CDATA[Adaptation and Hybridization, in computational Intelligence]]></source>
<year>2015</year>
<volume>18</volume>
<page-range>55-68</page-range><publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bujok]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Tvrdik]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Polakova]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Differential evolution with rotation-invariantmutation and competing-strategies adaptation]]></source>
<year>2014</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>2253-8</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Hyper-heuristics: a survey of the state of the art]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Gendreau]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hyde]]></surname>
<given-names><![CDATA[M.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kendall]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Ochoa]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[O. zcan]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[JORS]]></source>
<year>2013</year>
<volume>64</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1695-724</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hyde]]></surname>
<given-names><![CDATA[M.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kendall]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Woodward]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Trans. Evolutionary Computation]]></source>
<year>2010</year>
<volume>14</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>942-58</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A simulated annealing approach to the solution of MINLP problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cardoso]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Salcedo]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[de Azevedo]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Barbosa]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Chemical Engineering]]></source>
<year>1997</year>
<volume>21</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1349-64</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Costa]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Oliveira]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Chemical Engineering]]></source>
<year>2001</year>
<volume>25</volume>
<numero>2-3</numero>
<issue>2-3</issue>
<page-range>257-66</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Efficient handling of the implicit constraints problem for the ASPEN MINLP synthesizer]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diwekar]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Rubin]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Industrial &amp; engineering chemistry research]]></source>
<year>1993</year>
<volume>32</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>2006-11</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An MINLP process synthesizer for a sequential modular simulator]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diwekar]]></surname>
<given-names><![CDATA[U.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Grossmann]]></surname>
<given-names><![CDATA[I.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Rubin]]></surname>
<given-names><![CDATA[E.S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Industrial &amp; engineering chemistry research]]></source>
<year>1992</year>
<volume>31</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>313-22</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Enhancing Differential Evolution Utilizing Proximity-Based Mutation Operators]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Epitropakis]]></surname>
<given-names><![CDATA[M.G.]]></given-names>
</name>
<name>
<surname><![CDATA[Tasoulis]]></surname>
<given-names><![CDATA[D.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Pavlidis]]></surname>
<given-names><![CDATA[N.G.]]></given-names>
</name>
<name>
<surname><![CDATA[Plagianakos]]></surname>
<given-names><![CDATA[V.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Vrahatis]]></surname>
<given-names><![CDATA[M.N.]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Trans. Evolutionary Computation]]></source>
<year>2011</year>
<volume>15</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>99-119</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Global optimum search for nonconvex NLP and MINLP problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Floudas]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Aggarwal]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ciric]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Chemical Engineering]]></source>
<year>1989</year>
<volume>13</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>1117-32</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Floudas]]></surname>
<given-names><![CDATA[C.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications]]></source>
<year>1995</year>
<publisher-name><![CDATA[Oxford University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goncalves]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kuk]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Almeida]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Venske]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[MOEA/D-HH: A Hyper-Heuristic for Multi-objective Problems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Gaspar-Cunha]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Henggeler Antunes]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Evolutionary Multi-Criterion Optimization]]></source>
<year>2015</year>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Optimum design of multipurpose chemical plants]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Grossmann]]></surname>
<given-names><![CDATA[I.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Sargent]]></surname>
<given-names><![CDATA[R.W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Industrial &amp; Engineering Chemistry Process Design and Development]]></source>
<year>1979</year>
<volume>18</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>343-8</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Enhancing Differential Evolution Utilizing Eigenvector-Based Crossover Operator]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guo]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2014</year>
<volume>19</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>31-49</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Bao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Xiong]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Partial opposition-based adaptive differential evolution algorithms: Evaluation on the CEC 2014 benchmark set for real-parameter optimization]]></source>
<year>2014</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>2259-65</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[V.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Qin]]></surname>
<given-names><![CDATA[A.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Suganthan]]></surname>
<given-names><![CDATA[P.N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Self-adaptive Differential Evolution Algorithm for Constrained Real-Parameter Optimization]]></source>
<year>2006</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>17-24</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kocis]]></surname>
<given-names><![CDATA[G.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Grossmann]]></surname>
<given-names><![CDATA[I.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Industrial &amp; engineering chemistry research]]></source>
<year>1988</year>
<volume>27</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>1407-21</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A modelling and decomposition strategy for the MINLP optimization of process flowsheets]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kocis]]></surname>
<given-names><![CDATA[G.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Grossmann]]></surname>
<given-names><![CDATA[I.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Chemical Engineering]]></source>
<year>1989</year>
<volume>13</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>797-819</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lampinen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multi-Constrained Nonlinear Optimization by the Differential Evolution Algorithm]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Roy]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Koppen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ovaska]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Furuhashi]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Hoffmann]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing and Industry]]></source>
<year>2002</year>
<page-range>305-18</page-range><publisher-name><![CDATA[Springer London]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mallipeddi]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Suganthan]]></surname>
<given-names><![CDATA[P.N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems]]></source>
<year>2010</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Marshall]]></surname>
<given-names><![CDATA[R.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Johnston]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Hyper-heuristics, Grammatical Evolution and the Capacitated Vehicle Routing Problem]]></source>
<year>2014</year>
<conf-name><![CDATA[ Conference Companion on Genetic and Evolutionary Computation Companion (GECCO)]]></conf-name>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>71-2</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Constraint handling in nature inspired numerical optimization: Past, present and future]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C.A.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Swarm and Evolutionary Computation]]></source>
<year>2011</year>
<volume>1</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>173-94</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Munawar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Wahib]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Munetomo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Akama]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advanced genetic algorithm to solve MINLP problems over GPU]]></source>
<year>2011</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>318-25</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ortiz-Bayliss]]></surname>
<given-names><![CDATA[J.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Terashima-Marin]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Ozcan]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Parkes]]></surname>
<given-names><![CDATA[A.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the idea of evolving decision matrix hyper-heuristics for solving constraint satisfaction problems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Krasnogor]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Lanzi]]></surname>
<given-names><![CDATA[P.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[GECCO]]></source>
<year>2011</year>
<page-range>255-6</page-range><publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A study of evolutionary algorithm selection hyper-heuristics for the one-dimensional bin-packing problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pillay]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[South African Computer Journal]]></source>
<year>2012</year>
<volume>48</volume>
<page-range>31-40</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Evolving hyper-heuristics for the uncapacitated examination timetabling problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pillay]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[JORS]]></source>
<year>2012</year>
<volume>63</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>47-58</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Differential Evolution Algorithm with Strategy Adaptation for Global Numerical Optimization]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Qin]]></surname>
<given-names><![CDATA[A.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[V.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Suganthan]]></surname>
<given-names><![CDATA[P.N.]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Trans. Evolutionary Computation]]></source>
<year>2009</year>
<volume>13</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>398-417</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Qin]]></surname>
<given-names><![CDATA[A.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Suganthan]]></surname>
<given-names><![CDATA[P.N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Self-adaptive differential evolution algorithm for numerical optimization]]></source>
<year>2005</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1785-91</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An active specification switching strategy that aids in solving nonlinear sets and improves a VNS/TA hybrid optimization methodology]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Robertson]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Geraili]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Kelley]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Romagnoli]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Chemical Engineering]]></source>
<year>2014</year>
<volume>60</volume>
<page-range>364-75</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Global optimization of nonconvex NLPs and MINLPs with applications in process design]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ryoo]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Sahinidis]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Chemical Engineering]]></source>
<year>1995</year>
<volume>19</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>551-66</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Solving nonconvex nonlinear programming and mixed-integer nonlinear programming problems with adaptive random search]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Salcedo]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Industrial &amp; engineering chemistry research]]></source>
<year>1992</year>
<volume>31</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>262-73</page-range></nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Extended ant colony optimization for nonconvex mixed integer nonlinear programming]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schluter]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Egea]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Banga]]></surname>
<given-names><![CDATA[J.R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; OR]]></source>
<year>2009</year>
<volume>36</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>2217-29</page-range></nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Storn]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Price]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Differential Evolution-A simple and efficient adaptive scheme for global optimization over continuous spaces]]></source>
<year>1995</year>
</nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Storn]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Price]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Minimizing the Real Functions of the ICEC'96 Contest by Differential Evolution]]></source>
<year>1996</year>
<conf-name><![CDATA[ International Conference on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>842-4</page-range></nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Takahama]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Sakai]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient Constrained Optimization by the Constrained Rank-Based Differential Evolution]]></source>
<year>2012</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Takahama]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Sakai]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient constrained optimization by the constrained differential evolution with rough approximation using kernel regression]]></source>
<year>2013</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1334-41</page-range></nlm-citation>
</ref>
<ref id="B41">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Takahama]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Sakai]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Iwane]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Constrained Optimization by the epsilon Constrained Hybrid Algorithm of Particle Swarm Optimization and Genetic Algorithm]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Jarvis]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Australian Conference on Artificial Intelligence]]></source>
<year>2005</year>
<volume>3809</volume>
<page-range>389-400</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B42">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tanabe]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Fukunaga]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Evaluating the performance of SHADE on CEC 2013 benchmark problems]]></source>
<year>2013</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1952-9</page-range></nlm-citation>
</ref>
<ref id="B43">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tinoco]]></surname>
<given-names><![CDATA[J.C.V.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C.A.C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[hypDE: A Hyper-Heuristic Based on Differential Evolution for Solving Constrained Optimization Problems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Schutze]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C.A.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Tantar]]></surname>
<given-names><![CDATA[A.-A.]]></given-names>
</name>
<name>
<surname><![CDATA[Tantar]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Bouvry]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Moral]]></surname>
<given-names><![CDATA[P.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Legrand]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[EVOLVE]]></source>
<year>2012</year>
<volume>175</volume>
<page-range>267-82</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B44">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[No Free Lunch Theorems for Optimization]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wolpert]]></surname>
<given-names><![CDATA[D.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Macready]]></surname>
<given-names><![CDATA[W.G.]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>1997</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>67-82</page-range></nlm-citation>
</ref>
<ref id="B45">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Yao]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[Self-adaptive differential evolution with neighborhood search]]></source>
<year>2008</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1110-6</page-range></nlm-citation>
</ref>
<ref id="B46">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Yao]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[He]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Siarry]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Metaheuristics for Hard Optimization]]></source>
<year>2008</year>
<page-range>397-414</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B47">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An improved PSO algorithm for solving nonconvex NLP/MINLP problems with equality constraints]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yiqing]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Xigang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Yongjian]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Chemical Engineering]]></source>
<year>2007</year>
<volume>31</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>153-62</page-range></nlm-citation>
</ref>
<ref id="B48">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An effective co-evolutionary differential evolution for constrained optimization]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[He]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
</person-group>
<source><![CDATA[Applied Mathematics and Computation]]></source>
<year>2007</year>
<volume>186</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>340-56</page-range></nlm-citation>
</ref>
<ref id="B49">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tvrdik]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Adaptive differential evolution and exponential crossover]]></source>
<year>2008</year>
<conf-name><![CDATA[ International Multiconference on Computer Science and Information Technology (IMCSIT)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>927-31</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
