About: A Performance Class-Based Particle Swarm Optimizer

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Performance Class-Based Particle Swarm Optimizer Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : wasabi.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	A Performance Class-Based Particle Swarm Optimizer
Creator	Gulan, Maja Niu, Ben Tungom, Chia
Source	PMC
abstract	One of the main concerns with Particle Swarm Optimization (PSO) is to increase or maintain diversity during search in order to avoid premature convergence. In this study, a Performance Class-Based learning PSO (PCB-PSO) algorithm is proposed, that not only increases and maintains swarm diversity but also improves exploration and exploitation while speeding up convergence simultaneously. In the PCB-PSO algorithm, each particle belongs to a class based on its fitness value and particles might change classes at evolutionary stages or search step based on their updated position. The particles are divided into an upper, middle and lower. In the upper class are particles with top fitness values, the middle are those with average while particles in the bottom class are the worst performing in the swarm. The number of particles in each group is predetermined. Each class has a unique learning strategy designed specifically for a given task. The upper class is designed to converge towards the best solution found, Middle class particles exploit the search space while lower class particles explore. The algorithm’s strength is its flexibility and robustness as the population of each class allows us to prioritize a desired swarm behavior. The Algorithm is tested on a set of 8 benchmark functions which have generally proven to be difficult to optimize. The algorithm is able to be on par with some cutting edge PSO variants and outperforms other swarm and evolutionary algorithms on a number of functions. On complex multimodal functions, it is able to outperform other PSO variants showing its ability to escape local optima solutions.
has issue date	2020-06-22(xsd:dateTime)
bibo:doi	10.1007/978-3-030-53956-6_16
has license	no-cc
sha1sum (hex)	2cbb4c5c50adf1868107fca2db121de60ced1352
schema:url	https://doi.org/10.1007/978-3-030-53956-6_16
resource representing a document's title	A Performance Class-Based Particle Swarm Optimizer
has PubMed Central identifier	PMC7354807
schema:publication	Advances in Swarm Intelligence
resource representing a document's body	covid:2cbb4c5c50adf1868107fca2db121de60ced1352#body_text
is schema:about of	named entity 'The upper class' named entity 'solution' named entity 'Performance' named entity 'LOWER' named entity 'GROUP' named entity 'SOLUTIONS' named entity 'PROPOSED' named entity 'CHANGE' named entity 'EDGE' named entity 'DIFFICULT' named entity 'CUTTING' named entity 'FLEXIBILITY' named entity 'OPTIMIZATION' named entity 'VALUE' named entity 'simultaneously' named entity 'functions' named entity 'optimize' named entity 'updated' named entity 'Performance' named entity 'divided' named entity 'number' named entity 'worst' named entity 'PSO' named entity 'evolutionary algorithms' named entity 'PSO' named entity 'PSO' named entity 'algorithm' named entity 'algorithm' named entity 'Particle Swarm Optimization' named entity 'algorithm' named entity 'algorithm' named entity 'PSO' named entity 'velocity' named entity 'search space' named entity 'PSO' named entity 'PSO' named entity 'search space' named entity 'PSO' named entity 'topology' named entity 'algorithm' named entity 'optimization problems' named entity 'topology' named entity 'algorithm' named entity 'algorithm' named entity 'topology' named entity 'PSO' named entity '1, 2' named entity 'middle class' named entity 'PSO' named entity 'PSO' named entity 'PSO' named entity 'unimodal' named entity 'PSO' named entity 'algorithm' named entity 'stochastic' named entity 'algorithm' named entity 'probability' named entity 'velocity' named entity 'algorithm' named entity 'search algorithm' named entity 'fish school' named entity 'search space' named entity 'algorithm' named entity 'search algorithm' named entity 'PSO' named entity 'algorithm' named entity 'good performance' named entity 'algorithm' named entity 'PSO' named entity 'PSO' named entity 'velocity' named entity 'probability' named entity 'algorithm' named entity 'topology' named entity 'algorithm' named entity 'premature convergence' named entity 'swarm behavior' named entity 'algorithm' named entity 'optimization problem' named entity 'PSO' named entity 'inversely proportional'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software