A conflict tabu search evolutionary algorithm for solving constraint satisfaction problems

Authors:
Bart G. W. Craenen;Ben Paechter
Affiliations:
Napier University, Edinburgh;Napier University, Edinburgh
Venue:
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Year:
2008

Citing 4
Cited 2

Tabu search

Modern heuristic techniques for combinatorial problems
The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best

Proceedings of the 3rd International Conference on Genetic Algorithms
A tabu search evolutionary algorithm for solving constraint satisfaction problems

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Comparing evolutionary algorithms on binary constraint satisfaction problems

IEEE Transactions on Evolutionary Computation

A conflict based SAW method for constraint satisfaction problems

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Exploring the solution of course timetabling problems through heuristic segmentation

MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Artificial Intelligence - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.