Solving bilevel multiobjective programming problem by elite quantum behaved particle swarm optimization (Q1938112)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6134014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving bilevel multiobjective programming problem by elite quantum behaved particle swarm optimization |
scientific article; zbMATH DE number 6134014 |
Statements
Solving bilevel multiobjective programming problem by elite quantum behaved particle swarm optimization (English)
0 references
4 February 2013
0 references
Summary: An elite quantum behaved particle swarm optimization (EQPSO) algorithm is proposed, in which an elite strategy is exerted for the global best particle to prevent premature convergence of the swarm. The EQPSO algorithm is employed for solving bilevel multiobjective programming problem (BLMPP) in this study, which has never been reported in other literatures. Finally, we use eight different test problems to measure and evaluate the proposed algorithm, including low dimension and high dimension BLMPPs, as well as attempt to solve the BLMPPs whose theoretical Pareto optimal front is not known. The experimental results show that the proposed algorithm is a feasible and efficient method for solving BLMPPs.
0 references
0 references
0 references
0 references
0 references
0 references
0.8408454060554504
0 references
0.7869199514389038
0 references
0.7464712262153625
0 references
0.7453097701072693
0 references
