We present a new tierra-inspired artiicial life system with local interactions and two-dimensional geometry , based on an update mechanism akin to that of 2D cellular automata. We nd that the spatial geometry is conducive to the development of diversity and thus improves adaptive capabilities. We also demonstrate the adaptive strength of the system by breeding cells with simple computational ab...

In this paper, an adaptive membrane evolutionary algorithm (AMEA) is proposed, which combines a dynamic membrane structure and a differential evolution with the adaptive mutation factor. In the AMEA, the feasibility proportion method is used to dynamically adjust the size of the elementary membrane in the optimization process. The results of the experimental indicate that the proposed algorithm...

To design a multi-population adaptive genetic BP algorithm, crossover probability and mutation probability are self-adjusted according to the standard deviation of population fitness in this paper. Then a hybrid model combining Fuzzy Neural Network and multi-population adaptive genetic BP algorithm—Adaptive Genetic Fuzzy Neural Network (AGFNN) is proposed to overcome Neural Network’s drawbacks....

This paper presents an adaptive genetic algorithm (GA) to solve the Vehicle Routing Problem with Time Windows (VRPTW) to near optimal solutions. The algorithm employs a unique decoding scheme with the integer strings. It also automatically adapts the crossover probability and the mutation rate to the changing population dynamics. The adaptive control maintains population diversity at user-defin...

This paper proposes a new self-adaptive genetic algorithm。This new algorithm divides the whole evolution process into three stages. At each stage, the new algorithm adopts different operation method. The main ideas are grading balance selection, continuous crossover operation. The new algorithm designs especially self-adaptive mutation probability according to the principle of searching for thi...

In this paper a new evolutionary paradigm is proposed. A technique called Adaptive Representation Evolutionary Algorithm (AREA) based on this paradigm is designed. AREA involves dynamic alphabets for encoding solutions. Proposed adaptive representation is more compact than binary representation. Mutation is the unique variation operator. Mutations are usually more aggressive when higher alphabe...

BACKGROUND We previously reported infectious HCV clones that contain the convenient reporters, green fluorescent protein (GFP) and Renilla luciferase (Rluc), in the NS5a-coding sequence. Although these viruses were useful in monitoring viral proliferation and screening of anti-HCV drugs, the infectivity and yield of the viruses were low. METHODOLOGY/PRINCIPAL FINDINGS In order to obtain a hig...

A tournament searching method with new mutation operators for a problem of the feature subset selection is presented. The probability of the bit mutation in a classical approach is fixed. In the proposed methods this probability is dependent on the history of the searching process. Bit position whose mutation from 0 to 1 (from 1 to 0) improved the evaluation of the solution in early iterations,...

A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits of “long jumps” of the Cauchy mutation operator at the early stage of the algorithm and “fine-tunings” of the Gaussian mutation operator at the later stage. Comparisons with the recently proposed sequential and parallel evolution...

Mutation rate is one of the most fundamental parameters in genetics and evolutionary biology because mutation rate has major impacts on the incidence of disease, the amount of genetic variation, and the rate and trajectory of evolution. Based on estimates of synonymous nucleotide diversity in Escherichia coli, a recent study claimed that the per-nucleotide mutation rate in a gene decreases with...