<?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-55462018000200639</article-id>
<article-id pub-id-type="doi">10.13053/cys-22-2-2557</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Hybrid Approach for Solving Dynamic Bi-level Optimization Problems]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Samaniego]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Novoa-Hernández]]></surname>
<given-names><![CDATA[Pavel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
<xref ref-type="aff" rid="Aaf"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Técnica Estatal de Quevedo  ]]></institution>
<addr-line><![CDATA[Los Ríos ]]></addr-line>
<country>Ecuador</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Estatal de Milagro  ]]></institution>
<addr-line><![CDATA[Guayas ]]></addr-line>
<country>Ecuador</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2018</year>
</pub-date>
<volume>22</volume>
<numero>2</numero>
<fpage>639</fpage>
<lpage>656</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462018000200639&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-55462018000200639&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-55462018000200639&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Several real-life decision scenarios are hierarchical, which are commonly modeled as bi-level optimization problems (BOPs). As other decision scenarios, these problems can be dynamic, that is, some elements of their mathematical model can change over time. This kind of uncertainty imposes an extra level of complexity on the model, since the algorithm needs to find the best bi-level solution over time. Despite the importance of studying these problems, the literature reflects just a few works on dynamic bi-level optimization problems (DBOPs). In this context, this work addresses the solution of DBOPs from the viewpoint of metaheuristic methods. Our hypothesis is that, by hybridizing successful solving approaches from both bi-level and dynamic optimization fields, an effective method for DBOPs can be obtained. In this regard, we propose a hybrid method that combines a coevolutionary approach and a self-adaptive, multipopulation algorithm. Experimental results assert our hypothesis, specially for certain information exchange mechanisms.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Dynamic Bi-level Optimization]]></kwd>
<kwd lng="en"><![CDATA[Coevolutionary algorithms]]></kwd>
<kwd lng="en"><![CDATA[Differential Evolution]]></kwd>
<kwd lng="en"><![CDATA[Self-adaptation]]></kwd>
<kwd lng="en"><![CDATA[Hybrid metaheuristics]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alba]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Nakib]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Siarry]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristics for Dynamic Optimization]]></source>
<year>2013</year>
<volume>433</volume>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blackwell]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Branke]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multiswarms, exclusion, and anti-convergence in dynamic environments]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2006</year>
<volume>10</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>459-72</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boussa¨&#305;d]]></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>
<article-title xml:lang=""><![CDATA[A survey on optimization metaheuristics]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2013</year>
<volume>237</volume>
<numero>0</numero>
<issue>0</issue>
<page-range>82-117</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Branke]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Memory enhanced evolutionary algorithms for changing optimization problems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Angeline]]></surname>
<given-names><![CDATA[P. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Schoenauer]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Yao]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Zalzala]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proceedings of the Congress on Evolutionary Computation]]></source>
<year>1999</year>
<volume>3</volume>
<page-range>1875-82</page-range><publisher-name><![CDATA[IEEE Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Camacho-Vallejo]]></surname>
<given-names><![CDATA[J.-F.]]></given-names>
</name>
<name>
<surname><![CDATA[González-Rodríguez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Almaguer]]></surname>
<given-names><![CDATA[F.-J.]]></given-names>
</name>
<name>
<surname><![CDATA[González-Ramírez]]></surname>
<given-names><![CDATA[R. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A bi-level optimization model for aid distribution after the occurrence of a disaster]]></article-title>
<source><![CDATA[Journal of Cleaner Production]]></source>
<year>2015</year>
<volume>105</volume>
<page-range>134-45</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic portfolio optimization under multifactor model in stochastic markets]]></article-title>
<source><![CDATA[OR Spectrum]]></source>
<year>2012</year>
<volume>34</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>885-919</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Colson]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Marcotte]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Savard]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bilevel programming: A survey]]></article-title>
<source><![CDATA[4OR]]></source>
<year>2005</year>
<volume>3</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>87-107</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cruz]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pelta]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimization in dynamic environments: a survey on problems, methods and measures]]></article-title>
<source><![CDATA[Soft Computing]]></source>
<year>2011</year>
<volume>15</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>1427-48</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[du Plessis]]></surname>
<given-names><![CDATA[M. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Engelbrecht]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Using competitive population evaluation in a differential evolution algorithm for dynamic environments]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2012</year>
<volume>218</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>7-20</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Molina]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Lozano]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A study on the use of non-parametric tests for analyzing the evolutionary algorithms&#8217; behaviour: a case study on the cec&#8217;2005 special session on real parameter optimization]]></article-title>
<source><![CDATA[J Heuristics]]></source>
<year>2009</year>
<volume>15</volume>
<page-range>617-44</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hansen]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Jaumard]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Savard]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[New branch-and-bound rules for linear bilevel pro-gramming]]></article-title>
<source><![CDATA[SIAM Journal on Scientific and Statistical Computing]]></source>
<year>1992</year>
<volume>13</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1194-217</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jeroslow]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The polynomial hierarchy and a simple model for competitive analysis]]></article-title>
<source><![CDATA[Mathematical Programming]]></source>
<year>1985</year>
<volume>32</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>146-64</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jin]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Branke]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionary optimization in uncertain environments-a survey]]></article-title>
<source><![CDATA[Evolutionary Computation, IEEE Transactions on]]></source>
<year>2005</year>
<volume>9</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>303-17</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kocvara]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Outrata]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Effective reformulations of the truss topology design problem]]></article-title>
<source><![CDATA[Optimization and Engineering]]></source>
<year>2006</year>
<volume>7</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>201-19</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[Legillon]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Liefooghe]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E.-G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Cobra: A coevolutionary metaheuristic for bi-level optimization]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E.-G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristics for Bi-level Optimization]]></source>
<year>2013</year>
<volume>482</volume>
<page-range>95-114</page-range><publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Nguyen]]></surname>
<given-names><![CDATA[T. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Zeng]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multi-population methods in unconstrained continuous dynamic environments: The challenges]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2015</year>
<volume>296</volume>
<numero>0</numero>
<issue>0</issue>
<page-range>95-118</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Nguyen]]></surname>
<given-names><![CDATA[T. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[E. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Yao]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Jin]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Beyer]]></surname>
<given-names><![CDATA[H.-G.]]></given-names>
</name>
<name>
<surname><![CDATA[Suganthan]]></surname>
<given-names><![CDATA[P. N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Benchmark generator for cec&#8217;2009 competition on dynamic optimization]]></source>
<year>2008</year>
<publisher-loc><![CDATA[U.K. ]]></publisher-loc>
<publisher-name><![CDATA[Department of Computer Science, University of Leicester]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Linnala]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Madetoja]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruotsalainen]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Hämäläinen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bi-level optimization for a dynamic multiobjective problem]]></article-title>
<source><![CDATA[Engineering Optimization]]></source>
<year>2012</year>
<volume>44</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>195-207</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[Marinakis]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Marinaki]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A bilevel particle swarm optimization algorithm for supply chain management problems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E.-G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristics for Bi-level Optimization]]></source>
<year>2013</year>
<volume>482</volume>
<page-range>69-93</page-range><publisher-name><![CDATA[Springer Berlin Heidelberg]]></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[Meyer-Nieberg]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Beyer]]></surname>
<given-names><![CDATA[H.-G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Self-adaptation in evolutionary algorithms]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Lobo]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Lima]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Parameter Setting in Evolutionary Algorithms]]></source>
<year>2007</year>
<volume>54</volume>
<page-range>19-46</page-range><publisher-name><![CDATA[Springer Berlin / Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nguyen]]></surname>
<given-names><![CDATA[T. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Branke]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionary dynamic optimization: A survey of the state of the art]]></article-title>
<source><![CDATA[Swarm and Evolutionary Computation]]></source>
<year>2012</year>
<volume>6</volume>
<numero>0</numero>
<issue>0</issue>
<page-range>1-24</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Novoa-Hernández]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Corona]]></surname>
<given-names><![CDATA[C. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Pelta]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Self-adaptive, multipopulation differential evolution in dynamic environments]]></article-title>
<source><![CDATA[Soft Computing]]></source>
<year>2013</year>
<volume>17</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>1861-81</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[Novoa-Hernández]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Corona]]></surname>
<given-names><![CDATA[C. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Pelta]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A software tool for assisting experimentation in dynamic environments]]></article-title>
<source><![CDATA[Applied Computational Intelligence and Soft Computing]]></source>
<year>2015</year>
<volume>2015</volume>
<page-range>1-12</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Novoa-Hernández]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Corona]]></surname>
<given-names><![CDATA[C. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Pelta]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Self-adaptation in dynamic environments - a survey and open issues]]></article-title>
<source><![CDATA[International Journal of Bio-Inspired Computation]]></source>
<year>2016</year>
<volume>8</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-13</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Oduguwa]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Roy]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bi-level optimisation using genetic algorithm]]></source>
<year>2002</year>
<conf-name><![CDATA[ Artificial Intelligence Systems, 2002. (ICAIS 2002). 2002 IEEE International Conference on]]></conf-name>
<conf-loc> </conf-loc>
<page-range>322-7</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sinha]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Malo]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Test problem construction for single objective bilevel optimization]]></article-title>
<source><![CDATA[Evolutionary Computation Journal]]></source>
<year>2014</year>
</nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sinha]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Malo]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Frantsev]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Finding optimal strategies in a multi-period multi-leader-follower stackelberg game using an evolutionary algorithm]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2014</year>
<volume>41</volume>
<numero>0</numero>
<issue>0</issue>
<page-range>374-85</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="journal">
<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>
<article-title xml:lang=""><![CDATA[Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces]]></article-title>
<source><![CDATA[Journal of Global Optimization]]></source>
<year>1997</year>
<volume>11</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>341-59</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Benekohal]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Waller]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bi-level programming formulation and heuristic solution approach for dynamic traffic signal optimization]]></article-title>
<source><![CDATA[Computer-Aided Civil and Infrastructure Engineering]]></source>
<year>2006</year>
<volume>21</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>321-33</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E.-G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A taxonomy of metaheuristics for bi-level optimization]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E.-G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristics for Bi-level Optimization]]></source>
<year>2013</year>
<volume>482</volume>
<page-range>1-39</page-range><publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
