首页 | 本学科首页   官方微博 | 高级检索  
     

求解整数非线性规划结合正交杂交的离散PSO 算法
引用本文:张莉,冯大政,李宏.求解整数非线性规划结合正交杂交的离散PSO 算法[J].控制与决策,2012,27(9):1387-1392.
作者姓名:张莉  冯大政  李宏
作者单位:1. 西安电子科技大学雷达信号处理国家重点实验室,西安710071;西安电子科技大学数学系,西安710071
2. 西安电子科技大学雷达信号处理国家重点实验室,西安,710071
3. 西安电子科技大学数学系,西安,710071
基金项目:国家自然科学基金项目(60971111)
摘    要:针对整数非线性规划问题,提出一种结合正交杂交的离散粒子群优化(PSO)算法.首先采用舍入取整方法,为了减少舍入误差,对PSO中的每个粒子到目前为止的最好位置进行随机修正,将基于正交实验设计的正交杂交算子引入离散PSO算法,以增强搜索性能;然后对PSO算法中的惯性权重和收缩因子采用动态调整策略,以提高算法的搜索效率;最后对一些不同维数的整数非线性规划问题进行数值仿真实验,实验结果表明了所提出算法的有效性.

关 键 词:整数非线性规划  粒子群优化算法  正交杂交  离散粒子群优化算法
收稿时间:2011/1/11 0:00:00
修稿时间:2011/4/14 0:00:00

Discrete PSO combined with the orthogonal crossover for solving integer nonlinear programming
ZHANG Li , FENG Da-zheng , LI Hong.Discrete PSO combined with the orthogonal crossover for solving integer nonlinear programming[J].Control and Decision,2012,27(9):1387-1392.
Authors:ZHANG Li  FENG Da-zheng  LI Hong
Affiliation:b (a.National Lab of Radar Signal Processing,b.Department of Mathematics,Xidian University,Xi’an 710071,China.
Abstract:For solving the integer nonlinear programming problems,a discrete particle swarm optimization(PSO) algorithm combined with the orthogonal crossover is proposed.In the PSO algorithm,each particle of the swarm is truncated to the nearest integer after the determination of its new position,and then each particle’s best position till now is repaired by using a stochastic method to reduce the rounding error.The orthogonal crossover operator based on the orthogonal experimental design is integrated into discrete PSO algorithm to make a systematic and rational exploration.The inertia weight and constriction factor are dynamically adjusted to improve the efficiency of PSO algorithm.Some numerical examples with different dimensions are carried out and the experimental results show the effectiveness of the proposed algorithm.
Keywords:integer nonlinear programming  particle swarm optimization  orthogonal crossover  discrete particle swarm optimization
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《控制与决策》浏览原始摘要信息
点击此处可从《控制与决策》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号