A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems

Craenen, B. G. W.; Paechter, B.

Abstract

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.

Citation

Craenen, B. G. W., & Paechter, B. (2008, March). A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems. Presented at 8th European Conference, EvoCOP 2008, Naples, Italy

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 8th European Conference, EvoCOP 2008
• Start Date: Mar 26, 2008
• End Date: Mar 28, 2008
• Publication Date: 2008
• Deposit Date: Oct 3, 2019
• Publisher: Springer
• Pages: 13-24
• Series Title: Lecture Notes in Computer Science
• Series Number: 0302-9743
• Series ISSN: 4972
• Book Title: Evolutionary Computation in Combinatorial Optimization
• DOI: https://doi.org/10.1007/978-3-540-78604-7_2
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/2662