求解二层规划问题的改进粒子群算法  

An Improved Particle Swarm Optimization Method for Solving Bilevel Programming Problem

作　　者：李响[1] 高常海[1] 刘梁[1] 

机构地区：[1]中国矿业大学理学院,江苏徐州221008

出　　处：《徐州工程学院学报（自然科学版）》2009年第2期21-24,共4页Journal of Xuzhou Institute of Technology(Natural Sciences Edition)

基　　金：中国矿业大学科技基金资助项目(A200410)

摘　　要：两层规划问题是一个NP—难问题,这意味着它很难被求解.基于粒子群算法提出了一种求解二层规划问题的方法,通过分离目标函数和约束函数,使每个粒子拥有双适应值,并通过双适应值来决定个体优劣.应用了一种自适应保留不可行个体的策略.数值结果表明了算法的有效性.A bilevel programming （BLP） problem is a NP hard problem, which means it is very hard to be solved. In this paper, we introduce a BLP algorithm which separate the objective functions from its constrained functions based on the PSO. Therefore, every particle has double fitness values by which the particle will be decided whether better or not. The strategy to keep a fixed proportion of infeasible individuals is used in this new method. Numerical results show the efficiency and effect of the algorithm.

关 键 词：二层规划 粒子群 双适应值 

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