2011 IEEE Congress of Evolutionary Computation (CEC) 2011
DOI: 10.1109/cec.2011.5949835
|View full text |Cite
|
Sign up to set email alerts
|

The neighborhood of canonical deterministic PSO

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
16
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
2

Relationship

3
3

Authors

Journals

citations
Cited by 10 publications
(18 citation statements)
references
References 11 publications
0
16
0
Order By: Relevance
“…In graph theory, the distance between two vertices is the number of the edges in a shortest path connecting them. Roughly speaking, longer average distance tends to give better search performance [9].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In graph theory, the distance between two vertices is the number of the edges in a shortest path connecting them. Roughly speaking, longer average distance tends to give better search performance [9].…”
Section: Introductionmentioning
confidence: 99%
“…There are a variety of network topologies to be represented in the complex network [8]. In order to clarify the relationship between the network topology and the searching performance, the average distance of the network is a basic measure [9]. In graph theory, the distance between two vertices is the number of the edges in a shortest path connecting them.…”
Section: Introductionmentioning
confidence: 99%
“…Since the deterministic dynamical systems have strong analysis theory of the stability, several deterministic PSOs have been presented and their stability has been analyzed [10]. We have also proposed the canonical deterministic particle swarm optimization (CD-PSO) where the deterministic parameters are normalized and the dynamics is described by a canonical form equation [11]- [13]. The CD-PSO is convenient to grasp the effects of parameters on stability and dynamics.…”
Section: Introductionmentioning
confidence: 99%
“…The information translation structure of particles can be regarded as a network structure. Several researchers have studied the relatioship between the search performance and the network structure [17] [18]. A ring structure is effective for searching for the optimum value of a multimodal function.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Comparing these structures, the full connection exhibits quicker convergence. On the other hand, the ring structure exhibits an extraordinary search performance for a multimodal function [17][18].…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%