The Algorithm for Algorithms: An Evolutionary Algorithm Based on Automatic Designing of Genetic Operators
Dazhi Jiang,Zhun Fan +1 more
TL;DR: The results show that the proposed algorithm can outperform standard differential evolution algorithm in terms of convergence speed and solution accuracy which shows that the algorithm designed automatically by computers can compete with the algorithms designed by human beings.
read more
Abstract: At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. A fundamental question is “are there any algorithms that can design evolutionary algorithms automatically?” A more complete definition of the question is “can computer construct an algorithm which will generate algorithms according to the requirement of a problem?” In this paper, a novel evolutionary algorithm based on automatic designing of genetic operators is presented to address these questions. The resulting algorithm not only explores solutions in the problem space like most traditional evolutionary algorithms do, but also automatically generates genetic operators in the operator space. In order to verify the performance of the proposed algorithm, comprehensive experiments on 23 well-known benchmark optimization problems are conducted. The results show that the proposed algorithm can outperform standard differential evolution algorithm in terms of convergence speed and solution accuracy which shows that the algorithm designed automatically by computers can compete with the algorithms designed by human beings.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Novel Selection Approach for Genetic Algorithms for Global Optimization of Multimodal Continuous Functions.
TL;DR: The overall empirical results along with graphical representation endorse that the SWS outperformed in terms of robustness, stability, and effectiveness other competitors through authentication of performance index (PI).
A framework for designing of genetic operators automatically based on gene expression programming and differential evolution
TL;DR: In this paper, an evolutionary algorithm framework based on genetic operator automatic design is proposed, which can not only explore solutions in problem space for the problem solving as most classical evolutionary algorithms do, but also generate genetic operators automatically in operator space for proper operators extraction and selection related to the evolutionary algorithms.
6
A parallel based evolutionary algorithm with primary-auxiliary knowledge
TL;DR: Zhang et al. as mentioned in this paper proposed an evolutionary algorithm named as parallel based evolutionary algorithm with primary-auxiliary knowledge, where a Spark-based primary knowledge model is developed, with different evolutionary algorithms used on each parallel sub-model.
3
Multi-objective Evolutionary Algorithm for the Design of Resilient OTN over DWDM Networks
16 Jun 2022
TL;DR: In this paper , the authors proposed a multi-objective evolutionary algorithm to find a solution that optimizes the project considering conflicting decision variables, the number of used OTN interfaces , and the restoration failure rate.
1
Application of Data Denoising and Classification Algorithm Based on RPCA and Multigroup Random Walk Random Forest in Engineering
TL;DR: A hybrid algorithm of robust principal component analysis (RPCA) combined multigroup random walk random forest (MRWRF) is proposed, which has strong robustness and preferable classification performance and can thus provide a new approach for data classification problems in engineering.
References
Particle swarm optimization
James Kennedy,Russell C. Eberhart +1 more
- 06 Aug 2002
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
44.1K
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces
Rainer Storn,Kenneth Price +1 more
TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
Particle swarm optimization
TL;DR: A snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems, is included.
•Book
Genetic Programming: On the Programming of Computers by Means of Natural Selection
John R. Koza
- 01 Jan 1992
TL;DR: This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.
15K
No free lunch theorems for optimization
TL;DR: A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving and a number of "no free lunch" (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class.