Abstract: Hybridization of local search algorithms yield promising algorithms for combinatorial optimization problems such as Graph Coloring Problem (GCP).

Dec 10, 2015 · Hybridization of local search algorithms yield promising algorithms for combinatorial optimization problems such as Graph Coloring Problem ...

Abstract—Hybridization of local search algorithms yield promising algorithms for combinatorial optimization problems such as Graph Coloring Problem (GCP).

In this paper we propose a new hybrid genetic algorithm based on a local search heuristic called DBG to give approximate values of χ(G) for GCP.

FWLS: A Local Search for Graph Coloring · Time efficient demon algorithm for graph coloring with search cut-off property · A new hybrid local search algorithm on ...

Cagri Yesil, Buse Yilmaz , Emin Erkan Korkmaz : Hybrid local search algorithms on Graph Coloring Problem. HIS 2011: 468-473.

In this paper, we present such hybrid algorithms for the graph coloring problem. These algorithms combine a new class of highly specialized crossover operators ...

Mar 15, 2017 · Vertex Descent is a local search algorithm which forms the basis of a wide spectrum of tabu search, simulated annealing and hybrid evolutionary algorithms for ...

Abstract. This paper presents a new genetic local search algorithm for the graph coloring problem. The algorithm combines an original crossover.

Graph coloring is a well known problem from graph theory that, when solving it with local search algorithms, is typically treated as a series of constraint ...