A Discrete Particle Swarm Optimizer for Multi-Solution Problems

Masafumi KUBOTA  Toshimichi SAITO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E95-A   No.1   pp.406-409
Publication Date: 2012/01/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E95.A.406
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Nonlinear Problems
swarm intelligence,  optimization,  multi-solution problems,  

Full Text: PDF>>
Buy this Article

This letter studies a nesting discrete particle swarm optimizer for multi-solution problems. The algorithm operates in discrete search space and consists of two stages. The first stage is global search in rough lattice points for constructing local sub-regions each of which includes one target solution. The second stage is local search where the algorithm operates in parallel in fine lattice points of local subspaces and tires to find all the approximate solutions within a criterion. We then propose an application to finding multiple fixed points in nonlinear dynamical systems and investigate the algorithm efficiency.