Hierarchical dynamic neighborhood based Particle Swarm Optimization for global optimization

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86097050" target="_blank" >RIV/61989100:27240/11:86097050 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5949695" target="_blank" >http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5949695</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/CEC.2011.5949695" target="_blank" >10.1109/CEC.2011.5949695</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Hierarchical dynamic neighborhood based Particle Swarm Optimization for global optimization

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. In this article, we introduce a new variant of PSO referred to as Hierarchical D-LPSO (Dynamic Local Neighborhoodbased Particle Swarm Optimization). In this new variant of PSO the particles are arranged following a dynamic hierarchy. Within each hierarchy the particles search for better solution using dynamically varying sub-swarms i.e. these sub-swarms are regrouped frequently and information is exchanged among them. Whether a particle will move up or down the hierarchy depends on the quality of its so-far best-found result. The swarm is largely influenced by the good particles that move up in the hierarchy. Theperformance of Hierarchical D-LPSO is tested on the set of 25 numerical benchmark functions taken from the competition and special session on real parameter optimization held under IEEE Congress on Evolutionary Computation (CEC) 2005. Th

Název v anglickém jazyce

Hierarchical dynamic neighborhood based Particle Swarm Optimization for global optimization

Popis výsledku anglicky

Particle Swarm Optimization (PSO) is arguably one of the most popular nature-inspired algorithms for real parameter optimization at present. In this article, we introduce a new variant of PSO referred to as Hierarchical D-LPSO (Dynamic Local Neighborhoodbased Particle Swarm Optimization). In this new variant of PSO the particles are arranged following a dynamic hierarchy. Within each hierarchy the particles search for better solution using dynamically varying sub-swarms i.e. these sub-swarms are regrouped frequently and information is exchanged among them. Whether a particle will move up or down the hierarchy depends on the quality of its so-far best-found result. The swarm is largely influenced by the good particles that move up in the hierarchy. Theperformance of Hierarchical D-LPSO is tested on the set of 25 numerical benchmark functions taken from the competition and special session on real parameter optimization held under IEEE Congress on Evolutionary Computation (CEC) 2005. Th

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA102%2F09%2F1494" target="_blank" >GA102/09/1494: Nové metody přenosu dat založené na turbo kódech</a><br>

Návaznosti

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

Rok uplatnění

2011

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 statě ve sborníku

2011 IEEE Congress of Evolutionary Computation, CEC 2011

ISBN

978-1-4244-7834-7

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

757-764

Název nakladatele

IEEE

Místo vydání

Vienna

Místo konání akce

New Orleans

Datum konání akce

5. 6. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—