A novel mutation operator based on the union of fitness and design spaces information for Differential Evolution
Differential Evolution (DE) is one of the most successful and powerful evolutionary algorithms for global optimization problem. The most important operator in this algorithm is mutation operator which parents are selected randomly to participate in it. Recently, numerous papers are tried to make this operator more intelligent by selection of parents for mutation intelligently. The intelligent selection for mutation vectors is performed by applying design space (also known as decision space) criterion or fitness space criterion, however, in both cases, half of valuable information of the problem space is disregarded. In this article, a Universal Differential Evolution (UDE) is proposed which takes advantage of both design and fitness spaces criteria for intelligent selection of mutation vectors. The experimental analysis on UDE are performed on CEC2005 benchmarks and the results stated that UDE significantly improved the performance of differential evolution in comparison with other methods that only use one criterion for intelligent selection.
Code (0)
등록된 구현이 없습니다.
Tasks
Evolutionary Algorithmsglobal-optimizationSimilar Papers 제목 키워드 기반
On Fitness Landscape Analysis of Permutation Problems: From Distance Metrics to Mutation Operator Selection
In this paper, we explore the theory and expand upon the practice of fitness landscape analysis for optimization problems over the space of permutations. Many of the computational and analytical tools for fitness landsca…
Monotonicity of Fitness Landscapes and Mutation Rate Control
A common view in evolutionary biology is that mutation rates are minimised. However, studies in combinatorial optimisation and search have shown a clear advantage of using variable mutation rates as a control parameter t…
Evolutionary AlgorithmsFast Immune System Inspired Hypermutation Operators for Combinatorial Optimisation
Various studies have shown that immune system inspired hypermutation operators can allow artificial immune systems (AIS) to be very efficient at escaping local optima of multimodal optimisation problems. However, this ef…
Evolutionary AlgorithmsFast Artificial Immune Systems
Various studies have shown that characteristic Artificial Immune System (AIS) operators such as hypermutations and ageing can be very efficient at escaping local optima of multimodal optimisation problems. However, this …
Evolutionary AlgorithmsCycle Mutation: Evolving Permutations via Cycle Induction
Evolutionary algorithms solve problems by simulating the evolution of a population of candidate solutions. We focus on evolving permutations for ordering problems like the traveling salesperson problem (TSP), as well as …
Evolutionary Algorithms