On a parallel genetic-tabu search based algorithm for solving the graph colouring problem

DOI10.1016/j.ejor.2008.03.050zbMath1176.90482OpenAlexW2041132551MaRDI QIDQ1042037

Zaher Mahjoub, Bchira Ben Mabrouk, Hamadi Hasni

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.03.050

zbMATH Keywords

tabu searchgenetic algorithmsgraph colouringparallelisationhybridation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic ⋮ Tackling the maximum happy vertices problem in large networks ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM

Cites Work

• Using tabu search techniques for graph coloring
• Some experiments with simulated annealing for coloring graphs
• A variable neighborhood search for graph coloring.
• Genetic and hybrid algorithms for graph coloring
• Hybrid evolutionary algorithms for graph coloring
• A survey of local search methods for graph coloring
• A graph coloring algorithm for large scheduling problems
• New methods to color the vertices of a graph
• Ants can colour graphs
• A GRASP for coloring sparse graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a parallel genetic-tabu search based algorithm for solving the graph colouring problem