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

基于遗传算法求解约束优化问题的一种算法
引用本文:林丹,李敏强,寇纪凇. 基于遗传算法求解约束优化问题的一种算法[J]. 软件学报, 2001, 12(4): 628-632
作者姓名:林丹  李敏强  寇纪凇
作者单位:天津大学系统工程研究所,
基金项目:国家自然科学基金资助项目(69974026)
摘    要:在用遗传算法求解约束优化问题时,处理好约束条件是取得好的优化效果的关键.通过考虑遗传算法和约束优化问题的某些特点,提出将直接比较方法和在进化群体中自适应地保持不可行解比例的策略相结合来处理约束条件的一种新方法,并将该方法结合到通用的遗传算法中.数值实验显示了这种方法的有效性.

关 键 词:约束优化问题  遗传算法  罚函数法  FPDC(fixedproportionanddirectcomparison)方法
收稿时间:1999-09-07
修稿时间:1999-09-07

A GA-Based Method for Solving Constrained Optimization Problems
LIN Dan,LI Min-qiang and KOU Ji-song. A GA-Based Method for Solving Constrained Optimization Problems[J]. Journal of Software, 2001, 12(4): 628-632
Authors:LIN Dan  LI Min-qiang  KOU Ji-song
Abstract:In trying to solve constrained optimization problems using genetic algorithms, the method to handle the constraints is the key factor to success. In this paper, some features of GA (genetic algorithms) and a large class of constrained optimization problems are taken into account and a new method called Fixed Proportion and Direct Comparison (FPDC) is proposed, which combines direct comparison method and the strategy to keep a fixed proportion of infeasible individuals. It has been successfully integrated with the ordinary GA. Numerical results show that it is a general, effective and robust method.
Keywords:constrained optimization   genetic algorithm   penalty function method   FPDC (fixed proportion and direct comparison) method
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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