含边界变异的粒子群算法  

A PSO with Bounded Mutation Operator

作　　者：付国江[1] 王少梅[2] 刘舒燕[3] 李宁[1] 

机构地区：[1]武汉理工大学计算机科学与技术学院,武汉430070 [2]武汉理工大学物流工程学院,武汉430063 [3]武汉理工大学管理学院,武汉430063

出　　处：《武汉理工大学学报》2005年第9期101-103,114,共4页Journal of Wuhan University of Technology

基　　金：交通部博士基金(200332581106).

摘　　要：提出了一种新的粒子群优化算法(PSO)———带边界变异的PSO,其原理是:在迭代的过程中,当粒子的位置超出可行域时,带边界变异的PSO让粒子的位置重新均匀分布在边界附近;当粒子的速度超出可行域时,则使其均匀分布到整个可行区间,而不是像原始PSO那样在这2种情况下都只是简单地取边界值。从理论和实验2个方面论证了这种引入了边界变异的PSO可以获得更快的寻优速度和更好的解精度,有一定的推广价值。A new particle swarm optimization （PSO）, PSO with bounded mutation operator, was developed. In contrast to the original PSO, in this algorithm, PSO with bounded mutation operator would make the particles redistributed cquably close to boundary when place of particle exceeds feasible region during iteration. The particles would be redistributed equably in whole feasible region when speed of particle exceeds feasible region. PSO with bounded mutation operator could achieve faster speed of optimization and better precision of optimization, which was proved by the theory and experimental methods.

关 键 词：PSO 边界变异 优化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]