Optimization of the Particle Swarm Algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F14%3APU110331" target="_blank" >RIV/00216305:26220/14:PU110331 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Optimization of the Particle Swarm Algorithm

Popis výsledku v původním jazyce

Particle Swarm Optimization is a swarm intelligence based and stochastic algo- rithm to solve the optimization problem. This paper presents the Multidimensional Particle Swarm algorithm with non-equidistant discrete input data such as E-Series or Renard numbers for circuit design. The authors describe the optimization of this method for different circuit designs, agent recycling, and omission of already computed points. The problem of omission of already computed points is to determinate when it is faster to omit the points than compute them. The personal omission history can be used for agent recycling or trajectory corrections. There is also described effect of recycled agents with corrected parameters on the convergence of optimalization. Parameters corrections are based on the principles of genetic algorithms in the other words inheritance from the best rated agents. System of agents rating is described briey.

Název v anglickém jazyce

Optimization of the Particle Swarm Algorithm

Popis výsledku anglicky

Particle Swarm Optimization is a swarm intelligence based and stochastic algo- rithm to solve the optimization problem. This paper presents the Multidimensional Particle Swarm algorithm with non-equidistant discrete input data such as E-Series or Renard numbers for circuit design. The authors describe the optimization of this method for different circuit designs, agent recycling, and omission of already computed points. The problem of omission of already computed points is to determinate when it is faster to omit the points than compute them. The personal omission history can be used for agent recycling or trajectory corrections. There is also described effect of recycled agents with corrected parameters on the convergence of optimalization. Parameters corrections are based on the principles of genetic algorithms in the other words inheritance from the best rated agents. System of agents rating is described briey.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20201 - Electrical and electronic engineering

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

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

PIERS 2014 Guangzhou

ISBN

978-1-934142-28-8

ISSN

1559-9450

e-ISSN

—

Počet stran výsledku

5

Strana od-do

2355-2359

Název nakladatele

Neuveden

Místo vydání

Neuveden

Místo konání akce

Guangzhou

Datum konání akce

25. 8. 2014

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

WRD - Celosvětová akce

Kód UT WoS článku

000393225900522