| 基于粒子群算法求解整数规划的改进方法 |
| |
| 引用本文： | 杨荣华,刘建华.基于粒子群算法求解整数规划的改进方法[J].福建工程学院学报,2011,9(4):347-350. |
| |
| 作者姓名： | 杨荣华 刘建华 |
| |
| 作者单位： | 福建工程学院计算机与信息科学系,福建福州,350108 |
| |
| 摘 要： | 标准粒子群算法主要用于优化连续性,而对粒子群算法求解非线性整数规划,算法的粒子位置必须解决取整问题。基此,文章提出一种粒子位置最终取整的方法,以改进粒子群算法解决整数规划的具体过程。基准函数的仿真结果表明,改进后的取整方法的搜索成功率优于直接取整和随机取整,综合搜索效率更佳。
|
| 关 键 词： | 粒子群算法 整数规划 最终取整 优化算法 |
Improvement of solving integer programming based on particle swarm optimization |
| |
| Yang Ronghua,Liu Jianhua.Improvement of solving integer programming based on particle swarm optimization[J].Journal of Fujian University of Technology,2011,9(4):347-350. |
| |
| Authors: | Yang Ronghua Liu Jianhua |
| |
| Institution: | Yang Ronghua,Liu Jianhua(Computer and Information Science Department,Fujian University of Technology,Fuzhou 350108,China) |
| |
| Abstract: | The standard particle swarm optimization(PSO) algorithm is mainly used in optimizing the solution to continuous problems.Solving nonlinear integer programming with PSO requires that the location of particles be rounded.A final rounding method of particle location is presented,which can improve PSO for integer programming.The simulation results of benchmark functions show that the new rounding method outperforms the direct rounding and random rounding methods with higher searching efficiency. |
| |
| Keywords: | particle swarm optimization(PSO) integer programming final rounding optimi-zation algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
