求解二次分配问题的预处理快速蚂蚁系统  

Preprocessing Fast Ant System for Quadratic Assignment Problem

作　　者：吴果林[1] 李学迁[2] 

机构地区：[1]桂林航天工业学院理学部,桂林541004 [2]上海理工大学管理学院,上海200093

出　　处：《上海理工大学学报》2014年第2期135-140,共6页Journal of University of Shanghai For Science and Technology

基　　金：国家自然科学基金资助项目(11271088);上海理工大学国家级项目培育基金资助项目(13XGQ05);上海理工大学人文社科基金资助项目(12XSY08)

摘　　要：分析了快速蚂蚁系统(FANT)跳出迭代最优解的策略,指出算法易发生停滞现象的原因,并通过改进算法解的构建步,引入一个变动的参数,提出了求解二次分配问题的一种新算法———预处理快速蚂蚁系统(PFANT).新算法改进了FANT算法易发生停滞的现象,拓宽了迭代最优解邻域的搜索范围,提高了二次分配问题解的质量.For a fast ant system （FANT）, the strategy for jumping out of local optimal solution was analysed,and the reason that the algorithm is easy to occur stagnation phenomenon was pointed out. Through the improvement of the solution construction step in the algorithm and the introduction of a variable parameter, a new algorithm for quadratic assignment problem- preprocessing fast ant system （PFANT） was proposed. The new algorithm mends FANT＇s some shortcomings such as stagnation, extends the search area of FANT iterative optimal solution neighbourhood and improves the solution quality.

关 键 词：二次分配问题 快速蚂蚁系统 停滞 变参数 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]