Particle Swarm Optimization Based Algorithm for Bilevel Programming Problems
Zhigang Zhao, Xinyi Gu · 2006
A bilevel programming (BLP) problem is a NP hard problem that is very hard to be solved. The existing solution algorithms or methods designed to solve the particular BLP problems are inefficient and lack of universality. In this paper, a modified particle swarm optimization (PSO) is put forward firstly that can improve significantly the performance of standard PSO. And then a universal effective algorithm for solving BLP model is presented, which is based on the modified PSO algorithm and the main idea of hierarchical iteration. The experimental studies show that the new solution algorithm can be used to solve the general BLP models