Hybrid Evolutionary Algorithms for Graph Coloring

  title={Hybrid Evolutionary Algorithms for Graph Coloring},
  author={P. Galinier and Jin-Kao Hao},
  journal={Journal of Combinatorial Optimization},
  • P. Galinier, Jin-Kao Hao
  • Published 1999
  • Mathematics, Computer Science
  • Journal of Combinatorial Optimization
  • A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this paper, we present such hybrid algorithms for the graph coloring problem. These algorithms combine a new class of highly specialized crossover operators and a well-known tabu search algorithm. Experiments of such a hybrid algorithm are carried out on large DIMACS Challenge benchmark graphs. Results prove very competitive with and even better than… CONTINUE READING
    A New Genetic Local Search Algorithm for Graph Coloring
    • 144
    A variable neighborhood search for graph coloring
    • 172
    • Highly Influenced
    • PDF
    A survey of local search methods for graph coloring
    • 205
    Scatter Search for Graph Coloring
    • 58
    • PDF
    An ACO algorithm for graph coloring problem
    • 63
    • PDF
    An Evolutionary Annealing Approach to Graph Coloring
    • 21
    • PDF
    Recent Advances in Graph Vertex Coloring
    • 37
    • PDF
    A memetic algorithm for graph coloring
    • 173
    • PDF
    A Metaheuristic Approach for the Vertex Coloring Problem
    • 118


    Publications referenced by this paper.
    New methods to color the vertices of a graph
    • 1,554
    • PDF
    Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
    • 91
    A Graph Colouring Algorithm for Large Scheduling Problems
    • 292
    • PDF
    Evolution algorithms in combinatorial optimization
    • 299
    Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability
    • 86
    • Highly Influential