IEICE TRANSACTIONS on Fundamentals
A Discrete Particle Swarm Optimizer for Multi-Solution Problems
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.1 pp.406-409
- Publication Date
- 2012/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E95.A.406
- Type of Manuscript
- LETTER
- Category
- Nonlinear Problems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Masafumi KUBOTA, Toshimichi SAITO, "A Discrete Particle Swarm Optimizer for Multi-Solution Problems" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 1, pp. 406-409, January 2012, doi: 10.1587/transfun.E95.A.406.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.406/_p
Copy
@ARTICLE{e95-a_1_406,
author={Masafumi KUBOTA, Toshimichi SAITO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Discrete Particle Swarm Optimizer for Multi-Solution Problems},
year={2012},
volume={E95-A},
number={1},
pages={406-409},
abstract={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.},
keywords={},
doi={10.1587/transfun.E95.A.406},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - A Discrete Particle Swarm Optimizer for Multi-Solution Problems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 406
EP - 409
AU - Masafumi KUBOTA
AU - Toshimichi SAITO
PY - 2012
DO - 10.1587/transfun.E95.A.406
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2012
AB - 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.
ER -
English
