Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem

As a metaheuristic, Particle Swarm Optimization (PSO) has been used to solve the Bi-level Multiobjective Programming Problem (BMPP). However, in the existing solving approach based on PSO for the BMPP, the upper level and the lower level problem are solved interactively by PSO. In this paper, we present a different solving approach based on PSO for the BMPP. Firstly, we replace the lower level problem of the BMPP with Kuhn-Tucker optimality conditions and adopt the perturbed Fischer-Burmeister function to smooth the complementary conditions. After that, we adopt PSO approach to solve the smoothed multiobjective programming problem. Numerical results show that our solving approach can obtain the Pareto optimal front of the BMPP efficiently.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.