An improved diversity-guided particle swarm optimisation for numerical optimisation (Q2341494): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1504/ijcsm.2014.059381 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2082041389 / rank | |||
Normal rank |
Latest revision as of 08:52, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved diversity-guided particle swarm optimisation for numerical optimisation |
scientific article |
Statements
An improved diversity-guided particle swarm optimisation for numerical optimisation (English)
0 references
24 April 2015
0 references
Summary: Particle swarm optimisation (PSO) is a global optimisation technique, which has shown a good performance on many problems. However, PSO easily falls into local minima because of quick losing of diversity. Some diversity-guided PSO algorithms have been proposed to maintain diversity, but they often slow down the convergence rate. In this paper, we propose an improved diversity-guided PSO algorithm, which employs a local search to enhance the exploitation. In addition, a concept of generalised opposition-based learning is utilised for population initialisation and generation jumping to find high quality of candidate solutions. Experiments are conducted on a set of benchmark functions. Results show that our approach obtains a promising performance when compared with other PSO variants.
0 references
particle swarm optimisation
0 references
diversity
0 references
local search
0 references
generalised opposition-based learning
0 references
numerical optimisation
0 references
numerical examples
0 references
global optimisation
0 references
algorithm
0 references