Paper Info
Title
Particle Swarm Optimization Based Algorithm for Bilevel Programming Problems
Abstract
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
Year
DOI
Venue
2006
10.1109/ISDA.2006.253740
ISDA (2)
Keywords
Field
DocType
existing solution algorithm,hierarchical iteration,particular blp problem,universal effective algorithm,modified pso algorithm,standard pso,np hard problem,modified particle swarm optimization,particle swarm optimisation,general blp model,bilevel programming problem,computational complexity,blp model,bilevel programming problems,new solution algorithm,iterative methods,particle swarm optimization,bilevel programming
Particle swarm optimization,Mathematical optimization,Bilevel optimization,Iterative method,Computer science,Algorithm,Multi-swarm optimization,Artificial intelligence,Universality (philosophy),Machine learning,Computational complexity theory,Metaheuristic
Conference
Volume
ISBN
Citations 
2
0-7695-2528-8
2
PageRank 
References 
Authors
0.38
1
2
Name
Order
Citations
PageRank
Zhigang Zhao140.80
Xinyi Gu230.74