Inter-particle communication and search-dynamics of lbest particle swarm optimizers: An analysis

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86092955" target="_blank" >RIV/61989100:27240/12:86092955 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.ins.2010.10.015" target="_blank" >http://dx.doi.org/10.1016/j.ins.2010.10.015</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ins.2010.10.015" target="_blank" >10.1016/j.ins.2010.10.015</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Inter-particle communication and search-dynamics of lbest particle swarm optimizers: An analysis

Popis výsledku v původním jazyce

Particle Swarm Optimization (PSO) is arguably one of the most popular nature-inspired algorithms for real parameter optimization at present. The existing theoretical research on PSO focuses on the issues like stability, convergence, and explosion of theswarm. However, all of them are based on the gbest (global best) communication topology, which usually is susceptible to false or premature convergence over multi-modal fitness landscapes. The present standard PSO (SPSO 2007) uses an lbest (local best) topology, where a particle is stochastically attracted not towards the best position found in the entire swarm, but towards the best position found by any particle in its topological neighborhood. This article presents a first step towards a probabilisticanalysis of the particle interaction and information exchange in an lbest PSO with variable random neighborhood topology (as found in SPSO 2007). It addresses issues like the distribution of particles over neighborhoods, the probability

Název v anglickém jazyce

Inter-particle communication and search-dynamics of lbest particle swarm optimizers: An analysis

Popis výsledku anglicky

Particle Swarm Optimization (PSO) is arguably one of the most popular nature-inspired algorithms for real parameter optimization at present. The existing theoretical research on PSO focuses on the issues like stability, convergence, and explosion of theswarm. However, all of them are based on the gbest (global best) communication topology, which usually is susceptible to false or premature convergence over multi-modal fitness landscapes. The present standard PSO (SPSO 2007) uses an lbest (local best) topology, where a particle is stochastically attracted not towards the best position found in the entire swarm, but towards the best position found by any particle in its topological neighborhood. This article presents a first step towards a probabilisticanalysis of the particle interaction and information exchange in an lbest PSO with variable random neighborhood topology (as found in SPSO 2007). It addresses issues like the distribution of particles over neighborhoods, the probability

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F09%2F0990" target="_blank" >GA201/09/0990: Zpracování XML dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Information sciences

ISSN

0020-0255

e-ISSN

—

Svazek periodika

182

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

13

Strana od-do

156-168

Kód UT WoS článku

000297403300012

EID výsledku v databázi Scopus

—