首页 | 本学科首页   官方微博 | 高级检索  
     

一类非凸优化问题的遗传算法
引用本文:叶成绪,李和成. 一类非凸优化问题的遗传算法[J]. 计算机工程与应用, 2009, 45(24): 60-62. DOI: 10.3778/j.issn.1002-8331.2009.24.019
作者姓名:叶成绪  李和成
作者单位:青海师范大学计算机系,西宁,810008;西安电子科技大学计算机学院,西安,710071;青海师范大学数学与信息科学系,西宁,810008
摘    要:线性二层规划是一类特殊的非凸优化问题,为了有效求解该问题,提出了一种基于单纯形方法的遗传算法。首先基于下层约束给出了一种新的编码方法;其次利用单纯形表的信息得到了下层问题的解函数,并结合最优性条件给出了适应度函数;最后基于个体编码的特点,设计了新的遗传算子。数值结果表明,所提出的算法是可行有效的。

关 键 词:非凸优化问题  线性二层规划  遗传算法  单纯形方法  最优解
收稿时间:2008-06-25
修稿时间:2008-9-8 

Genetic algorithm for a class of nonconvex optimization problems
YE Cheng-xu,LI He-cheng. Genetic algorithm for a class of nonconvex optimization problems[J]. Computer Engineering and Applications, 2009, 45(24): 60-62. DOI: 10.3778/j.issn.1002-8331.2009.24.019
Authors:YE Cheng-xu  LI He-cheng
Affiliation:1.Department of Computer Science,Qinghai Normal University,Xining 810008,China 2.School of Computer Science and Technology,Xidian University,Xi’an 710071,China 3.Department of Mathematics and Information Science,Qinghai Normal University,Xining 810008,China
Abstract:Linear bilevel programming problem is a special class of non-convex optimization problems,in order to solve the problems efficiently,a new genetic algorithm based on the simplex method is proposed.At first,a novel encoding scheme is designed based on the lower-level constraints.Then,the solutions to the lower-level problem,as functions of upper-level variables, are got by using the information in the simplex tableau,and a new fitness is given by combining these solution functions with optimality conditions....
Keywords:nonconvex optimization problems  linear bilevel programming  genetic algorithm  simplex method  optimal solutions
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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