非线性整数规划问题的改进粒子群优化算法 |
| |
引用本文: | 任再敏,高岳林,李济民,朱栋.非线性整数规划问题的改进粒子群优化算法[J].武汉水运工程学院学报,2012(6):1296-1300. |
| |
作者姓名: | 任再敏 高岳林 李济民 朱栋 |
| |
作者单位: | [1]山西工商学院基础教学部,太原030006 [2]北方民族大学信息与系统科学研究所,银川750021 [3]山西省保德县林遮峪中学,忻州036600 |
| |
基金项目: | 国家自然科学基金项目(批准号:60962006)、宁夏高等学校科研项目(批准号:2009JY008)资助 |
| |
摘 要: | 提出了一种求解非线性整数规划问题的改进粒子群优化算法.在这个算法里,对粒子群优化模型的速度方程和位置方程进行改进,加入了动态约束处理技术以提高选择最优点的能力;加入了粒子的邻域加速寻优策略以提高局部优化能力.数值结果表明所提出的算法计算精度高且稳定性好.
|
关 键 词: | 非线性整数规划 粒子群优化 动态目标约束处理技术 邻域加速寻优策略 |
Improved Particle Swarm Optimization Algorithm for Nonlinear Integer Programming Problems |
| |
Authors: | REN Zaimin GAO Yuelin LI Jimin ZHU Dong |
| |
Institution: | (Department of Basic Education ,Shanxi Business College, Taiyuan 030006,China;Institute of Information and System Science, Northern University for Nationalities, Yinchuan 750021, China;Shanxi Province Baode County Lin Zhe Yu Middle School, Xinzhou 036600,China) |
| |
Abstract: | An improved particle swarm optimization algorithm is given to solve nonlinear integer pro- gramming problems. In the algorithm, the velocity equation and the position equation of the particle swarm optimization model are improved, and a dynamic-objective constraint-handing method is used to improve the ability to select the optimal points and the acceleration optimization strategies of the parti- cle's neighborhood is joined to improve the local optimal ability. Experimental results show that the proposed algorithm has a high solution efficiency and stability. |
| |
Keywords: | nonlinear integer programming particle swarm optimization dynamic-objective constraint- handing method neighborhood acceleration optimal strategy |
本文献已被 维普 等数据库收录! |