Have a personal or library account? Click to login
Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem Cover

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

By: Qingping He and  Yibing Lv  
Open Access
|Oct 2017

Abstract

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.

DOI: https://doi.org/10.1515/cait-2017-0030 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Language: English
Page range: 59 - 74
Published on: Oct 4, 2017
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2017 Qingping He, Yibing Lv, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.