粒子群优化算法在工件排序问题中的应用  

The Application of Particle Swarm Optimization Algorithm in Workpiece Sorting

作　　者：严坤妹 

机构地区：[1]福建商学院基础部,福建福州350012

出　　处：《福建商学院学报》2017年第2期96-100,共5页Journal of Fujian Business University

基　　金：福建省教育厅科技项目"度约束最小生成树拓扑结构的粒子群算法研究"(JB10221)

摘　　要：排序问题的求解和DCMST问题一样,一般是NP-hard的。度约束最小生成树(DCMST)问题按权矩阵W=(wij)n×n中wij是否等于wji可以分成两类,权矩阵是对称矩阵的DCMST问题已有很多启发式算法求解,其中有研究者提出了一种有效求解DCMST问题的模糊粒子群优化算法。针对工件排序问题,提出了应用粒子群优化算法求解排序问题的策略,并通过重新设计根树的prüfer数编码和初始粒子群的产生方法,使得基于prüfer数的模糊离散粒子群优化算法也能应用于权矩阵不是对称矩阵的DCMST问题的求解。The solution of the sort problem, is similar to DCMST, which is generally NP-hard. The niche minimum spanning tree problem can be divided into two categories, the weight matrix has many heuristic algorithms for DCMST problem of symmetric matrix. Some researchers have for DCMST problem. This paper proposes a strategy proposed an effective fuzzy particle swarm optimization algorithm to solve the sorting problem by using particle swarm optimization algorithm, and then uses Prufer number coding and primitive of DCMST, which is weight matrix not symmetric matrix particle group generation method to apply to the solution

关 键 词：排序问题 根树 Prufer数编码 粒子群优化算法 HAMILTON路 

分 类 号：O29[理学—应用数学]