An mind-evolution method for solving numerical optimization problems

被引:0
|
作者
Zeng, JC [1 ]
Zha, K [1 ]
机构
[1] Taiyuan Heavy machinery Inst, Div Syst Simulat & Comp Applicat, Taiyuan 030024, Peoples R China
关键词
mind-evolution; genetic algorithm; optimization;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
MEBML, Mind-Evolution-Eased Machine Learning presented in literature [1] has many superiority for solving premature convergence problem of genetic algorithm and non-numerical optimization. The similartaxis and dissimilation operators have some shortcomings and no theoretical analysis method, so that the efficiency is lower. For numerical optimization problems, the construction methods of the similartaxis and dissimilation operators are given in the paper, and the effectiveness is proven through the computing examples.
引用
收藏
页码:126 / 128
页数:3
相关论文
共 3 条
  • [1] [Anonymous], 1998, P IEEE INT C INTELLI
  • [2] BACK T, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P2
  • [3] DASQUPTA D, 1992, EUR C ART INT, P608