二次分配问题的粒子群算法求解

A Particle Swarm Optimization Algorithm for Quadratic Assignment Problem

文章采用了一种新的算法,即粒子群算法(PSO)去解决二次分配问题(QAP),构造了该问题的粒子表达方法,建立了此问题的粒子群算法模型,并对不同的二次分配问题算例进行了实验,结果表明:粒子群算法可以快速、有效地求得二次分配问题的优化解,是求解二次分配问题的一个较好方案。PSO算法在很多连续优化问题中已经得到较成功的应用,而在离散域上的研究和应用还很少。文章应用PSO算法解决QAP问题是一种崭新的尝试,它对于将PSO算法应用于离散问题,特别是组合优化问题无疑具有启发性,并为进一步深入研究奠定了基础。

In this paper,we use a particle swarm optimization algorithm to solve the quadratic assignment problem,and propose a novel Particle presentation for the problem.The results from the experiments on different QAP instances show that this algorithm is able to find good solutions quickly.PSO algorithm has got more successful application in many continuous optimization problems,but is seldom applied at dispersed land.It＇s a kind of brand-new try that the paper uses PSO algorithm to solve QAP problem.It is undoubtedly enlightening to apply PSO algorithm to the dispersed problem（especially the question of combination optimization）,and it will establish the foundation of further investigate.