An mind-evolution method for solving numerical optimization problems
被引:0
|
作者:
Zeng, JC
论文数: 0引用数: 0
h-index: 0
机构:
Taiyuan Heavy machinery Inst, Div Syst Simulat & Comp Applicat, Taiyuan 030024, Peoples R ChinaTaiyuan Heavy machinery Inst, Div Syst Simulat & Comp Applicat, Taiyuan 030024, Peoples R China
Zeng, JC
[1
]
Zha, K
论文数: 0引用数: 0
h-index: 0
机构:
Taiyuan Heavy machinery Inst, Div Syst Simulat & Comp Applicat, Taiyuan 030024, Peoples R ChinaTaiyuan Heavy machinery Inst, Div Syst Simulat & Comp Applicat, Taiyuan 030024, Peoples R China
Zha, K
[1
]
机构:
[1] Taiyuan Heavy machinery Inst, Div Syst Simulat & Comp Applicat, Taiyuan 030024, Peoples R China
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