Journal of Software:2001.12(4):628-632

(天津大学系统工程研究所,天津 300072)
A GA-Based Method for Solving Constrained Optimization Problems
LIN Dan,LI Min-qiang,KOU Ji-song
Chart / table
Similar Articles
Article :Browse 4142   Download 3377
Received:September 07, 1999    Revised:June 20, 2000
> 中文摘要: 在用遗传算法求解约束优化问题时,处理好约束条件是取得好的优化效果的关键.通过考虑遗传算法和约束优化问题的某些特点,提出将直接比较方法和在进化群体中自适应地保持不可行解比例的策略相结合来处理约束条件的一种新方法,并将该方法结合到通用的遗传算法中.数值实验显示了这种方法的有效性.
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.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金资助项目(69974026) 国家自然科学基金资助项目(69974026)
Foundation items:
Reference text:


LIN Dan,LI Min-qiang,KOU Ji-song.A GA-Based Method for Solving Constrained Optimization Problems.Journal of Software,2001,12(4):628-632