Orthogonal Learning Particle Swarm Optimization

Particle swarm optimization (PSO) relies on its learning strategy to guide its search direction. Traditionally, each particle utilizes its historical best experience and its neighborhood's best experience through linear summation. Such a learning strategy is easy to use, but is inefficient when...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on evolutionary computation Ročník 15; číslo 6; s. 832 - 847
Hlavní autoři:	Zhan, Zhi-Hui, Zhang, Jun, Li, Yun, Shi, Yu-Hui
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.12.2011 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Arrays Artificial intelligence Computer science; control theory; systems Convergence Exact sciences and technology Global optimization Optimization orthogonal experimental design (OED) orthogonal learning particle swarm optimization (OLPSO) Oscillators Particle swarm optimization particle swarm optimization (PSO) Search problems Studies swarm intelligence Theoretical computing orthogonal learning particle swarm optimization (OLPSO) Useful information Evolutionary algorithm Global optimum Information retrieval orthogonal experimental design (OED) Global solution Particle swarm optimization Topological structure Global optimization Efficiency Experimental design Swarm intelligence Robustness particle swarm optimization (PSO) Learning algorithm Artificial intelligence Summation
ISSN:	1089-778X, 1941-0026
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!