求解QAP问题的近似骨架导向快速蚁群算法-软件学报.PDF

1000-9825/2005/16(10)1691 ©2005 Journal of Software 软 件 学 报 Vol.16, No.10 ∗ 求解QAP 问题的近似骨架导向快速蚁群算法 1+ 1 1 1 1,2 邹 鹏 , 周 智 , 陈国良 , 江 贺 , 顾 钧 1( 中国科学技术大学 计算机科学技术系 国家高性能计算中心(合肥),安徽 合肥 230027) 2(香港科学技术大学 计算机科学系,香港) Approximate-Backbone Guided Fast Ant Algorithms to QAP 1+ 1 1 1 1,2 ZOU Peng , ZHOU Zhi , CHEN Guo-Liang , JIANG He , GU Jun 1(National High Performance Computing Center at Hefei, Department of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, China) 2(Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, China) + Corresponding author: Phn: +86-551-3603747, Fax: +86-551-3601013, E-mail: Zouchar@ Received 2003-07-28; Accepted 2004-01-06 Zou P, Zhou Z, Chen GL, Jiang H, Gu J. Approximate-Backbone guided fast ant algorithms to QAP. Journal of Software, 2005,16(10):1691−1698. DOI: 10.1360/jos161691 Abstract: 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 approximate-backbone guided fast ant colony algorithm (ABFANT). The main idea is to fix the approximate- backbone 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 heuristi