paper-with-me

홈 › Papers

Exploitation and Exploration Analysis of Elitist Evolutionary Algorithms: A Case Study

2020-01-29 · Yu Chen, Jun He

Known as two cornerstones of problem solving by search, exploitation and exploration are extensively discussed for implementation and application of evolutionary algorithms (EAs). However, only a few researches focus on evaluation and theoretical estimation of exploitation and exploration. Considering that exploitation and exploration are two issues regarding global search and local search, this paper proposes to evaluate them via the success probability and the one-step improvement rate computed in different domains of integration. Then, case studies are performed by analyzing performances of (1+1) random univariate search and (1+1) evolutionary programming on the sphere function and the cheating problem. By rigorous theoretical analysis, we demonstrate that both exploitation and exploration of the investigated elitist EAs degenerate exponentially with the problem dimension $n$. Meanwhile, it is also shown that maximization of exploitation and exploration can be achieved by setting an appropriate value for the standard deviation $\sigma$ of Gaussian mutation, which is positively related to the distance from the present solution to the center of the promising region.

📄 PDF Abstract BibTeX arXiv:2001.10932

Code (0)

등록된 구현이 없습니다.

Tasks

Evolutionary Algorithms

Similar Papers 제목 키워드 기반

Multi-population GAN Training: Analyzing Co-Evolutionary Algorithms

2025-07-17 · Walter P. Casas, Jamal Toutouh

Generative adversarial networks (GANs) are powerful generative models but remain challenging to train due to pathologies suchas mode collapse and instability. Recent research has explored co-evolutionary approaches, in w…

DiversityEvolutionary Algorithms

An Analytic Expression of Relative Approximation Error for a Class of Evolutionary Algorithms

2015-11-11 · Jun He

An important question in evolutionary computation is how good solutions evolutionary algorithms can produce. This paper aims to provide an analytic analysis of solution quality in terms of the relative approximation erro…

Evolutionary Algorithms

Non-elitist Evolutionary Multi-objective Optimizers Revisited

2020-09-30 · Ryoji Tanabe, Hisao Ishibuchi

Since around 2000, it has been considered that elitist evolutionary multi-objective optimization algorithms (EMOAs) always outperform non-elitist EMOAs. This paper revisits the performance of non-elitist EMOAs for bi-obj…

Behaviour Space Analysis of LLM-driven Meta-heuristic Discovery

2025-07-04 · Niki van Stein, Haoran Yin, Anna V. Kononova, Thomas Bäck 외

We investigate the behaviour space of meta-heuristic optimisation algorithms automatically generated by Large Language Model driven algorithm discovery methods. Using the Large Language Evolutionary Algorithm (LLaMEA) fr…

Large Language Model

Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms?

2015-08-27 · Carola Doerr, Johannes Lengler

Black-box complexity theory provides lower bounds for the runtime of black-box optimizers like evolutionary algorithms and serves as an inspiration for the design of new genetic algorithms. Several black-box models cover…

Evolutionary Algorithms