scholarly journals Spherical Distributions Used in Evolutionary Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3098
Author(s):  
Alexandru Agapie
Keyword(s):  
Evolutionary Algorithms ◽  
Uniform Distribution ◽  
Compact Support ◽  
Fitness Function ◽  
Success Probability ◽  
Real Space ◽  
High Dimensional ◽  
Distributed Components ◽  
Spherical Distributions ◽  
Independent Identically Distributed

Performance of evolutionary algorithms in real space is evaluated by local measures such as success probability and expected progress. In high-dimensional landscapes, most algorithms rely on the normal multi-variate, easy to assemble from independent, identically distributed components. This paper analyzes a different distribution, also spherical, yet with dependent components and compact support: uniform in the sphere. Under a simple setting of the parameters, two algorithms are compared on a quadratic fitness function. The success probability and the expected progress of the algorithm with uniform distribution are proved to dominate their normal mutation counterparts by order n!!.

scholarly journals Investigation of Improved Cooperative Coevolution for Large-Scale Global Optimization Problems

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 146
Author(s):  
Aleksei Vakhnin ◽  
Evgenii Sopov
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithms ◽  
Numerical Experiments ◽  
Large Scale ◽  
Optimization Problems ◽  
State Of The Art ◽  
Fixed Number ◽  
High Dimensional ◽  
Cooperative Coevolution ◽  
Large Scale Problems

Modern real-valued optimization problems are complex and high-dimensional, and they are known as “large-scale global optimization (LSGO)” problems. Classic evolutionary algorithms (EAs) perform poorly on this class of problems because of the curse of dimensionality. Cooperative Coevolution (CC) is a high-performed framework for performing the decomposition of large-scale problems into smaller and easier subproblems by grouping objective variables. The efficiency of CC strongly depends on the size of groups and the grouping approach. In this study, an improved CC (iCC) approach for solving LSGO problems has been proposed and investigated. iCC changes the number of variables in subcomponents dynamically during the optimization process. The SHADE algorithm is used as a subcomponent optimizer. We have investigated the performance of iCC-SHADE and CC-SHADE on fifteen problems from the LSGO CEC’13 benchmark set provided by the IEEE Congress of Evolutionary Computation. The results of numerical experiments have shown that iCC-SHADE outperforms, on average, CC-SHADE with a fixed number of subcomponents. Also, we have compared iCC-SHADE with some state-of-the-art LSGO metaheuristics. The experimental results have shown that the proposed algorithm is competitive with other efficient metaheuristics.

High-dimensional Unbalanced Binary Classification by Genetic Programming with Multi-criterion Fitness Evaluation and Selection

2021 ◽  
pp. 1-26
Author(s):  
Wenbin Pei ◽  
Bing Xue ◽  
Lin Shang ◽  
Mengjie Zhang
Keyword(s):  
Genetic Programming ◽  
Fitness Function ◽  
Binary Classification ◽  
Class Imbalance ◽  
Area Under The Curve ◽  
High Dimensional ◽  
Genetic Operators ◽  
Minority Class ◽  
Fitness Evaluation ◽  
Unbalanced Classification

Abstract High-dimensional unbalanced classification is challenging because of the joint effects of high dimensionality and class imbalance. Genetic programming (GP) has the potential benefits for use in high-dimensional classification due to its built-in capability to select informative features. However, once data is not evenly distributed, GP tends to develop biased classifiers which achieve a high accuracy on the majority class but a low accuracy on the minority class. Unfortunately, the minority class is often at least as important as the majority class. It is of importance to investigate how GP can be effectively utilized for high-dimensional unbalanced classification. In this paper, to address the performance bias issue of GP, a new two-criterion fitness function is developed, which considers two criteria, i.e. the approximation of area under the curve (AUC) and the classification clarity (i.e. how well a program can separate two classes). The obtained values on the two criteria are combined in pairs, instead of summing them together. Furthermore, this paper designs a three-criterion tournament selection to effectively identify and select good programs to be used by genetic operators for generating better offspring during the evolutionary learning process. The experimental results show that the proposed method achieves better classification performance than other compared methods.

Comparison of Multi-Objective Evolutionary Algorithms to Prioritize Regression Test Cases

2021 ◽  
Vol 9 (12) ◽  
pp. 1445-1454
Keyword(s):  
Fault Detection ◽  
Evolutionary Algorithms ◽  
Fitness Function ◽  
Optimal Solution ◽  
Test Suite ◽  
Test Case ◽  
Test Cases ◽  
Nsga Ii ◽  
Multi Objective ◽  
Regression Test

