A single-point mutation evolutionary programming

被引:24
作者
Ji, MJ [1 ]
Tang, HW
Guo, J
机构
[1] Dalian Univ Technol, Dept Appl Math, Dalian 116024, Peoples R China
[2] Dongbei Univ Finance & Econ, Dept Quantitat Econ, Dalian 116025, Peoples R China
关键词
single-point mutation; classical evolutionary programming; fast evolutionary programming; generalized evolutionary programming; algorithms;
D O I
10.1016/j.ipl.2004.03.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose an improved evolutionary programming based on single-point mutation, which is named Single-Point Mutation Evolutionary Programming (SPMEP). The distinctions between SPMEP and the classical evolutionary programming (EP) are the single-point mutation for each solution in each iteration and the fixed mutation scheme for deviation eta. Simulation results show that SPMEP is obviously superior to the classical EP, fast EP and generalized EP for multimodal and high-dimensional functions. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:293 / 299
页数:7
相关论文
共 10 条
[1]  
Eiben A.E., 2015, Introduction to Evolutionary Computing
[2]   Evolutionary computing [J].
Eiben, AE ;
Schoenauer, M .
INFORMATION PROCESSING LETTERS, 2002, 82 (01) :1-6
[3]  
Fogel D. B., 1992, THESIS U CALIFORNIA
[4]  
FOGEL DB, 1994, CYBERNET SYST, V25, P289
[5]  
Fogel L. J., 1966, ARTIFICIAL INTELLIGE, DOI DOI 10.1109/9780470544600.CH7
[6]   Generalized evolutionary programming with Levy-type mutation [J].
Iwamatsu, M .
COMPUTER PHYSICS COMMUNICATIONS, 2002, 147 (1-2) :729-732
[7]  
Lee CY, 2001, IEEE C EVOL COMPUTAT, P568, DOI 10.1109/CEC.2001.934442
[8]   Recent developments in detection methods for microfabricated analytical devices [J].
Schwarz, MA ;
Hauser, PC .
LAB ON A CHIP, 2001, 1 (01) :1-6
[9]  
Schwefel H.-P., 1995, EVOLUTION OPTIMUM SE
[10]   Evolutionary programming made faster [J].
Yao, X ;
Liu, Y ;
Lin, GM .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 1999, 3 (02) :82-102