The Adaptive Tabu Search and Its Application to the Quadratic Assignment Problem

Date Issued
2006
Author(s)
Abstract
This article presents a new algorithm for
combinatorial optimization based on the basic Tabu
Search scheme named Adaptive Tabu Search (A-TS).
The A-TS introduces a new, complex function for
evaluation of moves. The new evaluation function
incorporates both the aspiration criteria and the longterm memory. A-TS also introduces a new decision
making mechanism, providing means for avoiding
possible infinite loops. The performance of A-TS was
measured by applying it to the Quadratic Assignment
Problem. The experimental results are compared to
published results from other authors. The data shows
that A-TS performs favorably against other established
techniques.
File(s)
Loading...
Thumbnail Image
Name

The_Adaptive_Tabu_Search_and_Its_Application_to_th.pdf

Size

355.92 KB

Format

Adobe PDF

Checksum

(MD5):b48c05bc1bb96e5e76305aecaa41d22d