A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems

This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced algorithm, called the STLEA, the CTLEA replaces the earlier compound label tabu list with a conflict tabu list. Extensive experimental fine-tuning of parameters was performed to optimise the performance of the algorithm on a commonly used test-set. Compared to the performance of the earlier STLEA, and benchmark algorithms, the CTLEA outperforms the former, and approaches the later.

• Type: Conference
• Year: 2008
• Where: EVOW
• Authors: Bart G. W. Craenen, Ben Paechter
• Keywords: Artificial Intelligence, Earlier Introduced Algorithm, EVOW 2008, Hybrid Tabu Search, Tabu List