Research Output

A tabu search evolutionary algorithm for solving constraint satisfaction problems.

  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.

  • Date:

    06 October 2006

  • Publication Status:

    Published

  • DOI:

    10.1007/11844297_16

  • Library of Congress:

    QA76 Computer software

  • Dewey Decimal Classification:

    006 Special Computer Methods

Citation

Craenen, B. G. W. & Paechter, B. (2006). A tabu search evolutionary algorithm for solving constraint satisfaction problems. doi:10.1007/11844297_16. ISBN 9783540389903

Authors

Keywords

Constraint satisfaction; Evolutionary algorithm; STLEA; Searching; Comparisons; Deterministic algorithms; Non-deterministic algorithms; Performance evaluation;

Available Documents