| 基于布尔型粒子群优化算法的网络编码优化 |
| |
| 引用本文： | 黄志杨,高鹰. 基于布尔型粒子群优化算法的网络编码优化[J]. 计算机工程与设计, 2012, 33(2): 724-729 |
| |
| 作者姓名： | 黄志杨 高鹰 |
| |
| 作者单位： | 1. 广州大学数学与信息科学学院,广东广州,510006
2. 广州大学计算机与教育软件学院,广东广州,510006 |
| |
| 摘 要： | 针对布尔型粒子群优化算法存在容易陷入局部极值和收敛速度慢的缺点,提出一种带扰动因子的自适应调整惯性权重和学习因子取1概率的布尔型粒子群优化算法,并把这种改进的布尔型粒子群优化算法用于网络编码的优化以得到具有最小编码边的编码方案.对两个人工拓扑进行优化得到的结果表明,基于布尔型粒子群优化算法最小化编码边方案的收敛速度和精度都优于基于遗传算法最小化编码边的方案的速度和精度,能有效用于网络编码的优化.
|
| 关 键 词： | 二进制粒子群优化 离散粒子群优化 网络编码 网络编码优化 最小化编码边 |
Network coding optimization of particle swarm optimization algorithm based on Boolean |
| |
| HUANG Zhi-yang , GAO Ying. Network coding optimization of particle swarm optimization algorithm based on Boolean[J]. Computer Engineering and Design, 2012, 33(2): 724-729 |
| |
| Authors: | HUANG Zhi-yang GAO Ying |
| |
| Affiliation: | 1.College of Math and Information Science,Guangzhou University,Guangzhou 510006,China; 2.College of Computer Science and Education Software,Guangzhou University,Guangzhou 510006,China) |
| |
| Abstract: | Boolean type particle swarm optimization algorithm existing easy to fall into local extremum and slow convergence speed,an improved Boolean type particle swarm optimization algorithm is proposed,which with disturbance factor and adaptive adjustments the probability take 1 in inertia and learning factor,then the improved Boolean type particle swarm optimization algorithm is used for network coding optimization to get with the lowest coding edge coding scheme.The results of two artificial topology optimization show that Boolean particle swarm optimization scheme to minimize edge coding speed and accuracy are superior to the minimize edge scheme of the program code based on genetic algorithm,the formers is effectively used to network coding optimization. |
| |
| Keywords: | binary particle swarm optimization discrete particle swarm optimization network coding network coding optimization minimize coding edge |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
