By Topic

Particle Swarm Optimization Based Algorithm for Bilevel Programming Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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

Published in:

Intelligent Systems Design and Applications, 2006. ISDA '06. Sixth International Conference on  (Volume:2 )

Date of Conference:

16-18 Oct. 2006