Solving the Quadratic Assignment Problem by the Repeated Iterated Tabu Search Method.

Autor:	Shylo, P.
Předmět:	QUADRATIC assignment problem TABU search algorithm PROBLEM solving COMPARATIVE studies TRAVELING salesman problem
Zdroj:	Cybernetics & Systems Analysis; Mar2017, Vol. 53 Issue 2, p308-311, 4p
Abstrakt:	A new repeated iterated tabu search for the quadratic assignment problem is developed. A comparative study of this algorithm and the best existing algorithms for solving this problem has shown its competitiveness with respect to both its performance and quality of solutions. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink