An Analysis of Mutative σ-Self-Adaptation on Linear Fitness Functions

2006 ◽  
Vol 14 (3) ◽  
pp. 255-275 ◽  
Author(s):  
Nikolaus Hansen
Keyword(s):  
Evolutionary Algorithms ◽  
Fitness Function ◽  
Step Size ◽  
Truncation Selection ◽  
Fitness Functions ◽  
Selection Experiments ◽  
Self Adaptation ◽  
Object Parameters ◽  
Linear Fitness Function ◽  
The Given

This paper investigates σ-self-adaptation for real valued evolutionary algorithms on linear fitness functions. We identify the step-size logarithm log σ as a key quantity to understand strategy behavior. Knowing the bias of mutation, recombination, and selection on log σ is sufficient to explain σ-dynamics and strategy behavior in many cases, even from previously reported results on non-linear and/or noisy fitness functions. On a linear fitness function, if intermediate multi-recombination is applied on the object parameters, the i-th best and the i-th worst individual have the same σ-distribution. Consequently, the correlation between fitness and step-size σ is zero. Assuming additionally that σ-changes due to mutation and recombination are unbiased, then σ-self-adaptation enlarges σ if and only if μ < λ/2, given (μ, λ)-truncation selection. Experiments show the relevance of the given assumptions.

A Bi-objective Genetic Algorithm Optimization of Chaos-DNA Based Hybrid Approach

2019 ◽  
Vol 28 (2) ◽  
pp. 333-346 ◽  
Author(s):  
Shelza Suri ◽  
Ritu Vijay
Keyword(s):  
Genetic Algorithm ◽  
Image Encryption ◽  
Fitness Function ◽  
Hybrid Approach ◽  
Good Choice ◽  
Algorithm Optimization ◽  
Change Rate ◽  
Fitness Functions ◽  
Significant Performance ◽  
The Given

Abstract The paper implements and optimizes the performance of a currently proposed chaos-deoxyribonucleic acid (DNA)-based hybrid approach to encrypt images using a bi-objective genetic algorithm (GA) optimization. Image encryption is a multi-objective problem. Optimizing the same using one fitness function may not be a good choice, as it can result in different outcomes concerning other fitness functions. The proposed work initially encrypts the given image using chaotic function and DNA masks. Further, GA uses two fitness functions – entropy with correlation coefficient (CC), entropy with unified average changing intensity (UACI), and entropy with number of pixel change rate (NPCR) – simultaneously to optimize the encrypted data in the second stage. The bi-objective optimization using entropy with CC shows significant performance gain over the single-objective GA optimization for image encryption.

Multi-trajectory Fitness Function-based Method of Automated Test Coverage for Code Using Evolutionary Algorithms

2018 ◽  
pp. 30-40
Author(s):  
D. I. Solomatina ◽  
M. V. Filippov
Keyword(s):  
Evolutionary Algorithms ◽  
Fitness Function ◽  
Directed Search ◽  
Reference Trajectory ◽  
Unit Testing ◽  
Process Automation ◽  
Test Execution ◽  
Time Costs ◽  
The Given ◽  
Total Project

Testing is a time consuming and resource intensive task. Testing often takes about half of the total project development time.Hence, in recent times, a lot of studies have considered the issues of the process automation of creating and running tests. Recently, a lot of papers have been published in the field concerned. However, most of them use unit testing, in which the coverage of different program fragments occurs independently of each other. Therefore, the internal structure of the program was not taken into account.The article presents a method to build a test suite based on evolutionary algorithms that takes into account the features of the entire program, as a whole.Evolutionary algorithms are a class of optimization algorithms that has been widely developed lately, using the ideas of artificial intelligence and intended for conducting directed search. They allow successful solving the problems of software testing, such as testing embedded systems and automatic construction of unit tests.With implementing evolutionary approach the article has solved the following tasks. Proposed a method for determining the fitness function, which allows us to consider an approximation along all possible trajectories, which provides a solution to the problem of coverage in almost any case. However, the number of such trajectories can be quite large, which leads to a significant increase in test execution time. Proposed a method of approximation along all possible trajectories, allowing testing to be done in a reasonable time. Time costs to achieve the goal are reduced by selecting such a trajectory among all possible ones for which a distance value to the instruction is minimal.To study the proposed method, there were four different tasks each of which involved about 1000 runs. The presented research results have shown that the given method is more reliable than the commonly used approaches in which the reference trajectory is selected. In addition, an estimate of time costs has shown that the discussed method has higher efficiency.

Beyond Interactive Evolution: Expressing Intentions Through Fitness Functions

