摘要
提出了一种新的粒子群优化算法来求解无约束的整数规划问题,粒子在[0,1]空间内运动,并与整数空间对应。对粒子群优化算法参数的合理选取进行了实验分析,给出了算法参数选取的基本原则。数值试验计算结果表明该方法比较有效,并具有通用性。
A new particle swarm optimization algorithm for unconstrained nonlinear integer optimization problem is present. The particles move around the set of [ 0, 1 ] space, which correspond with the integer space. Experimental analyses are carried out on the reasonable selection on the parameters of this algorithm, and basic principles for the parameter selection are provided. Results of numerical tests show the effectiveness and generality of the method.
出处
《微计算机应用》
2007年第2期126-130,共5页
Microcomputer Applications
关键词
运筹学
粒子群优化算法
整数规划
operations research,particle swarm optimization, integer programming
