A hybrid algorithm of simulated annealing and tabu search for graph colouring problem

2011 ◽  
Vol 11 (2) ◽  
pp. 136 ◽  
Author(s):  
Ali Pahlavani ◽  
Kourosh Eshghi
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Hybrid Algorithm ◽  
Graph Colouring

The improved ColourAnt algorithm: a hybrid algorithm for solving the graph colouring problem

2020 ◽  
Vol 16 (1) ◽  
pp. 1
Author(s):  
Anderson Faustino Da Silva ◽  
Luis Gustavo Araujo Rodriguez ◽  
N.A. Jo�ã ◽  
o Fabrício Filho
Keyword(s):  
Hybrid Algorithm ◽  
Graph Colouring

scholarly journals GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem

2006 ◽  
Vol 14 (2) ◽  
pp. 223-253 ◽  
Author(s):  
Frédéric Lardeux ◽  
Frédéric Saubion ◽  
Jin-Kao Hao
Keyword(s):  
Tabu Search ◽  
Local Search ◽  
Hybrid Algorithm ◽  
State Of The Art ◽  
Search Algorithm ◽  
Satisfiability Problem ◽  
Local Search Algorithm ◽  
Overall Performance ◽  
Genetic Local Search ◽  
Search Stage

This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossover and a tabu search stage. We have conducted experiments to evaluate the different components of GASAT and to compare its overall performance with state-of-the-art SAT algorithms. These experiments show that GASAT provides very competitive results.

Sign in / Sign up

Export Citation Format

Share Document