A tabu search evolutionary algorithm for solving constraint satisfaction problems.

Craenen, B G W; Paechter, Ben

Abstract

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.

Citation

Craenen, B. G. W., & Paechter, B. (2006, September). A tabu search evolutionary algorithm for solving constraint satisfaction problems. Presented at Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland

• Presentation Conference Type: Conference Paper (published)
• Conference Name: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference
• Start Date: Sep 9, 2006
• End Date: Sep 13, 2006
• Publication Date: Oct 6, 2006
• Deposit Date: Jul 18, 2008
• Electronic ISSN: 1611-3349
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Pages: 152-161
• Series Title: Lecture Notes in Computer Science
• Series Number: 4193
• Series ISSN: 0302-9743
• Book Title: Parallel Problem Solving from Nature - PPSN IX
• ISBN: 9783540389903
• DOI: https://doi.org/10.1007/11844297_16
• Keywords: Constraint satisfaction; Evolutionary algorithm; STLEA; Searching; Comparisons; Deterministic algorithms; Non-deterministic algorithms; Performance evaluation
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/1751