Differential evolution with an evolution path: a DEEP evolutionary algorithm

Utilizing cumulative correlation information already existing in an evolutionary process, this paper proposes a predictive approach to the reproduction mechanism of new individuals for differential evolution (DE) algorithms. DE uses a distributed model (DM) to generate new individuals, which is relatively explorative, whilst evolution strategy (ES) uses a centralized model (CM) to generate offspring, which through adaptation retains a convergence momentum. This paper adopts a key feature in the CM of a covariance matrix adaptation ES, the cumulatively learned evolution path (EP), to formulate a new evolutionary algorithm (EA) framework, termed DEEP, standing for DE with an EP. Without mechanistically combining two CM and DM based algorithms together, the DEEP framework offers advantages of both a DM and a CM and hence substantially enhances performance. Under this architecture, a self-adaptation mechanism can be built inherently in a DEEP algorithm, easing the task of predetermining algorithm control parameters. Two DEEP variants are developed and illustrated in the paper. Experiments on the CEC'13 test suites and two practical problems demonstrate that the DEEP algorithms offer promising results, compared with the original DEs and other relevant state-of-the-art EAs

Adaptive multimodal continuous ant colony optimization

Seeking multiple optima simultaneously, which multimodal optimization aims at, has attracted increasing attention but remains challenging. Taking advantage of ant colony optimization algorithms in preserving high diversity, this paper intends to extend ant colony optimization algorithms to deal with multimodal optimization. First, combined with current niching methods, an adaptive multimodal continuous ant colony optimization algorithm is introduced. In this algorithm, an adaptive parameter adjustment is developed, which takes the difference among niches into consideration. Second, to accelerate convergence, a differential evolution mutation operator is alternatively utilized to build base vectors for ants to construct new solutions. Then, to enhance the exploitation, a local search scheme based on Gaussian distribution is self-adaptively performed around the seeds of niches. Together, the proposed algorithm affords a good balance between exploration and exploitation. Extensive experiments on 20 widely used benchmark multimodal functions are conducted to investigate the influence of each algorithmic component and results are compared with several state-of-the-art multimodal algorithms and winners of competitions on multimodal optimization. These comparisons demonstrate the competitive efficiency and effectiveness of the proposed algorithm, especially in dealing with complex problems with high numbers of local optima

Adaptive dynamic disturbance strategy for differential evolution algorithm

To overcome the problems of slow convergence speed, premature convergence leading to local optimization and parameter constraints when solving high-dimensional multi-modal optimization problems, an adaptive dynamic disturbance strategy for differential evolution algorithm (ADDSDE) is proposed. Firstly, this entails using the chaos mapping strategy to initialize the population to increase population diversity, and secondly, a new weighted mutation operator is designed to weigh and combinemutation strategies of the standard differential evolution (DE). The scaling factor and crossover probability are adaptively adjusted to dynamically balance the global search ability and local exploration ability. Finally, a Gauss perturbation operator is introduced to generate a random disturbance variation, and to accelerate premature individuals to jump out of local optimization. The algorithm runs independently on five benchmark functions 20 times, and the results show that the ADDSDE algorithm has better global optimization search ability, faster convergence speed and higher accuracy and stability compared with other optimization algorithms, which provide assistance insolving high-dimensionaland complex problems in engineering and information science

Evolutionary Daisyworld models: A new approach to studying complex adaptive systems

This paper presents a model of a population of error-prone self-replicative species (replicators) that interact with its environment. The population evolves by natural selection in an environment whose change is caused by the evolutionary process itself. For simplicity, the environment is described by a single scalar factor, i.e. its temperature. The formal formulation of the model extends two basic models of Ecology and Evolutionary Biology, namely, Daisyworld and Quasispecies models. It is also assumed that the environment can also change due to external perturbations that are summed up as an external noise. Unlike previous models, the population size self-regulates, so no ad hoc population constraints are involved. When species replication is error-free, i.e. without mutation, the system dynamics can be described by an (n + 1)-dimensional system of differential equations, one for each of the species initially present in the system, and another for the evolution of the environment temperature. Analytical results can be obtained straightforwardly in low-dimensional cases. In these examples, we show the stabilizing effect of thermal white noise on the system behavior. The error-prone self-replication, i.e. with mutation, is studied computationally. We assume that species can mutate two independent parameters: its optimal growth temperature and its influence on the environment temperature. For different mutation rates the system exhibits a large variety of behaviors. In particular, we show that a quasispecies distribution with an internal sub-distribution appears, facilitating species adaptation to new environments. Finally, this ecologically inspired evolutionary model is applied to study the origin and evolution of public opinion

Recycling probability and dynamical properties of germinal center reactions

We introduce a new model for the dynamics of centroblasts and centrocytes in a germinal center. The model reduces the germinal center reaction to the elements considered as essential and embeds proliferation of centroblasts, point mutations of the corresponding antibody types represented in a shape space, differentiation to centrocytes, selection with respect to initial antigens, differentiation of positively selected centrocytes to plasma or memory cells and recycling of centrocytes to centroblasts. We use exclusively parameters with a direct biological interpretation such that, once determined by experimental data, the model gains predictive power. Based on the experiment of Han et al. (1995b) we predict that a high rate of recycling of centrocytes to centroblasts is necessary for the germinal center reaction to work reliably. Furthermore, we find a delayed start of the production of plasma and memory cells with respect to the start of point mutations, which turns out to be necessary for the optimization process during the germinal center reaction. The dependence of the germinal center reaction on the recycling probability is analyzed.Comment: 30 pages, 8 figure