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

Preprocessing Fast Ant System for Quadratic Assignment Problem

分析了快速蚂蚁系统(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.