基于粒子群算法的非线性二层规划问题的求解算法  

Particle Swarm Optimization Based Approach to Solving Nonlinear Bilevel Programming Problems

作　　者：江燕[1] 胡铁松[1] 黄崇超[2] 武夏宁[1] 

机构地区：[1]武汉大学水利水电学院,湖北武汉430072 [2]武汉大学数学与统计学院,湖北武汉430072

出　　处：《运筹与管理》2006年第2期18-22,共5页Operations Research and Management Science

基　　金：国家自然科学基金资助项目(50479039)

摘　　要：粒子群算法(Particle Swarm Optimization,PSO)是一种新兴的优化技术,其思想来源于人工生命和演化计算理论。PSO通过粒子追随自己找到的最好解和整个群的最好解来完成优化。该算法简单易实现,可调参数少,已得到了广泛研究和应用。本文根据该算法能够有效的求出非凸数学规划全局最优解的特点,对非线性二层规划的上下层问题求解,并根据二层规划的特点,给出了求解非线性二层规划问题全局最优解的有效算法。数值计算结果表明该算法有效。Particle swarm optimization （PSO） is a new optimization technique originating in artificial life and evolutionary computation. It completes the optimization following the personal best solution of each particle and the global best value of the whole swarm. PSO can be easily implemented and few parameters need to be tuned. It has been successfully applied to many areas. According to particle swarm optimization non-convex mathematical problems of global optimization, the upper-level and lower-level problems of nonlinear bilevel programming problem （BPP） can be solved, and according to the feature of bilevel programming, an efficient algorithm is presented in solving nonlinear BPP in this paper. The numerical computation results indicate the proposed algorithm is effective.

关 键 词：二层规划 粒子群算法 全局优化 

分 类 号：O221.1[理学—运筹学与控制论]