|
|||||
|
|
| 基于二进制交叉和变异的粒子群算法及应用 | |
| 引用本文： | 刘衍民,牛奔,赵庆祯. 基于二进制交叉和变异的粒子群算法及应用[J]. 计算机科学, 2011, 38(5): 227-230 |
| 作者姓名： | 刘衍民 牛奔 赵庆祯 |
| 作者单位： | 1. 遵义师范学院数学系,遵义,563002;山东师范大学管理与经济学院,济南,250014 2. 深圳大学管理学院,深圳,518060 3. 山东师范大学管理与经济学院,济南,250014 |
| 基金项目： | 本文受国家863项目(2008AA04A105)和贵州教育厅社科项目(0705204)资助。 |
| 摘 要： | 粒子群算法在求解多峰问题时极易陷入局部最优解，提出了基于模拟二进制交叉和多项式变异的粒子群算法(sPDPSO>。在该算法中，为了更好地利用每个粒子的历史信息，引入了外部存档存储每个粒子的最优位置( pbest) ;同时，对外部存档中的pbest进行二进制交叉，而对新产生的全局最优粒子进行多项式变异。基准函数的测试结果显示，SPDPS()算法在求解多峰问题上有一定的优势。在实际应用中，以TSP为研究对象，结果显示SPDPSO算法获得了比其它算法更好的解。 |
| 关 键 词： | 粒子群算法，模拟二进制交叉，多项式变异 |
Particle Swarm Optimizer with Simulated Binary Crossover and Polynomial Mutation and its Application |
|
| LIU Yan-min,NIU Ben,ZHAO Qing-zhen. Particle Swarm Optimizer with Simulated Binary Crossover and Polynomial Mutation and its Application[J]. Computer Science, 2011, 38(5): 227-230 | |
| Authors: | LIU Yan-min NIU Ben ZHAO Qing-zhen |
| Affiliation: | (Department of Math, Zunyi Normal College, Zunyi 563002,China) (School of Management and Economics,Shandong Normal University,Jinan 250014,China) (College of Management,Shenzhen University,Shenzhen 518060,China) |
| Abstract: | PSO may easily get trapped in a local optimum, when it comes to solving multimodal problems. In view of the default, we presented a variant of particle swarm optimizer(PSO) with simulated binary crossover and polynomial mutation(SPDPSO for short). In SPDPSO, additionally, the external archive was introduced to store the personal best performing particle(pbest) , and simulated binary crossover and polynomial mutation were used to produce new particles. In benchmark function, the results demonstrate good performance of the SPDPSO algorithm in solving complex multimodal problems compared with the other algorithms. In practical application, the experimental results show that the SPDPSO algorithm can achieve better solutions that other PSOs. |
| Keywords: | Particle swarm optimizer Simulated binary crossover Polynomial mutation |
| 本文献已被 万方数据 等数据库收录！ | |
| 点击此处可从《计算机科学》下载全文 | |