Leonardo ◽  
2016 ◽  
Vol 49 (3) ◽  
pp. 251-256 ◽  
Author(s):  
Penousal Machado ◽  
Tiago Martins ◽  
Hugo Amaro ◽  
Pedro H. Abreu
Keyword(s):  
Fitness Function ◽  
Interactive Art ◽  
Support Tool ◽  
Generative Art ◽  
Fitness Functions ◽  
Meta Level ◽  
Evolutionary Art ◽  
Creativity Support ◽  
The Creation ◽  
The Impact

Photogrowth is a creativity support tool for the creation of nonphotorealistic renderings of images. The authors discuss its evolution from a generative art application to an interactive evolutionary art tool and finally into a meta-level interactive art system in which users express their artistic intentions through the design of a fitness function. The authors explore the impact of these changes on the sense of authorship, highlighting the range of imagery that can be produced by the system.

Dynamic Correcting Dispersion Parameters of Lagrangian Puff Model in Atmospheric Tracer Experiments

2014 ◽  
Author(s):  
Yuanwei Ma ◽  
Dezhong Wang ◽  
Zhilong Ji ◽  
Nan Qian
Keyword(s):  
Numerical Simulation ◽  
Dispersion Model ◽  
Fitness Function ◽  
Atmospheric Dispersion ◽  
Correction Procedure ◽  
Model Errors ◽  
Dispersion Parameters ◽  
Fitness Functions ◽  
Atmospheric Dispersion Models ◽  
Atmospheric Tracer

In atmospheric dispersion models of nuclear accident, the empirical dispersion coefficients were obtained under certain experiment conditions, which is different from actual conditions. This deviation brought in the great model errors. A better estimation of the radioactive nuclide’s distribution could be done by correcting coefficients with real-time observed value. This reverse problem is nonlinear and sensitive to initial value. Genetic Algorithm (GA) is an appropriate method for this correction procedure. Fitness function is a particular type of objective function to achieving the set goals. To analysis the fitness functions’ influence on the correction procedure and the dispersion model’s forecast ability, four fitness functions were designed and tested by a numerical simulation. In the numerical simulation, GA, coupled with Lagrange dispersion model, try to estimate the coefficients with model errors taken into consideration. Result shows that the fitness functions, in which station is weighted by observed value and by distance far from release point, perform better when it exists significant model error. After performing the correcting procedure on the Kincaid experiment data, a significant boost was seen in the dispersion model’s forecast ability.

scholarly journals Independence Conservation and Evolutionary Algorithms

2020 ◽  
Vol 2 (1) ◽  
pp. 32-35
Author(s):  
Eric Holloway
Keyword(s):  
Information Theory ◽  
Evolutionary Algorithms ◽  
Algorithmic Information Theory ◽  
Fitness Functions ◽  
Information Law ◽  
Algorithmic Information

Leonid Levin developed the first stochastic conservation of information law, describing it as "torturing an uninformed witness cannot give information about the crime."  Levin's law unifies both the deterministic and stochastic cases of conservation of information.  A proof of Levin's law from Algorithmic Information Theory is given as well as a discussion of its implications in evolutionary algorithms and fitness functions.

Finding Active Membership Functions for Genetic-Fuzzy Data Mining

2015 ◽  
Vol 14 (06) ◽  
pp. 1215-1242 ◽  
Author(s):  
Chun-Hao Chen ◽  
Tzung-Pei Hong ◽  
Yeong-Chyi Lee ◽  
Vincent S. Tseng
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Fuzzy Data ◽  
Membership Functions ◽  
Linguistic Terms ◽  
Fuzzy Association Rules ◽  
Fitness Functions ◽  
The Given ◽  
Binary Strings ◽  
Active Membership

Since transactions may contain quantitative values, many approaches have been proposed to derive membership functions for mining fuzzy association rules using genetic algorithms (GAs), a process known as genetic-fuzzy data mining. However, existing approaches assume that the number of linguistic terms is predefined. Thus, this study proposes a genetic-fuzzy mining approach for extracting an appropriate number of linguistic terms and their membership functions used in fuzzy data mining for the given items. The proposed algorithm adjusts membership functions using GAs and then uses them to fuzzify the quantitative transactions. Each individual in the population represents a possible set of membership functions for the items and is divided into two parts, control genes (CGs) and parametric genes (PGs). CGs are encoded into binary strings and used to determine whether membership functions are active. Each set of membership functions for an item is encoded as PGs with real-number schema. In addition, seven fitness functions are proposed, each of which is used to evaluate the goodness of the obtained membership functions and used as the evolutionary criteria in GA. After the GA process terminates, a better set of association rules with a suitable set of membership functions is obtained. Experiments are made to show the effectiveness of the proposed approach.

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.

Sign in / Sign up

Export Citation Format

Share Document