Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse applications. This paper presents a new fast ant heuristic for the QAP, the approximatebackbone guided fast ant colony algorithm (ABFANT). The main idea is to fix the approximatebackbone which is the intersection of several local optimal permutations to the QAP. After fixing it, the authors can smooth the search space of the QAP instance without losing the search capability, and then solve the instance using the known fast ant colony algorithm (FANT) which is one of the best heuristics to the QAP in the much smoother search space. Comparisons of ABFANT and FANT within a given iteration number are performed on the publicly available QAP instances from QAPLIB. The result demonstrates that ABFANT significantly outperforms FANT.Furthermore, this idea is general and applicable to other heuristics of the QAP.
[1]Koopmans TC, Berkmann MJ. Assignment problems and the location of economic activities. Econometrica, 1957,25:53-76.
[2]Sahni S, Gonzalez T. P-Complete approximation problems. Journal of the Association of Computing Machinery, 1976,23(3):555-565.
[3]Taillard ED. Comparison of iterative searches for the quadratic assignment problem. Location Science, 1995,3:87-105.
[4]Elshafei AN. Hospital layout as a quadratic assignment problem. Operations Research Quarterly, 1977,28(1):167-179.
[5]Steinberg L. The backboard wiring problem: A placement algorithm. SIAM Review, 1961,3:37-50.
[6]Finke G, Burkard RE, Rendl F. Quadratic assignment problems. Annals of Discrete Mathematics, 1987,31:61-82.
[7]Maniezzo V, Colorni A. The ant system applied to the quadratic assignment problem. IEEE Trans. on Data and Knowledge Engineering, 1999,11(5):769-778.
[8]Gambardella L, Taillard E, Dorigo M. Ant colonies for the QAP. Journal of the Operations Research Society, 1999, 50:167-176.
[9]Nissen V. Solving the Quadratic Assignment Problem with Clues from Nature. IEEE Trans. on Neural Networks, 1994,5(1): 66-72.
[10]Merz P, Freisleben B. A genetic local search approach to the quadratic assignment problem. In: Proc. of the 7th Int'l Conf. of Genetic Algorithms, Morgan Kanffman Publishers, 1997. 465-472.
[11]Misevicius A. A modified simulated annealing algorithm for the quadratic assignment problem. Informatica, 2003,14:497-514.
[12]Ishii S, Sato M. Constrained neural approaches to quadratic assignment problems. Neural Networks, 1998,11:1073-1082.
[13]Battiti R, Tecchiolli G. The reactive tabu search. ORSA Journal on Computing, 1994,2:126-140.
[14]Nissen V, Paul H. A modification of threshold accepting and its application to the quadratic assignment Problem. OR Spektrum,1995,17:205-210.
[15]Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. Technical Report, CSR 98-1, Sede di Cesena: Universit'a di Bologna, 1998.
[16]Oliveira CAS, Pardalos PM, Resende MGC. GRASP with path-relinking for the QAP. In: MIC2003: the 5th Metaheuristics Int'l Conf. 2003.
[17]Mills P, Tsang E, Ford J. Applying an extended guided local search to the quadratic assignment problem. Submission to Annals of Operation Research 2002.
[18]Drezner Z. A new genetic algorithm for the quadratic assignment problem. INFORMS Journal on Computing, 2003,15(3):320-330.
[19]Drezner Z. Robust heuristic algorithms for the quadratic assignment problem, mathematical methods in manufacturing and logistics.Mathematisches Forschungsinstitut, Oberwolfach, Germany, December 2001.
[20]Kirkpatrick S, Toulouse G. Configuration space analysis of traveling salesman problems. Journal de Physique, 1985,46:1277-1292.
[21]Zhang W. Phase transitions and backbones of 3-sat and maximum 3-sat. In: Proc. of the 7th Int'l Conf. on Principles and Practice of Constraint Programming (CP2001). 2001. 153-167.
[22]Johnson DS, Gutin G, McGeoch LA, Yeo A, Zhang W, Zverovich A. Experimental analysis of heuristics for the ATSP. In: Gutin G,Punnen A, eds. The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, 2002.445-488.
[23]Climer S, Zhang W. Searching for backbones and fat: A limit-crossing approach with applications. In: Proc. of the AAAI2002.2002.707-712.
[24]Zhang W, Rangan A, Looks M. Backbone guided local search for maximum satisfiability. In: Proc. of the 18th Int'l Joint Conf. on AI (IJCAI2003). Acapulco, Mexico, 2003.1179-1184.
[25]Zou P, Zhou Z, Chen GL, Guo J. Multilevel reduction algorithm to TSP.Journal of Software, 2003,14(1):35-42 (in Chinese with English abstract). http:∥www.jos.org.cn/1000-9825/14/35.pdf
[26]Taillard ED. FANT: Fast ant system. Technical Report, IDSIA-46-98, Lugano: IDSIA, 1998.
[27]Taillard ED, Gambardella L. Adaptive memories for the quadratic assignment problems. Technical Report, IDSIA-87-97, Lugano:IDSIA, 1997.
[28]Schneider J, Froschhammer C, Morgenstern I, Husslein T, Singer JM. Searching for backbones-An efficient parallel algorithm for the traveling salesman problem. Computer Physics Communications, 1996,96:173-188.
[29]Burkard RE, Karisch S, Rendl F. QAPLIB-A quadratic assignment problem library. European Journal of Operational Research,1991,55:115 - 119. http:∥www.opt.math.tu-graz.ac.at/qaplib/
[30]Vollmann TE, Buffa ES. The facilities layout problem in perspective. Management Science, 1966,12(10):450-468.