Quadratic Assignment Problem

Quadratic Assignment Problem (QAP) is one of the symbolic combinatorial optimization problems in the operation research field. Given set of n facilities and set of n locations, distance is specified for each pair of locations and flow is specified for each pair of facilities. The goal in the QAP is to find the assignment of all facilities to different locations with the goal of minimizing the sum of the distances multiplied by the corresponded flows.

The aim of this study is that to propose an improved Tabu Tenure of Tabu Search for the QAP. Tabu Tenure is a critical parameter that greatly affects the performance of Tabu Search. Tabu Search is a method for solving difficult problems in optimization. Tabu Search was invented by Fred W. Glover

Parallel Strategies For Meta-Heuristics. In F.Glover, G.A.Konchenberger, editors, Handbook of Metaheuristic, pp. 1-2, 2003.

[GloLag97] F.Glover and M.Laguna. Tabu Search. In Pardalos et al., editors, Handbook of Combinatorial Optimization, pp. 3262-3263, 1997.

[Gen02] M.Gendreau. An Introduction To Tabu Search, 2002.

[MinThaThaTra10] K.N.T.TMinh, N.D.T.Thanh, K.T.Trang and N.T.T.Hue. Using Tabu Search for Solving a High School Timetabling Problem. In N.T.Nguyen et al, editors, Adv. In Intelligent Inform. And Database Systems, SCI 283, pp.306, 2010.

[AlcSicVig97] D.Alcaide, J.Sicilia and D.Vigo. A Tabu Search Algorithm for the Open Shop Problem, pp. 289-290, 1997.

[HemCot08] J.V.Hemert and C.Cotta. Evo COP 2008, LNCS 4972, pp. 1-12, 2008.

[HaoDorGal98] J.K.Hao, R.Dorne, P.Galinier. Tabu Search for frequency assignment in mobile radio networks. Journal of Heuristics 4(1), pp.47-62, 1998.

[MonSmi01] R.Montemanni and D.H.Smith. A Tabu Search Algorithm with a dynamic Tabu list for the Frequency Assignment Problem, Technical Report,University of Glamorgan, 2001.

[JonRayTho94] F.B.Jonathan, W.C.Raymond and A.F.Thomas. Machine setup and component placement in printed circuit board assembly. In International Journal of Flexible Manufacturing Systems, Volume 6, Issue 1, pp. 5-31,

An initial solution,s is chosen randomly and set as the best found solution, sbest = s. The following function, GenerateAdmissableSolutions browse the neighborhood to find solutions which are not tabu or solutions that are tabu, but satisfy the aspiration criterion. Aspiration criterion is an algorithmic device which is introduced to allow choosing taboo moves if the moves are found to be interesting. Usually, a taboo move is accepted if the move results to a better solution compared to the current best solution. Ater that, SelectBestSolutions then return the best admissable move and the memory sructure is updated with the function UpdateMemoryStructure. If the f(s) is better than f(sbest), the best solution is updated, sbest = s. If the f(s) is less good than f(sbest), the current best known solution f(sbest) is kept for next iteration. When the termination condition is met, the best found solution returned in the loop, sbest is returned as the best found