Graph based adaptive evolutionary algorithm for continuous optimization
he greatest weakness of evolutionary algorithms, widely used today, is the premature convergence due to the loss of population diversity over generations. To overcome this problem, several algorithms have been proposed, such as the Graph-based Evolutionary Algorithm (GEA) \cite{1} which uses graphs to model the structure of the population, but also memetic or differential evolution algorithms \cite{2,3}, or diversity-based ones \cite{4,5} have been designed. These algorithms are based on multi-populations, or often rather focus on the self-tuning parameters, however, they become complex to tune because of their high number of parameters. In this paper, our approach consists of an evolutionary algorithm that allows a dynamic adaptation of the search operators based on a graph in order to limit the loss of diversity and reduce the design complexity.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversityEvolutionary AlgorithmsSimilar Papers 제목 키워드 기반
Average Convergence Rate of Evolutionary Algorithms II: Continuous Optimization
The average convergence rate (ACR) measures how fast the approximation error of an evolutionary algorithm converges to zero per generation. It is defined as the geometric average of the reduction rate of the approximatio…
Evolutionary AlgorithmsGraph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Deep reinforcement learning (DRL) has been widely used for dynamic algorithm configuration, particularly in evolutionary computation, which benefits from the adaptive update of parameters during the algorithmic execution…
Combinatorial OptimizationDeep Reinforcement LearningEvolutionary AlgorithmsGraph Neural NetworkA many-objective evolutionary algorithm using indicator-driven weight vector optimization
For regular Pareto Fronts (PFs), such as those that are smooth, continuous, and uniformly distributed, using fixed weight vectors is sufficient for multi-objective optimization approaches using decomposition. However, wh…
Information-geometric optimization with natural selection
Evolutionary algorithms, inspired by natural evolution, aim to optimize difficult objective functions without computing derivatives. Here we detail the relationship between population genetics and evolutionary optimizati…
Evolutionary AlgorithmsDistributed Adaptive Networks: A Graphical Evolutionary Game-Theoretic View
Distributed adaptive filtering has been considered as an effective approach for data processing and estimation over distributed networks. Most existing distributed adaptive filtering algorithms focus on designing differe…