Adaptive Particle Swarm Optimization for Bilevel Programming Proble
LI Mei-long
DAI cun-jie
lIU chang-sheng
Abstract：Bilevel Programming Problem (BLPP)is a hierarchical structure with a lfoor system, superstructure and substructure has its own decision variables, constraints and objective functions.BLPP researches planning and management system in two levels. Adaptive Particle Swarm Optimization(APSO), not only has the advantages of PSO, such as the algorithm is simple, less parameters, easy to implement, but also balances the global search ability and improves the ability of local PSO algorithm, improves the PSO algorithm’s convergence and accuracy greatly. In this paper, we propose to use APSO algorithm to solve the BLPP problem, with the idea of hierarchical iteration, and then the general algorithm is proposed to solve bilevel programming model, ifnally, verify the effectiveness of the algorithm through the experiment.
Keywords：Bilevel programming problemAdaptive particle swarm optimizationHierarchical iteration
Publication Date：2014-01-01
Online Publishing Date：2026-05-22(First online date of this platform, not the publication date of the document)
Pages：3( 94-96 )