A basic study of Integer Particle Swarm Optimization having deterministic dynamics
A basic study of Integer Particle Swarm Optimization having deterministic dynamics
复制标题
DOI：
10.1109/smc.2014.6973970
复制
发表时间：
2014-10
期刊：
影响因子：
--
通讯作者：
Yuya Kurita;T. Tsubone
中科院分区：
文献类型：
--
作者：
Yuya Kurita;T. Tsubone
本文提出了一种基于分段常数振子（IPSO-PCO）的细胞整数粒子群优化方法。指出了粒子群算法在粒子行为分析和硬件实现上的困难。针对这一问题，提出了一些确定性粒子群算法。在硬件实现和组合优化问题的应用方面，离散化也是需要的。本文提出了一种确定性的离散方法。我们将IPSO-PCO与一些重新定位到格点附近离散的PSO方法进行了比较，验证了所提方法的有效性。
In this paper, we propose a method celled Integer Particle Swarm Optimization based on Piecewise Constant Oscillator (IPSO-PCO). Well known Particle Swarm Optimization (PSO) is pointed out that it is hard to analyze particle behavior and to implementation of hardware. For this problem, some deterministic PSO have been proposed. Discretization is also desired in terms of implementation of hardware and application to combinational optimization problems. This paper proposes a deterministic and discrete method. We compare IPSO-PCO with some methods of PSO which discretized by repositioned to near lattice point and verify the effectiveness of propose method.