| 集合划分问题的粒子群优化算法 |
| |
| 引用本文： | 高尚 候志远. 集合划分问题的粒子群优化算法[J]. 江苏科技大学学报(社会科学版), 2005, 19(6): 41-44 |
| |
| 作者姓名： | 高尚 候志远 |
| |
| 作者单位： | 江苏科技大学电子信息学院,江苏,镇江,212003;江苏科技大学电子信息学院,江苏,镇江,212003 |
| |
| 摘 要： | 建立了集合划分问题的优化数学模型，结合遗传算法的思想提出的粒子群算法来解决集合划分问题。经过比较测试，6种粒子群算法的效果都比较好，特别交叉策略A和变异策略A的混合粒子群算法是最好的且简单有效的算法。
|
| 关 键 词： | 粒子群 集合划分问题 贪心法 优化 |
| 文章编号： | 1673-4807（2005）06-0041-04 |
| 收稿时间： | 2005-04-07 |
| 修稿时间： | 2005-04-07 |
Particle Swarm Optimization Algorithm for Set Partition Problem |
| |
| GAO Shang , HOU Zhiyuan. Particle Swarm Optimization Algorithm for Set Partition Problem[J]. Journal of Jiangsu University of Science and Technology(Natural Science Edition), 2005, 19(6): 41-44 |
| |
| Authors: | GAO Shang HOU Zhiyuan |
| |
| Affiliation: | School of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang Jiangsu 212003, China |
| |
| Abstract: | An optimal mathematical model of set partition problem is given. The particle swarm optimization algorithm combined with the idea of genetic algorithm is recommended so as to solve the set partition problem. All the 6 particle swarm optimization algorithms presented are proved effective. Especially the particle swarm optimization algorithm with across strategy A and mutation strategy A is simple and more effective than others. |
| |
| Keywords: | particle swarm set partition problem greedy methods optimization |
| 本文献已被 维普 万方数据 等数据库收录！ |
