A Genetic Local Search Algorithm for the Graph Partitioning Problem with Cardinality Constraints

2009 ◽  
Author(s):  
Kochetov, Yuri
Keyword(s):  
Local Search ◽  
Graph Partitioning ◽  
Search Algorithm ◽  
Local Search Algorithm ◽  
Cardinality Constraints ◽  
Graph Partitioning Problem ◽  
Partitioning Problem ◽  
Genetic Local Search

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