Author/Authors :
Kaviani، Mohamad Amin نويسنده Department of Industrial engineering, Shiraz Branch, Islamic Azad University, Shiraz, Iran , , Abbasi، Mehdi نويسنده , , Rahpeyma، Bentolhoda نويسنده bDepartment of Industrial engineering, Shiraz Branch, Islamic Azad University, Shiraz, Iran , , Yusefi، Mohamad Mehdi نويسنده Department of Industrial engineering, Shiraz Branch, Islamic Azad University, Shiraz, Iran ,
Abstract :
Quadratic assignment problem (QAP) has been considered as one of the most complicated problems. The problem is NP-Hard and the optimal solutions are not available for large-scale problems. This paper presents a hybrid method using tabu search and simulated annealing technique to solve QAP called TABUSA. Using some well-known problems from QAPLIB generated by Burkard et al. (1997) [Burkard, R. E., Karisch, S. E., & Rendl, F. (1997). QAPLIB–a quadratic assignment problem library. Journal of Global Optimization, 10(4), 391-403.], two methods of TABUSA and TS are both coded on MATLAB and they are compared in terms of relative percentage deviation (RPD) for all instances. The performance of the proposed method is examined against Tabu search and the preliminary results indicate that the hybrid method is capable of solving real-world problems, efficiently.
