Self Controlling Tabu Search algorithm for the Quadratic Assignment Problem

This paper addresses the application of the principles of feedback and self-controlling software to the tabu search algorithm. We introduce two new reaction strategies for the tabu search algorithm. The first strategy treats the tabu search algorithm as a target system to be controlled and uses a co...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & industrial engineering Ročník 60; číslo 2; s. 310 - 319
Hlavní autori: Fescioglu-Unver, Nilgun, Kokar, Mieczyslaw M.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Elsevier Ltd 01.03.2011
Pergamon Press Inc
Predmet:
ISSN:0360-8352, 1879-0550
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper addresses the application of the principles of feedback and self-controlling software to the tabu search algorithm. We introduce two new reaction strategies for the tabu search algorithm. The first strategy treats the tabu search algorithm as a target system to be controlled and uses a control-theoretic approach to adjust the algorithm parameters that affect search intensification. The second strategy is a flexible diversification strategy which can adjust the algorithm’s parameters based on the search history. These two strategies, combined with tabu search, form the Self Controlling Tabu Search (SC-Tabu) algorithm. The algorithm is implemented and tested on the Quadratic Assignment Problem (QAP). The results show that the self-controlling features of the algorithm make it possible to achieve good performance on different types of QAP instances.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2010.11.014