| 求解DCMST问题的模糊离散粒子群优化算法 |
| |
| 引用本文： | 严坤妹,王镌,林娟,陈艳平.求解DCMST问题的模糊离散粒子群优化算法[J].莆田学院学报,2011,18(5):59-63,68. |
| |
| 作者姓名： | 严坤妹 王镌 林娟 陈艳平 |
| |
| 作者单位： | 1. 福建商业高等专科学校基础部,福建福州,350012
2. 福建商业高等专科学校信息管理工程系,福建福州,350012 |
| |
| 基金项目： | 福建省教育厅科技资助项目(JB10221) |
| |
| 摘 要： | 提出了一种求解度约束最小生成树问题(DCMST)的模糊离散粒子群优化算法(PSO),粒子编码采用Prüfer数编码机制,并引入模糊矩阵产生Prüfer数,迭代过程中加入归一化运算对位置矩阵进行修正,利用最大数法进行解模糊化。通过仿真实验验证了算法的有效性。
|
| 关 键 词： | 最小生成树 粒子群优化算法 度约束 模糊矩阵 |
For the Degree Constrained Minimum Spanning Tree Problem of Fuzzy Discrete Particle Swarm Optimization Algorithm |
| |
| YAN Kun-mei,WANG Juan,LIN Juan,CHEN Yan-ping.For the Degree Constrained Minimum Spanning Tree Problem of Fuzzy Discrete Particle Swarm Optimization Algorithm[J].journal of putian university,2011,18(5):59-63,68. |
| |
| Authors: | YAN Kun-mei WANG Juan LIN Juan CHEN Yan-ping |
| |
| Institution: | YAN Kun-mei1,WANG Juan2,LIN Juan1,CHEN Yan-ping1(1.The Foundation Department,Fujian Commercial College,Fuzhou Fujian 350012,China,2.Information Management Engineering Department,China) |
| |
| Abstract: | This paper puts forward a kind of degree-constrained minimum spanning tree problem of fuzzy discrete particle swarm optimization algorithm.In the new algorithm,particle encoding using Prüfer number coding mechanism,and the introduction of fuzzy matrices to generate Prüfer number,iterative process to join the normalized operation of position matrix correction,using the maximum number of defuzzification method.The simulation results show the effectiveness of the algorithm. |
| |
| Keywords: | minimum spanning tree particle swarm optimization algorithm degrees constraints fuzzy matrices |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
