Tools
Tools
Craenen, B G W and Paechter, Ben (2006) A tabu search evolutionary algorithm for solving constraint satisfaction problems. In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 9th-13th September 2006, Reykyavik , Iceland.
Full text not available from this repository. (Request a copy)Abstract/Description
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Print ISSN: | 0302-9743 |
| ISBN: | 9783540389903 |
| Electronic ISSN: | 1611-3349 |
| Additional Information: | Chapter 16 in: Lecture Notes in Computer Science Volume 4193: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference. |
| Uncontrolled Keywords: | Constraint satisfaction; Evolutionary algorithm; STLEA; Searching; Comparisons; Deterministic algorithms; Non-deterministic algorithms; Performance evaluation; |
| University Divisions/Research Centres: | Faculty of Engineering, Computing and Creative Industries > School of Computing |
| Dewey Decimal Subjects: | 000 Computer science, information & general works > 000 Computer science, knowledge & systems > 006 Special Computer Methods |
| Library of Congress Subjects: | Q Science > QA Mathematics > QA76 Computer software |
| Item ID: | 1751 |
| Depositing User: | RAE Import |
| Date Deposited: | 18 Jul 2008 14:40 |
| Last Modified: | 21 Oct 2010 13:25 |
| URI: | http://researchrepository.napier.ac.uk/id/eprint/1751 |
Actions (login required)
| View Item |