Two-lbests based multi-objective particle swarm optimizer

The global best (gbest) or local best (lbest) of every particle in state-of-the-art multi-objective particle swarm optimization (MOPSO) implementations is selected from the non-dominated solutions in the external archive. This approach emphasizes the elitism at the expense of diversity when the size...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Engineering optimization Ročník 43; číslo 1; s. 1 - 17
Hlavní autoři: Zhao, S. -Z., Suganthan, P. N.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Taylor & Francis 01.01.2011
Taylor & Francis Ltd
Témata:
Algorithms
Archives
Atoms & subatomic particles
Chaos theory
Comparative analysis
Evolutionary algorithms
Expenses
external archive
Genetic algorithms
multi-objective evolutionary algorithm
multi-objective particle swarm optimization
Optimization
Optimization algorithms
Searching
State of the art
Tests
two lbests multi-objective particle swarm optimization (2LB-MOPSO)
ISSN:0305-215X, 1029-0273
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!
Popis
Shrnutí:The global best (gbest) or local best (lbest) of every particle in state-of-the-art multi-objective particle swarm optimization (MOPSO) implementations is selected from the non-dominated solutions in the external archive. This approach emphasizes the elitism at the expense of diversity when the size of the current set of non-dominated solutions in the external archive is small. This article proposes that the gbests or lbests should be chosen from the top fronts in a non-domination sorted external archive of reasonably large size. In addition, a novel two local bests (lbest) based MOPSO (2LB-MOPSO) version is proposed to focus the search around small regions in the parameter space in the vicinity of the best existing fronts unlike the current MOPSO variants in which the pbest and gbest (or lbest) of a particle can be located far apart in the parameter space thereby potentially resulting in a chaotic search behaviour. Comparative evaluation using 19 multi-objectives test problems and 11 state-of-the-art multi-objective evolutionary algorithms ranks overall the 2LB-MOPSO as the best while two state-of-the-art MOPSO algorithms are ranked the worst with respect to other multi-objective evolutionary algorithms.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ISSN:0305-215X
1029-0273
DOI:10.1080/03052151003686716