摘要
用遗传算法求解无约束优化问题已经取得了成功 ,但如何处理有约束优化问题是其面临的问题之一 .目前处理这一问题没有一致适用的方法 ,最常用的处理约束方法是惩罚函数法 ,也有一些其它方法 .本文对近几年出现的几种方法进行了介绍 ,并评述了它们的优缺点 .
The genetic algorithm had handled nonconstraint optimization successfully. Now, the difficulty is how to solve constraint optimization by genetic algorithm. There is no uniform methodology for handling constraints. The most common approach is the penalty function method. But several other methods for handling constraints have emerged recently. This paper reviews such methods and discusses their merits and drawbacks.
出处
《北方交通大学学报》
CSCD
北大核心
2000年第6期14-19,共6页
Journal of Northern Jiaotong University
基金
国家教委博士点基金!资助项目 (19990 0 0 411)