Modern heuristic techniques for combinatorial problems
Proceedings of the 3rd International Conference on Genetic Algorithms
Random Constraint Satisfaction: Theory Meets Practice
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
SEAL'98 Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning
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
A conflict tabu search evolutionary algorithm for solving constraint satisfaction problems
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
| Hi-index | 0.00 |
The paper introduces a hybrid Tabu Search-Evolutionary Algorithm for solving the constraint satisfaction problem, called STLEA. Extensive experimental fine-tuning of parameters of the algorithm was performed to optimise the performance of the algorithm on a commonly used test-set. The performance of the STLEA was then compared to the best known evolutionary algorithm and benchmark deterministic and non-deterministic algorithms. The comparison shows that the STLEA improves on the performance of the best known evolutionary algorithm but can not achieve the efficiency of the deterministic algorithms.