Your brains and my beauty: Parent matching for constrained optimisation

被引:37
作者
Hinterding, R [1 ]
Michalewicz, Z [1 ]
机构
[1] Victoria Univ Technol, Dept Math & Comp Sci, Melbourne, Vic 8001, Australia
来源
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS | 1998年
关键词
D O I
10.1109/ICEC.1998.700156
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
During the last years, several methods have been proposed for handling constraints by evolutionary algorithms for parameter optimisation problems. These methods include those based on penalty functions, preservation of feasibility, decoders, repair algorithms, as well as some hybrid techniques. Most of these techniques have serious drawbacks (some of them may return infeasible solution, others require many additional parameters, etc). Moreover, none of these techniques has utilized knowledge on which constraints are satisfied, and which are not. In this paper we introduce a new element to evolutionary algorithms for constrained parameter optimization problems: the parent matching mechanism. The preliminary results show that the proposed technique works very well on selected test cases.
引用
收藏
页码:810 / 815
页数:6
相关论文
empty
未找到相关数据