生物地理学算法求解一类非线性线性双层规划  

Biogeography-based Optimization Algorithm for a Class of Nonlinear Bilevel Programming Problems

作　　者：贾飞[1] 孟敏[1] 

机构地区：[1]西安电子科技大学理学院,陕西西安710071

出　　处：《电子科技》2014年第1期13-17,共5页Electronic Science and Technology

摘　　要：用生物地理学优化算法的实数编码来求解下层为凸规划的非线性双层规划问题。基于上层目标函数设置了一种新的适宜度函数,可以简单区分不同类型的解;对下层问题先用坐标轮换法求解,然后利用基于下层问题的KKT最优性等价条件来检验求解结果。分别运用4种不同的迁移率模型来求解问题,实验结果表明,生物地理学优化算法求解这类双层问题是稳定、有效的。The paper deals with a class of nonlinear bilevel programming problems in which the low level objective function is convex programming and real-coded biogeography optimization algorithm is used to solve the problems. Based on the upper＇s objective function, a new fitness function is proposed that can be easily used to evaluate the quality of different types of potential solutions. We first use coordinate rotation method to solve the lower problem, and then examine solution result based on the lower the KKT optimality equivalent conditions. Four different migration models are used solving the problem, and experimental results show that the proposed algorithm is stable and effective.

关 键 词：生物地理学优化算法 非线性双层规划 迁移率模型 KKT条件 

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