摘要
分析了二进制粒子群优化算法(BPSO)的缺陷。为克服此缺陷提出了“粒子位置的双重结构编码”的概念,以此为基础给出一种新的二进制粒子群优化算法———具有双重结构编码的二进制粒子群优化算法(简称DS_BPSO)。DS_BPSO算法既保留了PSO的优点,又非常适用于求解离散优化问题。对随机3-SAT测试实例的数值计算表明:该算法的性能远远超过BPSO算法。
In this paper, the shortcoming of BPSO is first found by analysing in theory. Then, for overcoming the shortcoming, the concept of ＂Double-Structure Coding＂ of particle＇s position are proposed. Moreover, using the concept, we advanced a new binary particle swarm opti- mization that is Binary Particle Swarm Optimization with Double-Structure Coding （DS_BPSO）. The new algorithm not only keeps the virtue of IX50 but also adapts to solve the discrete problems. For random 3-SAT test instances, the numeral experiment indicate that DS_BPSO has the advantage over BPSO algorithm.
出处
《计算机应用与软件》
CSCD
北大核心
2007年第1期157-159,共3页
Computer Applications and Software
作者简介
贺毅朝，讲师，主研领域；密码学、智能算法和计算复杂性理论。
