Variations on memetic algorithms for graph coloring problems

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of heuristics Ročník 24; číslo 1; s. 1 - 24
Hlavní autori: Moalic, Laurent, Gondran, Alexandre
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.02.2018
Springer Nature B.V
Springer Verlag
Predmet:
Algorithms
Artificial Intelligence
Calculus of Variations and Optimal Control; Optimization
Computer Science
Computing time
Evolutionary algorithms
Graph coloring
Management Science
Mathematics
Mathematics and Statistics
Operations Research
Operations Research/Decision Theory
Optimization and Control
Coloring
Graph
Combinatorial optimization
Metaheuristics
Evolutionary
tabu search
coloring
evolutionary
memetic
graph
ISSN:1381-1231, 1572-9397
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 < dsjc 1000.9 > , 81-colorings for < flat 1000 _ 76 _ 0 > and even 47-colorings for < dsjc 500.5 > and 82-colorings for < dsjc 1000.5 > .
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1381-1231
1572-9397
DOI:10.1007/s10732-017-9354-9