A Birnbaum-importance based genetic local search algorithm for component assignment problems

2012 ◽  
Vol 212 (1) ◽  
pp. 185-200 ◽  
Author(s):  
Qingzhu Yao ◽  
Xiaoyan Zhu ◽  
Way Kuo
2006 ◽  
Vol 14 (2) ◽  
pp. 223-253 ◽  
Author(s):  
Frédéric Lardeux ◽  
Frédéric Saubion ◽  
Jin-Kao Hao

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