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

Fast micro-differential evolution for topological active net optimization

This paper studies the optimization problem of topological active net (TAN), which is often seen in image segmentation and shape modeling. A TAN is a topological structure containing many nodes, whose positions must be optimized while a predefined topology needs to be maintained. TAN optimization is often time-consuming and even constructing a single solution is hard to do. Such a problem is usually approached by a ``best improvement local search'' (BILS) algorithm based on deterministic search (DS), which is inefficient because it spends too much efforts in nonpromising probing. In this paper, we propose the use of micro-differential evolution (DE) to replace DS in BILS for improved directional guidance. The resultant algorithm is termed deBILS. Its micro-population efficiently utilizes historical information for potentially promising search directions and hence improves efficiency in probing. Results show that deBILS can probe promising neighborhoods for each node of a TAN. Experimental tests verify that deBILS offers substantially higher search speed and solution quality not only than ordinary BILS, but also the genetic algorithm and scatter search algorithm

Convergent evolution of coloration in experimental introductions of the guppy (Poecilia reticulata).

Despite the multitude of examples of evolution in action, relatively fewer studies have taken a replicated approach to understand the repeatability of evolution. Here, we examine the convergent evolution of adaptive coloration in experimental introductions of guppies from a high-predation (HP) environment into four low-predation (LP) environments. LP introductions were replicated across 2 years and in two different forest canopy cover types. We take a complementary approach by examining both phenotypes and genetics. For phenotypes, we categorize the whole color pattern on the tail fin of male guppies and analyze evolution using a correspondence analysis. We find that coloration in the introduction sites diverged from the founding Guanapo HP site. Sites group together based on canopy cover, indicating convergence in response to light environment. However, the axis that explains the most variation indicates a lack of convergence. Therefore, evolution may proceed along similar phenotypic trajectories, but still maintain unique variation within sites. For the genetics underlying the divergent phenotypes, we examine expression levels of color genes. We find no evidence for differential expression, indicating that the genetic basis for the color changes remains undetermined

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Algorithms Applied to Global Optimisation – Visual Evaluation

Evaluation and assessment of various search and optimisation algorithms is subject of large research efforts. Particular interest of this study is global optimisation and presented approach is based on observation and visual evaluation of Real-Coded Genetic Algorithm, Particle Swarm Optimisation, Differential Evolution and Free Search, which are briefly described and used for experiments. 3D graphical views, generated by visualisation tool VOTASA, illustrate essential aspects of global search process such as divergence, convergence, dependence on initialisation and utilisation of accidental events. Discussion on potential benefits of visual analysis, supported with numerical results, which could be used for comparative assessment of other methods and directions for further research conclude presented study

Free Search Towards Multidimensional Optimisation Problems

The article presents experimental results achieved from a novel heuristic algorithm for real-value search and optimisation called Free Search (FS). The aim is to clarify the abilities of this method to return optimal solutions from multidimensional search spaces currently resistant to other search techniques

Neural network-based colonoscopic diagnosis using on-line learning and differential evolution

In this paper, on-line training of neural networks is investigated in the context of computer-assisted colonoscopic diagnosis. A memory-based adaptation of the learning rate for the on-line back-propagation (BP) is proposed and used to seed an on-line evolution process that applies a differential evolution (DE) strategy to (re-) adapt the neural network to modified environmental conditions. Our approach looks at on-line training from the perspective of tracking the changing location of an approximate solution of a pattern-based, and thus, dynamically changing, error function. The proposed hybrid strategy is compared with other standard training methods that have traditionally been used for training neural networks off-line. Results in interpreting colonoscopy images and frames of video sequences are promising and suggest that networks trained with this strategy detect malignant regions of interest with accuracy