2013
DOI: 10.1155/2013/510763
|View full text |Cite
|
Sign up to set email alerts
|

Improving Vector Evaluated Particle Swarm Optimisation by Incorporating Nondominated Solutions

Abstract: The Vector Evaluated Particle Swarm Optimisation algorithm is widely used to solve multiobjective optimisation problems. This algorithm optimises one objective using a swarm of particles where their movements are guided by the best solution found by another swarm. However, the best solution of a swarm is only updated when a newly generated solution has better fitness than the best solution at the objective function optimised by that swarm, yielding poor solutions for the multiobjective optimisation problems. T… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…The PSO algorithm was firstly introduced by Kennedy and Eberhart in 1995 [ 30 ]. The PSO algorithm has been numerously enhanced fundamentally [ 31 , 32 ] and applied in many fields [ 33 – 35 ]. Fundamentally, the PSO algorithm follows several steps as described in Algorithm 1 : (1) initialization, (2) calculation of the fitness function, (3) updating the personal best ( pbest ) for each particle and global best ( gbest ), (4) updating the particle's velocity and the particle's position, and (5) performing termination based on a stopping criterion.…”
Section: Methodsmentioning
confidence: 99%
“…The PSO algorithm was firstly introduced by Kennedy and Eberhart in 1995 [ 30 ]. The PSO algorithm has been numerously enhanced fundamentally [ 31 , 32 ] and applied in many fields [ 33 – 35 ]. Fundamentally, the PSO algorithm follows several steps as described in Algorithm 1 : (1) initialization, (2) calculation of the fitness function, (3) updating the personal best ( pbest ) for each particle and global best ( gbest ), (4) updating the particle's velocity and the particle's position, and (5) performing termination based on a stopping criterion.…”
Section: Methodsmentioning
confidence: 99%
“…This algorithm is based on the movement and information sharing of particles in a multi-dimensional search space. The PSO algorithm has been numerously enhanced fundamentally [26,32] and applied in many fields [4,8,19]. A pseudo code of the PSO algorithm is described in Algorithm 1.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Due to this limitation, Lim et al [10] have introduced an improved VEPSO algorithm by incorporating nondominated solutions (VEPSOnds). In VEPSOnds, as specified by (8), the g Best m ( t ) is still the solution with best fitness at m -objective function but is selected from the set of nondominated solutions and not from all p Best mi ( t ) of the m -swarm gBestm={XPfm(X)=minfm(XP)}, where X is a nondominated solution and P is the set of nondominated solutions in the archive.…”
Section: Particle Swarm Optimisationmentioning
confidence: 99%
“…However, the VEPSO suffers from performance drawback. Therefore, it is improved by redefining the selection of the guidance from nondominated solution, known as VEPSOnds [ 10 ]. Although VEPSOnds has shown better performance than conventional VEPSO, the VEPSOnds suffers from weak performance in terms of lacking solution distributions and convergence to the true Pareto front.…”
Section: Introductionmentioning
confidence: 99%