A single-point mutation evolutionary programming

Authors:
Mingjun Ji;Huanwen Tang;Juan Guo
Affiliations:
Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, People's Republic of China;Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, People's Republic of China;Department of Quantitative Economic, Dongbei University of Finance and Economics, Dalian 116025, People's Republic of China
Venue:
Information Processing Letters
Year:
2004

Citing 4
Cited 7

Evolving artificial intelligence

Evolving artificial intelligence
Evolution and Optimum Seeking: The Sixth Generation

Evolution and Optimum Seeking: The Sixth Generation
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Evolutionary programming made faster

IEEE Transactions on Evolutionary Computation

Adaptive evolutionary programming based on reinforcement learning

Information Sciences: an International Journal
A fuzzy clustering algorithm based on evolutionary programming

Expert Systems with Applications: An International Journal
Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions

Information Sciences: an International Journal
A mixed mutation strategy evolutionary programming combined with species conservation technique

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Taboo evolutionary programming approach to optimal transfer from earth to mars

SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
Optimization of lifting points of large-span steel structure based on evolutionary programming

ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Co-Evolutionary Algorithms Based on Mixed Strategy

Journal of Information Technology Research

Quantified Score

Hi-index	0.90

Visualization

Abstract

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 η. Simulation results show that SPMEP is obviously superior to the classical EP, fast EP and generalized EP for multimodal and high-dimensional functions.