| 求解指派问题的交叉粒子群优化算法 |
| |
| 引用本文： | 高尚,杨静宇,吴小俊. 求解指派问题的交叉粒子群优化算法[J]. 计算机工程与应用, 2004, 40(8): 54-55 |
| |
| 作者姓名： | 高尚 杨静宇 吴小俊 |
| |
| 作者单位： | 南京理工大学计算机系,南京,210094;华东船舶工业学院电子与信息系,镇江,212003;南京理工大学计算机系,南京,210094;华东船舶工业学院电子与信息系,镇江,212003 |
| |
| 摘 要： | 粒子群优化是由Kennedy和Eberhart于1995年根据鸟或鱼群居社会行为而提出的,经典的粒子群是一个有效的寻找连续函数极值的方法。结合遗传算法的交叉粒子群算法解决了指派问题,实例证实它是一种简单有效的算法。
|
| 关 键 词： | 粒子群 优化 指派问题 |
| 文章编号： | 1002-8331-(2004)08-0054-02 |
Using Particle Swarm Optimization Algorithm with Crossover to Solve Assignment Problem |
| |
| Gao Shang , Yang Jingyu Wu Xiaojun. Using Particle Swarm Optimization Algorithm with Crossover to Solve Assignment Problem[J]. Computer Engineering and Applications, 2004, 40(8): 54-55 |
| |
| Authors: | Gao Shang Yang Jingyu Wu Xiaojun |
| |
| Affiliation: | Gao Shang 1,2 Yang Jingyu 1 Wu Xiaojun 21 |
| |
| Abstract: | Particle swarm optimization(PSO)is an evolutionary computation technique developed by Kennedy and Eber-hart in1995,inspired by social behavior of bird flocking or fish schooling.The classical Particle Swarm Optimization is a powerful method to find the minimum of a numerical function,on a continuous definition domain.The particle Swarm optimization algorithm combined the ideal of the genetic algorithm is tested to solve Assignment problem.It is proved that this method is a simple and effective algorithm. |
| |
| Keywords: | Particle swarm Optimization Assignment problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
