Variations on memetic algorithms for graph coloring problems

Laurent Moalic () and Alexandre Gondran ()
Additional contact information
Laurent Moalic: Univ. Bourgogne Franche-Comté
Alexandre Gondran: French Civil Aviation University

Journal of Heuristics, 2018, vol. 24, issue 1, No 1, 24 pages

Abstract: Abstract Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem. The most effective methods to solve this problem are proved to be hybrid algorithms such as memetic algorithms or quantum annealing. Those hybrid algorithms use a powerful local search inside a population-based algorithm. This paper presents a new memetic algorithm based on one of the most effective algorithms: the hybrid evolutionary algorithm (HEA) from Galinier and Hao (J Comb Optim 3(4): 379–397, 1999). The proposed algorithm, denoted HEAD—for HEA in Duet—works with a population of only two individuals. Moreover, a new way of managing diversity is brought by HEAD. These two main differences greatly improve the results, both in terms of solution quality and computational time. HEAD has produced several good results for the popular DIMACS benchmark graphs, such as 222-colorings for $${ }$$ , 81-colorings for $${ }$$ and even 47-colorings for $${ }$$ and 82-colorings for $${ }$$ .

Keywords: Combinatorial optimization; Metaheuristics; Coloring; Graph; Evolutionary (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10732-017-9354-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:24:y:2018:i:1:d:10.1007_s10732-017-9354-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-017-9354-9

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().