Regression testing is one of the most critical testing activities among software product verification activities. Nevertheless, resources and time constraints could inhibit the execution of a full regression test suite, hence leaving us in confusion on what test cases to run to preserve the high quality of software products. Different techniques can be applied to prioritize test cases in resource-constrained environments, such as manual selection, automated selection, or hybrid approaches. Different Multi-Objective Evolutionary Algorithms (MOEAs) have been used in this domain to find an optimal solution to minimize the cost of executing a regression test suite while obtaining maximum fault detection coverage as if the entire test suite was executed. MOEAs achieve this by selecting set of test cases and determining the order of their execution. In this paper, three Multi Objective Evolutionary Algorithms, namely, NSGA-II, IBEA and MoCell are used to solve test case prioritization problems using the fault detection rate and branch coverage of each test case. The paper intends to find out what’s the most effective algorithm to be used in test cases prioritization problems, and which algorithm is the most efficient one, and finally we examined if changing the fitness function would impose a change in results. Our experiment revealed that NSGA-II is the most effective and efficient MOEA; moreover, we found that changing the fitness function caused a significant reduction in evolution time, although it did not affect the coverage metric.

Evolutionary Algorithms

2016 ◽  
pp. 190-215 ◽  
Author(s):  
Ka-Chun Wong
Keyword(s):  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Real World ◽  
Fitness Function ◽  
Search Performance ◽  
Parallel Search ◽  
Survival Selection ◽  
Parent Selection ◽  
History Of ◽  
Search Capability

Inspired from nature, evolutionary algorithms have been proven effective and unique in different real world applications. Comparing to traditional algorithms, its parallel search capability and stochastic nature enable it to excel in search performance in a unique way. In this chapter, evolutionary algorithms are reviewed and discussed from concepts and designs to applications in bioinformatics. The history of evolutionary algorithms is first discussed at the beginning. An overview on the state-of-the-art evolutionary algorithm concepts is then provided. Following that, the related design and implementation details are discussed on different aspects: representation, parent selection, reproductive operators, survival selection, and fitness function. At the end of this chapter, real world evolutionary algorithm applications in bioinformatics are reviewed and discussed.

scholarly journals What Can We Learn from Multi-Objective Meta-Optimization of Evolutionary Algorithms in Continuous Domains?

Mathematics ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 232 ◽  
Author(s):  
Roberto Ugolotti ◽  
Laura Sani ◽  
Stefano Cagnoni
Keyword(s):  
Evolutionary Algorithms ◽  
Fitness Function ◽  
Target Function ◽  
Optimization Methods ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm ◽  
Continuous Domains ◽  
Level Method ◽  
Meta Optimization ◽  
Function Time

Properly configuring Evolutionary Algorithms (EAs) is a challenging task made difficult by many different details that affect EAs’ performance, such as the properties of the fitness function, time and computational constraints, and many others. EAs’ meta-optimization methods, in which a metaheuristic is used to tune the parameters of another (lower-level) metaheuristic which optimizes a given target function, most often rely on the optimization of a single property of the lower-level method. In this paper, we show that by using a multi-objective genetic algorithm to tune an EA, it is possible not only to find good parameter sets considering more objectives at the same time but also to derive generalizable results which can provide guidelines for designing EA-based applications. In particular, we present a general framework for multi-objective meta-optimization, to show that “going multi-objective” allows one to generate configurations that, besides optimally fitting an EA to a given problem, also perform well on previously unseen ones.

Evolutionary algorithms for grouping high dimensional Email data

2002 ◽  
Vol 6 (6) ◽  
pp. 503-516
Author(s):  
Steve Counsell ◽  
Xiaohui Liu ◽  
Janet McFall ◽  
Stephen Swift ◽  
Allan Tucker
Keyword(s):  
Evolutionary Algorithms ◽  
High Dimensional

Computer-Automated Evolution of an X-Band Antenna for NASA's Space Technology 5 Mission

2011 ◽  
Vol 19 (1) ◽  
pp. 1-23 ◽  
Author(s):  
Gregory. S. Hornby ◽  
Jason D. Lohn ◽  
Derek S. Linden
Keyword(s):  
Evolutionary Algorithms ◽  
Domain Knowledge ◽  
Current Practice ◽  
Design Space ◽  
Fitness Function ◽  
Antenna Design ◽  
Space Technology ◽  
X Band ◽  
Spacecraft Orbit

Whereas the current practice of designing antennas by hand is severely limited because it is both time and labor intensive and requires a significant amount of domain knowledge, evolutionary algorithms can be used to search the design space and automatically find novel antenna designs that are more effective than would otherwise be developed. Here we present our work in using evolutionary algorithms to automatically design an X-band antenna for NASA's Space Technology 5 (ST5) spacecraft. Two evolutionary algorithms were used: the first uses a vector of real-valued parameters and the second uses a tree-structured generative representation for constructing the antenna. The highest-performance antennas from both algorithms were fabricated and tested and both outperformed a hand-designed antenna produced by the antenna contractor for the mission. Subsequent changes to the spacecraft orbit resulted in a change in requirements for the spacecraft antenna. By adjusting our fitness function we were able to rapidly evolve a new set of antennas for this mission in less than a month. One of these new antenna designs was built, tested, and approved for deployment on the three ST5 spacecraft, which were successfully launched into space on March 22, 2006. This evolved antenna design is the first computer-evolved antenna to be deployed for any application and is the first computer-evolved hardware in space.

Sign in / Sign up

Export Citation Format

Share Document