摘要
采用基于整数编码方式的连续粒子群算法解决重叠联盟生成问题.设计了粒子的编码方式,给出了编码有效性检查方法和无效编码的修正算法.为提高种群多样性,提出了粒子位置的二阶段初始化方法;针对粒子易陷入局部极值问题,给出了粒子重新初始化机制.对出现停滞现象的粒子群,围绕其加权重心位置重新初始化,引导粒子突破了局部极值的限制.最后,通过实验验证了算法的有效性.
An improved continuous particle swarm optimization （PSO） algorithm was proposed to solve the overlapping coalition generation problem. During the process of solution, an integer based encoding strate gy was proposed which could represent the resource distribution of each agent to every task coalition, and the validation and revision algorithms for particle encoding were also presented. In order to improve the di- versity of the swarm, a two-stage initialization method of particle position was proposed. In the evolution process, the swarm trapping at the stagnation was reinitialized around its weighted centroid position, which could guide the swarm to avoid local extremum and accelerate the convergence of the algorithm. Contrastive experiments indicate that the proposed algorithm is effective.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2013年第12期1918-1923,共6页
Journal of Shanghai Jiaotong University
关键词
重叠联盟生成
粒子群算法
整数编码
二阶段初始化
编码修正
重新初始化机制
overlapping coalition generation （OCG）
particle swarm optimization PS（））
integer enco-ding
encoding revise
two stage initialization
code revise
reinitialized mechanism
