<?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-55462021000300465</article-id>
<article-id pub-id-type="doi">10.13053/cys-25-3-3901</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Structure-Driven Genetic Algorithm for Graph Coloring]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Aguilar-Canepa]]></surname>
<given-names><![CDATA[José]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Menchaca-Méndez]]></surname>
<given-names><![CDATA[Rolando]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Menchaca-Méndez]]></surname>
<given-names><![CDATA[Ricardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[Jesús]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
<xref ref-type="aff" rid="Aaf"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Investigación en Computación ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Consejo Nacional de Ciencia y Tecnología  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Instituto Nacional de Astrofísica, Óptica y Electrónica Coordinación de Ciencias Computacionales ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2021</year>
</pub-date>
<volume>25</volume>
<numero>3</numero>
<fpage>465</fpage>
<lpage>481</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462021000300465&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-55462021000300465&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-55462021000300465&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Genetic algorithms are well-known numerical optimizers used for a wide array of applications. However, their performance when applied to combinatorial optimization problems is often lackluster. This paper introduces a new Genetic Algorithm (GA) for the graph coloring problem that is competitive, on standard benchmarks, with state-of-the-art heuristics. In particular, we propose a crossover operator that combines two individuals based on random cuts (A, B) of the input graph with small cut-sets. The idea is to combine individuals by merging parts that interact as little as possible so that one individual&#8217;s goodness does not interfere with the other individual&#8217;s goodness. Also, we use a selection operator that picks individuals based on the individuals&#8217; fitness restricted to the nodes in one of the sets in the partition rather than based on the individuals&#8217; total fitness. Finally, we embed local search within the genetic operators applied to both the individuals&#8217; sub-solutions chosen to be combined and the individual that results after applying the crossover operator.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Genetic algorithms]]></kwd>
<kwd lng="en"><![CDATA[dynamic programming]]></kwd>
<kwd lng="en"><![CDATA[graph coloring]]></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[Abbasian]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mouhoub]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hierarchical parallel genetic approach for the graph coloring problem]]></article-title>
<source><![CDATA[Applied Intelligence]]></source>
<year>2013</year>
<volume>39</volume>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ackley]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Connectionist Machine for Genetic Hillclimbing]]></source>
<year>1987</year>
<publisher-name><![CDATA[Kluwer Academic Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Assi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Halawi]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Haraty]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic algorithm analysis using the graph coloring method for solving the university timetable problem]]></article-title>
<source><![CDATA[Procedia Computer Science]]></source>
<year>2018</year>
<volume>126</volume>
<page-range>899-906</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bahiense]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Ribeiro]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2014</year>
<volume>164</volume>
<page-range>34-46</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blöchliger]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Zufferey]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A graph coloring heuristic using partial solutions and a reactive tabu scheme]]></article-title>
<source><![CDATA[Computers and Operations Research]]></source>
<year>2008</year>
<volume>35</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>960-75</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bodlaender]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kratsch]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[An exact algorithm for graph coloring with polynomial memory]]></source>
<year>2006</year>
<volume>2006</volume>
<publisher-name><![CDATA[UU-CS]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bollobás]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Thomason]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Random graphs of small order]]></article-title>
<source><![CDATA[North-Holland Mathematics Studies]]></source>
<year>1985</year>
<volume>118</volume>
<page-range>47-97</page-range><publisher-name><![CDATA[Elsevier]]></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[Brélaz]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[New methods to color the vértices of a graph]]></article-title>
<source><![CDATA[Communications of the ACM]]></source>
<year>1979</year>
<volume>22</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>251-6</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[Brown]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Chromatic scheduling and the chromatic number problem]]></article-title>
<source><![CDATA[Management Science]]></source>
<year>1972</year>
<volume>19</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>456-63</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[Byskov]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Chromatic number in time O(2.4023n) using maximal independent sets]]></article-title>
<source><![CDATA[BRICS Report Series]]></source>
<year>2002</year>
<volume>9</volume>
<numero>45</numero>
<issue>45</issue>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Caramia]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Dell&#8217;Olmo]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Italiano]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[CHECKCOL: Improved local search for graph coloring]]></article-title>
<source><![CDATA[Journal of Discrete Algorithms]]></source>
<year>2006</year>
<volume>4</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>277-98</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[Carter]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ragsdale]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new approach to solving the multiple traveling salesperson problem using genetic algorithms]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2006</year>
<volume>175</volume>
<page-range>245-57</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introducción a la Computación Evolutiva (Notas de Curso)]]></source>
<year>2018</year>
<publisher-name><![CDATA[Departamento de Computación CINVESTAV-IPN]]></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[Costa]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Hertz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ants can colour graphs]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>1997</year>
<volume>48</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>295-305</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Costa]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Hertz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Dubuis]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>1995</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>105-28</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Davis]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Order-based genetic algorithms and the graph coloring problem]]></article-title>
<source><![CDATA[Handbook of Genetic Algorithms]]></source>
<year>1991</year>
<page-range>72-90</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[De Jong]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[An Analysis of the Behavior of a Class of Genetic Adaptive Systems]]></source>
<year>1975</year>
<publisher-name><![CDATA[University of Michigan]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dorne]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.-K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tabu search for graph coloring, T-colorings and set T-colorings]]></article-title>
<source><![CDATA[Meta-heuristics]]></source>
<year>1999</year>
<page-range>77-92</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Douiri]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Bernoussi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new heuristic for the sum coloring problem]]></article-title>
<source><![CDATA[Applied Mathematical Sciences]]></source>
<year>2011</year>
<volume>63</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>3121-9</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[Dukanovic]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Rendl]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A semidefinite programming-based heuristic for graph coloring]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2008</year>
<volume>156</volume>
<page-range>180-9</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eppstein]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Small maximal independent sets and faster exact graph coloring]]></article-title>
<source><![CDATA[Workshop on Algorithms and Data Structures]]></source>
<year>2001</year>
<page-range>462-70</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fleurent]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Ferland]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic and hybrid algorithms for graph coloring]]></article-title>
<source><![CDATA[Annals of Operations Research]]></source>
<year>1996</year>
<volume>63</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>437-61</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[Furini]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Virginie]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Ternier]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved DSATUR-based branch-and-bound algorithm for the vertex coloring problem]]></article-title>
<source><![CDATA[Networks]]></source>
<year>2017</year>
<volume>69</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>124-41</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[Galan]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simple decentralized graph coloring]]></article-title>
<source><![CDATA[Computational Optimization and Applications]]></source>
<year>2017</year>
<volume>66</volume>
</nlm-citation>
</ref>
<ref id="B25">
<label>25</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="B26">
<label>26</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[Hertz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Zufferey]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An adaptive memory algorithm for the k-coloring problem]]></article-title>
<source><![CDATA[Discrete Applied Mathematical]]></source>
<year>2008</year>
<volume>156</volume>
<page-range>267-79</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[Goldberg]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic algorithms in search, optimization, and machine learning]]></source>
<year>1989</year>
<publisher-name><![CDATA[Addison Wesley Longman]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Greffenstate]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Incorporating problem specific knowledge into a genetic algorithm]]></article-title>
<source><![CDATA[Genetic Algorithms and Simulated Annealing]]></source>
<year>1987</year>
<page-range>42-60</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[Gualandi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Malucelli]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Exact solution of graph coloring problems via constraint programming and column generation]]></article-title>
<source><![CDATA[Informs Journal on Computing]]></source>
<year>2012</year>
<volume>24</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>81-100</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Herrmann]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Hertz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Finding the chromatic number by means of critical graphs]]></article-title>
<source><![CDATA[Electronic Notes in Discrete Mathematics]]></source>
<year>2000</year>
<volume>5</volume>
<page-range>174-6</page-range></nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hertz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[de Werra]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Using tabu search techniques for graph coloring]]></article-title>
<source><![CDATA[Computing]]></source>
<year>1987</year>
<volume>39</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>345-51</page-range></nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hertz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Plumettaz]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Zufferey]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Variable space search for graph coloring]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2008</year>
<volume>156</volume>
<numero>13</numero>
<issue>13</issue>
<page-range>2551-60</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Johnson]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Aragon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[McGeoch]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Schevon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1991</year>
<volume>39</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>378-406</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karger]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Global min-cuts in RNC and other ramifications of a simple mincut algorithm]]></source>
<year>1993</year>
<conf-name><![CDATA[ 4th Anual ACM-SIAM Symposium on Discrete Algorithms]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karp]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reducibility among combinatorial problems]]></article-title>
<source><![CDATA[Complexity of computer computations]]></source>
<year>1972</year>
<page-range>85-103</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B36">
<label>36</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kuhn]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The hungarian method for the assignment problem]]></article-title>
<source><![CDATA[Naval Research Logistics Quarterly]]></source>
<year>1955</year>
<volume>2</volume>
<page-range>83-97</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[Lawler]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A note on the complexity of the chromatic number problem. Inform]]></article-title>
<source><![CDATA[Process. Lett.]]></source>
<year>1976</year>
<volume>5</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>66-7</page-range></nlm-citation>
</ref>
<ref id="B38">
<label>38</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leighton]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A graph coloring algorithm for large scheduling problems]]></article-title>
<source><![CDATA[Journal of research of the national bureau of standards]]></source>
<year>1979</year>
<volume>84</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>489-506</page-range></nlm-citation>
</ref>
<ref id="B39">
<label>39</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lourenço]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Iterated local search]]></article-title>
<source><![CDATA[Handbook of Metaheuristics]]></source>
<year>2002</year>
<page-range>321-52</page-range></nlm-citation>
</ref>
<ref id="B40">
<label>40</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A memetic algorithm for graph coloring]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2010</year>
<volume>203</volume>
<page-range>241-50</page-range></nlm-citation>
</ref>
<ref id="B41">
<label>41</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malaguti]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Monaci]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A metaheuristic approach for the vertex coloring problem]]></article-title>
<source><![CDATA[Informs Journal on Computing]]></source>
<year>2008</year>
<volume>20</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>302-16</page-range></nlm-citation>
</ref>
<ref id="B42">
<label>42</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malaguti]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Monaci]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An exact approach for the vertex coloring problem]]></article-title>
<source><![CDATA[Discrete Optimization]]></source>
<year>2011</year>
<volume>8</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>174-90</page-range></nlm-citation>
</ref>
<ref id="B43">
<label>43</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malaguti]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey on vertex coloring problems]]></article-title>
<source><![CDATA[International Transactions in Operational Research]]></source>
<year>2010</year>
<volume>17</volume>
<page-range>1-34</page-range></nlm-citation>
</ref>
<ref id="B44">
<label>44</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Matula]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Beck]]></surname>
<given-names><![CDATA[L. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Smallest-last ordering and clustering and graph coloring algorithms]]></article-title>
<source><![CDATA[Journal of the ACM (JACM)]]></source>
<year>1983</year>
<volume>30</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>417-27</page-range></nlm-citation>
</ref>
<ref id="B45">
<label>45</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mehrotra]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Trick]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A column generation approach for graph coloring]]></article-title>
<source><![CDATA[Informs Journal on Computing]]></source>
<year>1996</year>
<volume>8</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>344-54</page-range></nlm-citation>
</ref>
<ref id="B46">
<label>46</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mirsaleh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Meybodi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new memetic algorithm based on cellular learning automata for solving the vertex coloring problem]]></article-title>
<source><![CDATA[Memetic Comp.]]></source>
<year>2016</year>
<volume>8</volume>
<page-range>211-22</page-range></nlm-citation>
</ref>
<ref id="B47">
<label>47</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mirsaleh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Meybodi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A michigan memetic algorithm for solving the vertex coloring problem]]></article-title>
<source><![CDATA[Journal of Computer Science]]></source>
<year>2017</year>
</nlm-citation>
</ref>
<ref id="B48">
<label>48</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mitzenmacher]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Upfal]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Probability and Computing]]></article-title>
<source><![CDATA[Randomized Algorithms and Probabilistic Analysis]]></source>
<year>2005</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B49">
<label>49</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moalic]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Gondran]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Variations on memetic algorithms for graph coloring problems]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2018</year>
<volume>24</volume>
</nlm-citation>
</ref>
<ref id="B50">
<label>50</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Munkres]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithms for the assignment and transportation problems]]></article-title>
<source><![CDATA[Journal of the Society for Industrial and Applied Mathemathics]]></source>
<year>1957</year>
<volume>5</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>32-8</page-range></nlm-citation>
</ref>
<ref id="B51">
<label>51</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Porumbel]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Kuntz]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring]]></article-title>
<source><![CDATA[Computers and Operations Research]]></source>
<year>2010</year>
<volume>37</volume>
<page-range>1822-32</page-range></nlm-citation>
</ref>
<ref id="B52">
<label>52</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reeves]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Modern Heuristic Techniques for Combinatorial Problems]]></source>
<year>1993</year>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B53">
<label>53</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Salari]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Eshghi]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[An ACO algorithm for graph coloring problem]]></source>
<year>2005</year>
<conf-name><![CDATA[ ICSC Congress on Computational Intelligence Methods and Applications]]></conf-name>
<conf-date>2005</conf-date>
<conf-loc> </conf-loc>
<page-range>5</page-range></nlm-citation>
</ref>
<ref id="B54">
<label>54</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[San Segundo]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new DSATUR-based algorithm for exact vertex coloring]]></article-title>
<source><![CDATA[Computers and Operations Research]]></source>
<year>2012</year>
<volume>39</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>1724-33</page-range></nlm-citation>
</ref>
<ref id="B55">
<label>55</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sewell]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A branch and bound algorithm for the stability number of a sparse graph]]></article-title>
<source><![CDATA[Informs Journal on Computing]]></source>
<year>1998</year>
<volume>10</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>438-47</page-range></nlm-citation>
</ref>
<ref id="B56">
<label>56</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Thanh]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Binh]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Lam]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem]]></article-title>
<source><![CDATA[Advances in Intelligent Systems and Computing]]></source>
<year>2015</year>
<volume>326</volume>
<page-range>367-29</page-range></nlm-citation>
</ref>
<ref id="B57">
<label>57</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Titiloye]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Crispin]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Graph coloring with a distributed hybrid quantum annealing algorithm]]></article-title>
<source><![CDATA[Agent and Multi-Agent Systems: Technologies and Applications]]></source>
<year>2011</year>
<volume>6682</volume>
</nlm-citation>
</ref>
<ref id="B58">
<label>58</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Coloring large graphs based on independent set extraction]]></article-title>
<source><![CDATA[Computers and Operations Research]]></source>
<year>2012</year>
<volume>39</volume>
<page-range>283-90</page-range></nlm-citation>
</ref>
<ref id="B59">
<label>59</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An effective heuristic algorithm for sum coloring of graphs]]></article-title>
<source><![CDATA[Computers and Operations Research]]></source>
<year>2012</year>
<volume>39</volume>
<page-range>1593, 1600</page-range></nlm-citation>
</ref>
<ref id="B60">
<label>60</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xie]]></surname>
<given-names><![CDATA[X.-F.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Graph coloring by multiagent fusion search]]></article-title>
<source><![CDATA[Journal of Combinatorial Optimization]]></source>
<year>2009</year>
<volume>18</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>99-123</page-range></nlm-citation>
</ref>
<ref id="B61">
<label>61</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Younas]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Kamrani]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Bashir]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Schubert]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient genetic algorithms for optimal assignment of tasks to teams of agents]]></article-title>
<source><![CDATA[Neurocomputing]]></source>
<year>2018</year>
<volume>314</volume>
<page-range>409-28</page-range></nlm-citation>
</ref>
<ref id="B62">
<label>62</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yuan]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Skinner]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2013</year>
<volume>228</volume>
<page-range>72-82</page-range></nlm-citation>
</ref>
<ref id="B63">
<label>63</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid adaptely genetic algorithm for task scheduling problem in the phased array radar]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2019</year>
<volume>272</volume>
<page-range>868-78</page-range></nlm-citation>
</ref>
<ref id="B64">
<label>64</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Duval]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reinforcement learning based local search for grouping (2016) problems: a case study on graph coloring]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2016</year>
<volume>64</volume>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
