A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization

In this paper we present a multi-start particle swarm optimization algorithm for the global optimization of a function subject to bound constraints. The procedure consists of three main steps. In the initialization phase, an opposition learning strategy is performed to improve the search efficiency....

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of global optimization Ročník 55; číslo 1; s. 165 - 188
Hlavní autor:	Kaucic, Massimiliano
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.01.2013 Springer Springer Nature B.V
Témata:	Adaptive algorithms Algorithms Analysis Computer Science Convergence Genetic algorithms Mathematical optimization Mathematics Mathematics and Statistics Mutation Neighborhoods Operations Research/Decision Theory Optimization Optimization algorithms Real Functions Robustness Stagnation Strategy Swarm intelligence Velocity Hybrid methods Restart techniques Opposition-based computing Bound constrained optimization Particle swarm optimization
ISSN:	0925-5001, 1573-2916
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!