<?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-55462018000200347</article-id>
<article-id pub-id-type="doi">10.13053/cys-22-2-2951</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Memetic Algorithm with Hungarian Matching Based Crossover and Diversity Preservation]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Romero Ruiz]]></surname>
<given-names><![CDATA[Emmanuel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Segura]]></surname>
<given-names><![CDATA[Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de Guanajuato  ]]></institution>
<addr-line><![CDATA[Guanajuato ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Centro de Investigación en Matemáticas Área de Computación ]]></institution>
<addr-line><![CDATA[Guanajuato ]]></addr-line>
<country>Mexico</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>347</fpage>
<lpage>361</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462018000200347&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-55462018000200347&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-55462018000200347&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: The Graph Partitioning Problem (GPP) is a well-known NP-hard combinatorial problem that involves the finding of a partition of vertexes that minimizes the number of cut edges while fulfilling a set of constraints. This paper presents a newly designed optimizer for the GPP: the Memetic Algorithm with Hungarian Matching Based Crossover and Diversity Preservation (MAHMBCDP). MAHMBCDP is a population-based scheme that incorporates an explicit mechanism to control the diversity with the aim of making a proper use of resources when dealing with long-term executions. Among the novelties of our proposal, the design of a crossover operator that is based on the Hungarian Algorithm to calculate a maximum matching is particularly important. Experimental validation with a set of well-known instances of the graph partitioning archive shows the proper performance of our proposal. In fact, new best-known solutions could be attained in ten test cases.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Graph partitioning problem]]></kwd>
<kwd lng="en"><![CDATA[memetic algorithm]]></kwd>
<kwd lng="en"><![CDATA[diversity preservation]]></kwd>
<kwd lng="en"><![CDATA[maximum matching]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aardal]]></surname>
<given-names><![CDATA[K. I.]]></given-names>
</name>
<name>
<surname><![CDATA[van Hoesel]]></surname>
<given-names><![CDATA[S. P. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Koster]]></surname>
<given-names><![CDATA[A. M. C. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mannino]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Sassano]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Models and solution techniques for frequency assignment problems]]></article-title>
<source><![CDATA[Annals of Operations Research]]></source>
<year>2007</year>
<volume>153</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>79-129</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bader]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Meyerhenke]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Sanders]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Wagner]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[10th DIMACS Implementation Challenge Workshop on Graph Partitioning and Graph Clustering Proceedings]]></source>
<year>2013</year>
<volume>588</volume>
<publisher-loc><![CDATA[Atlanta, GA, USA ]]></publisher-loc>
<publisher-name><![CDATA[American Mathematical Society]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bichot]]></surname>
<given-names><![CDATA[C.-E]]></given-names>
</name>
</person-group>
<source><![CDATA[Local Metaheuristics and Graph Partitioning]]></source>
<year>2013</year>
<page-range>137-61</page-range><publisher-name><![CDATA[John Wiley &amp; Sons, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bichot]]></surname>
<given-names><![CDATA[C.-E]]></given-names>
</name>
</person-group>
<source><![CDATA[Population-Based Metaheuristics, Fusion-Fission and Graph Partitioning Optimization]]></source>
<year>2013</year>
<page-range>163-99</page-range><publisher-name><![CDATA[John Wiley &amp; Sons, Inc.]]></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[Bui]]></surname>
<given-names><![CDATA[T. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Moon]]></surname>
<given-names><![CDATA[B. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic algorithm and graph partitioning]]></article-title>
<source><![CDATA[IEEE Transactions on Computers]]></source>
<year>1996</year>
<volume>45</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>841-55</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[Chardaire]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Barake]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[McKeown]]></surname>
<given-names><![CDATA[G. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A probe-based heuristic for graph partitioning]]></article-title>
<source><![CDATA[IEEE Transactions on Computers]]></source>
<year>2007</year>
<volume>56</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1707-20</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[Eiben]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Evolutionary Computing]]></source>
<year>2003</year>
<publisher-loc><![CDATA[Springer ]]></publisher-loc>
<publisher-name><![CDATA[Natural Computing Series]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Galinier]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Boujbel]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[CoutinhoFernandes]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient memetic algorithm for the graph partitioning problem]]></article-title>
<source><![CDATA[Annals of Operations Research]]></source>
<year>2011</year>
<volume>191</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-22</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[Galinier]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.-K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybrid evolutionary algorithms for graph coloring]]></article-title>
<source><![CDATA[Journal of Combinatorial Optimization]]></source>
<year>1999</year>
<volume>3</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>379-97</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garey]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Johnson]]></surname>
<given-names><![CDATA[D. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers and Intractability; A Guide to the Theory of NP-Completeness]]></source>
<year>1990</year>
<publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[W. H. Freeman &amp; Co.]]></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[Hager]]></surname>
<given-names><![CDATA[W. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Phan]]></surname>
<given-names><![CDATA[D. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An exact algorithm for graph partitioning]]></article-title>
<source><![CDATA[Mathematical Programming]]></source>
<year>2013</year>
<volume>137</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>531-56</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Harik]]></surname>
<given-names><![CDATA[G. R]]></given-names>
</name>
</person-group>
<source><![CDATA[Finding multimodal solutions using restricted tournament selection]]></source>
<year>1995</year>
<conf-name><![CDATA[ 6th International Conference on Genetic Algorithms]]></conf-name>
<conf-loc>San Francisco, CA, USA </conf-loc>
<page-range>24-31</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hendrickson]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Leland]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Karypis]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Barnard]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Simon]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[The graph partitioning archive]]></source>
<year>2017</year>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kahng]]></surname>
<given-names><![CDATA[A. B.]]></given-names>
</name>
<name>
<surname><![CDATA[Lienig]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Markov]]></surname>
<given-names><![CDATA[I. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[VLSI Physical Design: From Graph Partitioning to Timing Closure]]></source>
<year>2011</year>
<publisher-name><![CDATA[Springer Publishing Company]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kernighan]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An Efficient Heuristic Procedure for Partitioning Graphs]]></article-title>
<source><![CDATA[The Bell Systems Technical Journal]]></source>
<year>1970</year>
<volume>49</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>291-307</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lobo]]></surname>
<given-names><![CDATA[F. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Lima]]></surname>
<given-names><![CDATA[C. F.]]></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>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Maini]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Mehrotra]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Mohan]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Ranka]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic algorithms for graph partitioning and incremental graph partitioning]]></article-title>
<source><![CDATA[Proceedings of Supercomputing &#8217;94]]></source>
<year>1994</year>
<page-range>449-57</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mengshoel]]></surname>
<given-names><![CDATA[O. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Goldberg]]></surname>
<given-names><![CDATA[D. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The crowding approach to niching in genetic algorithms]]></article-title>
<source><![CDATA[Evol. Comput.]]></source>
<year>2008</year>
<volume>16</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>315-54</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Merz]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Freisleben]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Memetic algorithms and the fitness landscape of the graph bi-partitioning problem]]></source>
<year>1998</year>
<conf-name><![CDATA[ 5th International Conference on Parallel Problem Solving from Nature - PPSN]]></conf-name>
<conf-loc> </conf-loc>
<page-range>765-74</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pandey]]></surname>
<given-names><![CDATA[H. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaudhary]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mehrotra]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A comparative review of approaches to prevent premature convergence in GA]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2014</year>
<volume>24</volume>
<page-range>1047-77</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Petrowski]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[A clearing procedure as a niching method for genetic algorithms]]></source>
<year>1996</year>
<conf-name><![CDATA[ IEEE International Conference on Evolutionary Computation 1996 (CEC&#8217;96)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>798-803</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sanders]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Schulz]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Think Locally, Act Globally: Highly Balanced Graph Partitioning]]></source>
<year>2013</year>
<page-range>164-75</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Segura]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Aguirre]]></surname>
<given-names><![CDATA[A. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Peña]]></surname>
<given-names><![CDATA[S. I. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Rionda]]></surname>
<given-names><![CDATA[S. B.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Importance of Proper Diversity Management in Evolutionary Algorithms for Combinatorial Optimization]]></source>
<year>2015</year>
<page-range>121-48</page-range><publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Segura]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C. A. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Segredo]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Aguirre]]></surname>
<given-names><![CDATA[A. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A novel diversity-based replacement strategy for evolutionary algorithms]]></article-title>
<source><![CDATA[IEEE Transactions on Cybernetics]]></source>
<year>2016</year>
<volume>46</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>3233-46</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[Segura]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernandez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Luna]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Alba]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Improving diversity in evolutionary algorithms: New best solutions for frequency assignment]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2017</year>
<numero>99</numero>
<issue>99</issue>
</nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Segura]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Peña]]></surname>
<given-names><![CDATA[S. I. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Rionda]]></surname>
<given-names><![CDATA[S. B.]]></given-names>
</name>
<name>
<surname><![CDATA[Aguirre]]></surname>
<given-names><![CDATA[A. H.]]></given-names>
</name>
</person-group>
<source><![CDATA[The importance of diversity in the application of evolutionary algorithms to the Sudoku problem]]></source>
<year>2016</year>
<conf-name><![CDATA[ 2016 IEEE Congress on Evolutionary Computation (CEC)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>919-26</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>27</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>
<source><![CDATA[Metaheuristics: From Design to Implementation]]></source>
<year>2009</year>
<publisher-name><![CDATA[Wiley Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[&#268;repin&#353;ek]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[S.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Mernik]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Exploration and exploitation in evolutionary algorithms: A survey]]></article-title>
<source><![CDATA[ACM Computing Surveys]]></source>
<year>2013</year>
<volume>45</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>35:1-35:33</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[Vidal]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Crainic]]></surname>
<given-names><![CDATA[T. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Gendreau]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2013</year>
<volume>40</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>475-89</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
