2013
DOI: 10.12733/jics20101634
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Quantum-behaved Particle Swarm Optimization Algorithm Based on Chaos Theory Exerting to Local Optimal Position

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…In order to compare the feasibility and performance of RQPSO, RRQPSO and SRQPSO with those of QPSO in this section, there are four nonlinear benchmark testing functions that are commonly used in [5], [6], [15]. These functions, the admissible range of the variable and the optimum are summarized in following.…”
Section: Algorithm Testingmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to compare the feasibility and performance of RQPSO, RRQPSO and SRQPSO with those of QPSO in this section, there are four nonlinear benchmark testing functions that are commonly used in [5], [6], [15]. These functions, the admissible range of the variable and the optimum are summarized in following.…”
Section: Algorithm Testingmentioning
confidence: 99%
“…An improved PSO(IPSO) is presented in [5], in the IPSO process, the population is divided into several subgroups, the entire population is shuffled at periodic stages in the evolution, and then points are reassigned to subgroups to ensure information sharing. Pan [6] proposed an improved particle swarm optimization algorithm based on the optimal and sub-optimal position(OSP-PSO). OSP-PSO enlarges the search space and enhances global search ability, and adopts mutation operator to keep the swarm's diversity.…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, it explores the optimum solution at a low computational effort. Pan [34] introduced the chaos theory into QPSO; and the proposed method uses a logistic map to generate a set of chaotic offsets and produces multiple positions around every local optimal position of the particle, and thus, convergence accuracy is better than that in typical QPSO. Sun [35] proposed modified QPSO, which substitutes the global best position (gbest) by a personal best position (pbest) of a randomly selected particle, thus exhibiting stronger global search capability than QPSO and PSO.…”
Section: Introductionmentioning
confidence: 99%