模拟退火蚁群算法求解二次分配问题  

Simulated annealing ant colony algorithm for QAP

作　　者：朱经纬[1] 芮挺[1] 蒋新胜[1] 张金林[1] 

机构地区：[1]解放军理工大学工程兵工程学院,南京210007

出　　处：《计算机工程与应用》2011年第14期34-36,共3页Computer Engineering and Applications

基　　金：国家自然科学基金 No.50608069~~

摘　　要：提出了一种求解二次分配问题的模拟退火蚁群算法。将模拟退火机制引入蚁群算法,在算法中设定随迭代变化的温度,将蚁群根据信息素矩阵搜索得到的解集作为候选集,根据当前温度按照模拟退火机制由候选集生成更新集,利用更新集更新信息素矩阵,并利用当前最优解对信息素矩阵进行强化。当算法出现停滞对信息素矩阵进行重置。实验表明,该算法有着高的稳定性与收敛速度。A simulated annealing ant colony algorithm is presented to tackle the Quadratic Assignment Problem（QAP）.The simulated annealing method is introduced to the ant colony algorithm.By setting the temperature which changes with the iter- ative,after each turn of circuit,the solution set got by the colony is taken as the candidate set,the update set is gotten by accepting the solutions in the candidate set with the probability determined by the temperature.The candidate set is used to update the trail information matrix.In each turn of updating the tail information,the best solution is used to enhance the tail information.The tail information matrix is reset when the algorithm is in stagnation.The computer experiments demonstrate this algorithm has high calculation stability and converging speed

关 键 词：二次分配问题 蚁群算法 模拟退火 候选集 更新集 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]