Solving Bilevel Multiobjective Programming Problem by Elite Quantum Behaved Particle Swarm Optimization

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Tao Zhang, Tiesong Hu, Jia-wei Chen, Zhongping Wan, Xuning Guo
Format: Article
Language:English
Published: Wiley 2012-01-01
Series:Abstract and Applied Analysis
Online Access:http://dx.doi.org/10.1155/2012/102482
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:1085-3375
1687-0409