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

Abstract EN

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.