首页 | 官方网站   微博 | 高级检索  
     

结合增广Lagrange罚函数的约束优化差分进化算法
引用本文:龙文,徐松金.结合增广Lagrange罚函数的约束优化差分进化算法[J].计算机应用研究,2012,29(5):1673-1675.
作者姓名:龙文  徐松金
作者单位:1. 贵州财经学院贵州省经济系统仿真重点实验室,贵阳550004;贵州财经学院数学与统计学院,贵阳550004
2. 铜仁学院数学与计算机科学系,贵州铜仁,554300
基金项目:国家自然科学基金资助项目(61074069)
摘    要:利用增广Lagrange罚函数处理问题的约束条件,提出了一种新的约束优化差分进化算法。基于增广Lagrange惩罚函数,将原约束优化问题转换为界约束优化问题。在进化过程中,根据个体的适应度值将种群分为精英种群和普通种群,分别采用不同的变异策略,以平衡算法的全局和局部搜索能力。用10个经典Benchmark问题进行了测试,实验结果表明,该算法能有效地处理不同的约束优化问题。

关 键 词:约束优化问题  差分进化算法  增广Lagrange罚函数  变异策略

Constrained optimization differential evolution algorithm usingaugmented Lagrange penalty function
LONG Wen,XU Song-jin.Constrained optimization differential evolution algorithm usingaugmented Lagrange penalty function[J].Application Research of Computers,2012,29(5):1673-1675.
Authors:LONG Wen  XU Song-jin
Affiliation:1. a. Guizhou Key Laboratory of Economics System Simulation, b. School of Mathematics & Statistics, Guizhou University of Finance & Econo-mics, Guiyang 550004, China; 2. Dept. of Mathematics & Computer, Tongren University, Tongren Guizhou 554300, China
Abstract:Using augmented Lagrange penalty function to deal with the constrained conditions, this paper proposed a modified constrained optimization differential evolution algorithm. It converted the general constrained optimization problem into a bound constrained optimization problem. In the process of evolution, divided the initial population into two subpopulations, i. e. elite and general subpopulations, which used different mutation strategies to balance the ability of global and local search respectively. It tested ten classic Benchmarks problems, the experiment results show that the proposed algorithm is an effective way for constrained optimization problems.
Keywords:constrained optimization problem  differential evolution algorithm  augmented Lagrange penalty function  mutation strategy
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号