|
|||||
|
|
| 求解多目标优化问题的灰色粒子群算法 | |
| 引用本文： | 于繁华,刘寒冰,戴金波.求解多目标优化问题的灰色粒子群算法[J].计算机应用,2006,26(12):2950-2952. |
| 作者姓名： | 于繁华 刘寒冰 戴金波 |
| 作者单位： | 1. 长春师范学院,信息技术学院,吉林,长春,130032;吉林大学,交通学院,吉林,长春,130025 2. 吉林大学,交通学院,吉林,长春,130025 3. 长春师范学院,信息技术学院,吉林,长春,130032 |
| 摘 要： | 鉴于基本粒子群算法无法解决高维多目标优化问题，提出了一种适合求解高维多目标优化问题的灰色粒子群算法(GPSO)，该算法根据灰色关联能够很好地分析目标矢量之间的接近程度，并能掌握解空间全貌的特点，利用灰色关联度的大小来选取粒子群算法中的全局极值和个体极值。实验结果证明，该算法可行而有效，同时也拓展了粒子群算法的应用领域。 |
| 关 键 词： | 灰色粒子群算法 灰色关联 多目标优化 |
| 文章编号： | 1001-9081（2006）12-2950-03 |
| 收稿时间： | 2006-06-29 |
| 修稿时间： | 2006-06-292006-09-13 |
Grey particle swarm algorithm for multi-objective optimization problems |
|
| YU Fan-hua,LIU Han-bing,DAI Jin-bo.Grey particle swarm algorithm for multi-objective optimization problems[J].journal of Computer Applications,2006,26(12):2950-2952. | |
| Authors: | YU Fan-hua LIU Han-bing DAI Jin-bo |
| Affiliation: | 1. College of Information technology, Changchun Normal University, Changchun Jilin 130032, China; 2. College of Trafic, Jilin University, Changchun Jilin 130025, China |
| Abstract: | Since the basic particle swarm algorithm cannot solve the problem of high-dimension objective optimization, a Grey Particle Swarm Optimization (GPSO) algorithm for high-dimension objective optimization was proposed. This method can analyze the degree of approach between objective vectors. And the panorama of the solution space can be controlled by this way. The global maximum and individual maximum in the particle swarm algorithm can be selected according to the degree of grey relevancy. Test results show that GPSO is feasible and effective, and it extends the application field of particle swarm algorithm. |
| Keywords: | grey particle swarm algorithm grey relevancy multi-objective optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机应用》浏览原始摘要信息 | |
| 点击此处可从《计算机应用》下载全文 | |