A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition

Hao, Jin‐Kao; Hamiez, Jean-Philippe; Glover, Fred

doi:10.4018/jamc.2010100101

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

2015

Publication Types

Select...

Article3

Book2

Other1

Relationship

Self Cite1

Independent5

Authors

Journals

Cited by 6 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, we cite Evolutionary Algorithms [7], Simulated Annealing (SA) [8], Tabu search algorithm [9].…”

Section: Introductionmentioning

confidence: 99%

A discrete flower pollination algorithm for graph coloring problem

Bensouyad

Saïdouni

2015

2015 IEEE 2nd International Conference on Cybernetics (CYBCONF)

View full text Add to dashboard Cite

Flower pollination algorithm is a recent nature inspired algorithm for continuous optimization; this algorithm is inspired by the pollination process of flowers. In this paper, we introduce a discrete version of the algorithm to deal with the graph coloring problem. The performance of the algorithm is evaluated on benchmark instances set and the computational results show promising results where it achieves the exact solution in almost cases.

show abstract

“…For instance, we cite Evolutionary Algorithms [7], Simulated Annealing (SA) [8], Tabu search algorithm [9].…”

Section: Introductionmentioning

confidence: 99%

A discrete flower pollination algorithm for graph coloring problem

Bensouyad

Saïdouni

2015

2015 IEEE 2nd International Conference on Cybernetics (CYBCONF)

View full text Add to dashboard Cite

show abstract

Recent Advances in Graph Vertex Coloring

Galinier

Hamiez

Hao

et al. 2013

Handbook of Optimization

Self Cite

View full text Add to dashboard Cite

Graph vertex coloring is one of the most studied NP-hard combinatorial optimization problems. Given the hardness of the problem, various heuristic algorithms have been proposed for practical graph coloring, based on local search, population-based approaches and hybrid methods. The research in graph coloring heuristics is very active and improved results have been obtained recently, notably for coloring large and very large graphs. This chapter surveys and analyzes graph coloring heuristics with a focus on the most recent advances.

show abstract