A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
Paechter, B. (2008). A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems. In: van Hemert, J.,
Cotta, C. (Eds.) Evolutionary Computation in Combinatorial Optimization, LNCS 4972, () ( ed.). (pp. ). : . Springer.
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.
Director of Research
+44 131 455 2764
Areas of Expertise
The Bio-Inspired Algorithms group within the Centre for Algorithms, Visualisation and Evolving Systems is a large and thriving group with interests in nature-inspired computing that include Evolutionary Computing, Hyper-Heuristics, Artificial Immune Systems and Swarm Intelligence.
See all areas of expertise
The institute's expertise in software engineering encompasses the entire development lifecycle, and we focus on developing the approaches and tools to improve the engineering process of both emerging and widely used software systems.