The hybrid bacterial foraging algorithm based on many-objective optimizer

A new multi-objective optimized bacterial foraging algorithm - Hybrid Multi-Objective Optimized Bacterial Foraging Algorithm (HMOBFA) is presented in this article. The proposed algorithm combines the crossover-archives strategy and the life-cycle optimization strategy, look for the best method through research area. The crossover-archive strategy with an external archive and internal archive is assigned to different selection principles to focus on diversity and convergence separately. Additionally, according to the local landscape to satisfy population diversity and variability as well as avoiding redundant local searches, individuals can switch their states periodically throughout the colony lifecycle with the life-cycle optimization strategy. all of which may perform significantly well. The performance of the algorithm was examined with several standard criterion functions and compared with other classical multi-objective majorization methods. The examiner results show that the HMOBFA algorithm can achieve a significant enhancement in performance compare with other method and handles many-objective issues with solid complexity, convergence as well as diversity. The HMOBFA algorithm has been proven to be an excellent alternative to past methods for solving the improvement of many-objective problems.     

A novel comprehensive learning artificial bee colony optimizer for dynamic optimization biological problems

There are many dynamic optimization problems in the real world, whose convergence and searching ability is cautiously desired, obviously different from static optimization cases. This requires an optimization algorithm adaptively seek the changing optima over dynamic environments, instead of only finding the global optimal solution in the static environment. This paper proposes a novel comprehensive learning artificial bee colony optimizer (CLABC) for optimization in dynamic environments problems, which employs a pool of optimal foraging strategies to balance the exploration and exploitation tradeoff. The main motive of CLABC is to enrich artificial bee foraging behaviors in the ABC model by combining Powell’s pattern search method, life-cycle, and crossover-based social learning strategy. The proposed CLABC is a more bee-colony-realistic model that the bee can reproduce and die dynamically throughout the foraging process and population size varies as the algorithm runs. The experiments for evaluating CLABC are conducted on the dynamic moving peak benchmarks. Furthermore, the proposed algorithm is applied to a real-world application of dynamic RFID network optimization. Statistical analysis of all these cases highlights the significant performance improvement due to the beneficial combination and demonstrates the performance superiority of the proposed algorithm.     

Bacterial foraging algorithm with varying population

Most of evolutionary algorithms (EAs) are based on a fixed population. However, due to this feature, such algorithms do not fully explore the potential of searching ability and are time consuming. This paper presents a novel nature-inspired heuristic optimization algorithm: bacterial foraging algorithm with varying population (BFAVP), based on a more bacterially-realistic model of bacterial foraging patterns, which incorporates a varying population framework and the underlying mechanisms of bacterial chemotaxis, metabolism, proliferation, elimination and quorum sensing. In order to evaluate its merits, BFAVP has been tested on several benchmark functions and the results show that it performs better than other popularly used EAs, in terms of both accuracy and convergency.     

On the role of collective sensing and evolution in group formation

Collective sensing is an emergent phenomenon which enables individuals to estimate a hidden property of the environment through the observation of social interactions. Previous work on collective sensing shows that gregarious individuals obtain an evolutionary advantage by exploiting collective sensing when competing against solitary individuals. This work addresses the question of whether collective sensing allows for the emergence of groups from a population of individuals without predetermined behaviors. It is assumed that group membership does not lessen competition on the limited resources in the environment, e.g., groups do not improve foraging efficiency. Experiments are run in an agent-based evolutionary model of a foraging task, where the fitness of the agents depends on their foraging strategy. The foraging strategy of agents is determined by a neural network, which does not require explicit modeling of the environment and of the interactions between agents. Experiments demonstrate that gregarious behavior is not the evolutionary-fittest strategy if resources are abundant, thus invalidating previous findings in a specific region of the parameter space. In other words, resource scarcity makes gregarious behavior so valuable as to make up for the increased competition over the few available resources. Furthermore, it is shown that a population of solitary agents can evolve gregarious behavior in response to a sudden scarcity of resources, thus individuating a possible mechanism that leads to gregarious behavior in nature. The evolutionary process operates on the whole parameter space of the neural networks; hence, these behaviors are selected among an unconstrained set of behavioral models.     

Artificial bee colonies for continuous optimization: Experimental analysis and improvements

The artificial bee colony (ABC) algorithm is a recent class of swarm intelligence algorithms that is loosely inspired by the foraging behavior of honeybee swarms. It was introduced in 2005 using continuous optimization problems as an example application. Similar to what has happened with other swarm intelligence techniques, after the initial proposal, several researchers have studied variants of the original algorithm. Unfortunately, often these variants have been tested under different experimental conditions and different fine-tuning efforts for the algorithm parameters. In this article, we review various variants of the original ABC algorithm and experimentally study nine ABC algorithms under two settings: either using the original parameter settings as proposed by the authors, or using an automatic algorithm configuration tool using a same tuning effort for each algorithm. We also study the effect of adding local search to the ABC algorithms. Our experimental results show that local search can improve considerably the performance of several ABC variants and that it reduces strongly the performance differences between the studied ABC variants. We also show that the best ABC variants are competitive with recent state-of-the-art algorithms on the benchmark set we used, which establishes ABC algorithms as serious competitors in continuous optimization.     

A critical analysis of parameter adaptation in ant colony optimization

Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have been proposed. In the literature, these methods have been shown to improve the quality of the results achieved in some particular contexts. In particular, they proved to be successful when applied to novel ant colony optimization algorithms for tackling problems that are not a classical testbed for optimization algorithms. In this paper, we show that the adaptation methods proposed so far do not improve, and often even worsen the performance when applied to high performing ant colony optimization algorithms for some classical combinatorial optimization problems.     

Accelerated Simplified Swarm Optimization with Exploitation Search Scheme for Data Clustering

Data clustering is commonly employed in many disciplines. The aim of clustering is to partition a set of data into clusters, in which objects within the same cluster are similar and dissimilar to other objects that belong to different clusters. Over the past decade, the evolutionary algorithm has been commonly used to solve clustering problems. This study presents a novel algorithm based on simplified swarm optimization, an emerging population-based stochastic optimization approach with the advantages of simplicity, efficiency, and flexibility. This approach combines variable vibrating search (VVS) and rapid centralized strategy (RCS) in dealing with clustering problem. VVS is an exploitation search scheme that can refine the quality of solutions by searching the extreme points nearby the global best position. RCS is developed to accelerate the convergence rate of the algorithm by using the arithmetic average. To empirically evaluate the performance of the proposed algorithm, experiments are examined using 12 benchmark datasets, and corresponding results are compared with recent works. Results of statistical analysis indicate that the proposed algorithm is competitive in terms of the quality of solutions.     

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem

The fruit fly optimization algorithm (FOA) is a newly developed bio-inspired algorithm. The continuous variant version of FOA has been proven to be a powerful evolutionary approach to determining the optima of a numerical function on a continuous definition domain. In this study, a discrete FOA (DFOA) is developed and applied to the traveling salesman problem (TSP), a common combinatorial problem. In the DFOA, the TSP tour is represented by an ordering of city indices, and the bio-inspired meta-heuristic search processes are executed with two elaborately designed main procedures: the smelling and tasting processes. In the smelling process, an effective crossover operator is used by the fruit fly group to search for the neighbors of the best-known swarm location. During the tasting process, an edge intersection elimination (EXE) operator is designed to improve the neighbors of the non-optimum food location in order to enhance the exploration performance of the DFOA. In addition, benchmark instances from the TSPLIB are classified in order to test the searching ability of the proposed algorithm. Furthermore, the effectiveness of the proposed DFOA is compared to that of other meta-heuristic algorithms. The results indicate that the proposed DFOA can be effectively used to solve TSPs, especially large-scale problems.     

Adaptive foraging by predators as a cause of predator-prey cycles

Summary When foraging has costs, it is generally adaptive for foragers to adjust their foraging effort in response to changes in the population density of their food. If effort decreases in response to increased food density, this can result in a type-2 functional response; intake rate increases in a negatively accelerated manner as prey density increases. Unlike other mechanisms for type-2 responses, adaptive foraging usually involves a timelag, because foraging behaviours do not often change instantaneously with changes in food density or risks. This paper investigates predator-prey models in which there are explicit dynamics for the rate of adaptive change. Models appropriate to both behavioural and evolutionary change are considered. Both types of change can produce cycles under similar circumstances, but under some evolutionary models there is not sufficient genetic variability for evolutionary change to produce cycles. If there is sufficient variability, the remaining conditions required for cycles are surprisingly insensitive to the nature of the adaptive process. A predator population that approaches the optimum foraging strategy very slowly usually produces cycles under similar conditions as does a very rapidly adapting population.     

Evolutionary stability of optimal foraging: Partial preferences in the diet and patch models

In this article the patch and diet choice models of the optimal foraging theory are reanalyzed with respect to evolutionary stability of the optimal foraging strategies. In their original setting these fundamental models consider a single consumer only and the resulting fitness functions are both frequency and density independent. Such fitness functions do not allow us to apply the classical game theoretical methods to study an evolutionary stability of optimal foraging strategies for competing animals. In this article frequency and density dependent fitness functions of optimal foraging are derived by separation of time scales in an underlying population dynamical model and corresponding evolutionarily stable strategies are calculated. Contrary to the classical foraging models the results of the present article predict that partial preferences occur in optimal foraging strategies as a consequence of the ecological feedback of consumer preferences on consumer fitness. In the case of the patch occupation model these partial preferences correspond to the ideal free distribution concept while in the case of the diet choice model they correspond to the partial inclusion of the less profitable prey type in predators diet.     

DNA水平上检测正选择方法的研究进展

达尔文的自然选择学说指出, 自然选择作用是物种进化的主要因素。而1968年Kimura提出的中性进化学说认为中性突变和随机漂变才是进化的主要动力。在接下来的30多年时间中, 人们尝试从各种角度来检测自然选择是否存在。随着DNA测序技术的发展, 大量的DNA序列信息为检验自然选择提供了丰富的数据。因为自然选择会影响DNA变异模式, 所以可以通过分析现有的DNA样本来推断过去是否发生了自然选择。另一方面, 种群历史等因素也会影响到DNA变异模式, 因此会对自然选择的检测产生干扰。文章主要介绍了中性检验基本的概念, 全面回顾了一些经典的检验方法, 并着重介绍了近几年新发展出的研究方向。     

A dynamic habitat selection game

A patch selection game is formulated and analyzed. Organisms can forage in one of H patches. Each patch is characterized by the cost of foraging, the density and value of food, the predation risk, and the density of conspecifics. The presence of conspecifics affects the finding and sharing of food, and the predation risk. Optimal foraging theory can be viewed as a "1-person" game against nature in which the optimal patch choice of a specific organism is analyzed assuming that the number of conspecifics in other patches is fixed. In the general game theoretic approach, the behavior of conspecifics is included in the determination of the distinguished organism's strategy. An iterative algorithm is used to compute the solution of the "n-person" game or dynamic ESS, which differs from the optimal foraging theory solution. Experiments to test the proposed theory using rodents and seed trays are briefly discussed.     

Root Foraging Increases Performance of the Clonal Plant Potentilla reptans in Heterogeneous Nutrient Environments

Background

Plastic root-foraging responses have been widely recognized as an important strategy for plants to explore heterogeneously distributed resources. However, the benefits and costs of root foraging have received little attention.

Methodology/Principal Findings

In a greenhouse experiment, we grew pairs of connected ramets of 22 genotypes of the stoloniferous plant Potentilla reptans in paired pots, between which the contrast in nutrient availability was set as null, medium and high, but with the total nutrient amount kept the same. We calculated root-foraging intensity of each individual ramet pair as the difference in root mass between paired ramets divided by the total root mass. For each genotype, we then calculated root-foraging ability as the slope of the regression of root-foraging intensity against patch contrast. For all genotypes, root-foraging intensity increased with patch contrast and the total biomass and number of offspring ramets were lowest at high patch contrast. Among genotypes, root-foraging intensity was positively related to production of offspring ramets and biomass in the high patch-contrast treatment, which indicates an evolutionary benefit of root foraging in heterogeneous environments. However, we found no significant evidence that the ability of plastic foraging imposes costs under homogeneous conditions (i.e. when foraging is not needed).

Conclusions/Significance

Our results show that plants of P. reptans adjust their root-foraging intensity according to patch contrast. Moreover, the results show that the root foraging has an evolutionary advantage in heterogeneous environments, while costs of having the ability of plastic root foraging were absent or very small.     

Multi-Objective Community Detection Based on Memetic Algorithm

Community detection has drawn a lot of attention as it can provide invaluable help in understanding the function and visualizing the structure of networks. Since single objective optimization methods have intrinsic drawbacks to identifying multiple significant community structures, some methods formulate the community detection as multi-objective problems and adopt population-based evolutionary algorithms to obtain multiple community structures. Evolutionary algorithms have strong global search ability, but have difficulty in locating local optima efficiently. In this study, in order to identify multiple significant community structures more effectively, a multi-objective memetic algorithm for community detection is proposed by combining multi-objective evolutionary algorithm with a local search procedure. The local search procedure is designed by addressing three issues. Firstly, nondominated solutions generated by evolutionary operations and solutions in dominant population are set as initial individuals for local search procedure. Then, a new direction vector named as pseudonormal vector is proposed to integrate two objective functions together to form a fitness function. Finally, a network specific local search strategy based on label propagation rule is expanded to search the local optimal solutions efficiently. The extensive experiments on both artificial and real-world networks evaluate the proposed method from three aspects. Firstly, experiments on influence of local search procedure demonstrate that the local search procedure can speed up the convergence to better partitions and make the algorithm more stable. Secondly, comparisons with a set of classic community detection methods illustrate the proposed method can find single partitions effectively. Finally, the method is applied to identify hierarchical structures of networks which are beneficial for analyzing networks in multi-resolution levels.     

Dynamic population artificial bee colony algorithm for multi-objective optimal power flow

This paper proposes a novel artificial bee colony algorithm with dynamic population (ABC-DP), which synergizes the idea of extended life-cycle evolving model to balance the exploration and exploitation tradeoff. The proposed ABC-DP is a more bee-colony-realistic model that the bee can reproduce and die dynamically throughout the foraging process and population size varies as the algorithm runs. ABC-DP is then used for solving the optimal power flow (OPF) problem in power systems that considers the cost, loss, and emission impacts as the objective functions. The 30-bus IEEE test system is presented to illustrate the application of the proposed algorithm. The simulation results, which are also compared to nondominated sorting genetic algorithm II (NSGAII) and multi-objective ABC (MOABC), are presented to illustrate the effectiveness and robustness of the proposed method.     

微阵列数据的多目标免疫优化双聚类

DNA微阵列技术的发展为基因表达研究提供更有效的工具。分析这些大规模基因数据主要应用聚类方法。最近,提出双聚类技术来发现子矩阵以揭示各种生物模式。多目标优化算法可以同时优化多个相互冲突的目标,因而是求解基因表达矩阵的双聚类的一种很好的方法。本文基于克隆选择原理提出了一个新奇的多目标免疫优化双聚类算法,来挖掘微阵列数据的双聚类。在两个真实数据集上的实验结果表明该方法比其他多目标进化双聚娄算法表现出更优越的性能。     

Don'T fall off the adaptation cliff: when asymmetrical fitness selects for suboptimal traits

The cliff-edge hypothesis introduces the counterintuitive idea that the trait value associated with the maximum of an asymmetrical fitness function is not necessarily the value that is selected for if the trait shows variability in its phenotypic expression. We develop a model of population dynamics to show that, in such a system, the evolutionary stable strategy depends on both the shape of the fitness function around its maximum and the amount of phenotypic variance. The model provides quantitative predictions of the expected trait value distribution and provides an alternative quantity that should be maximized ("genotype fitness") instead of the classical fitness function ("phenotype fitness"). We test the model's predictions on three examples: (1) litter size in guinea pigs, (2) sexual selection in damselflies, and (3) the geometry of the human lung. In all three cases, the model's predictions give a closer match to empirical data than traditional optimization theory models. Our model can be extended to most ecological situations, and the evolutionary conditions for its application are expected to be common in nature.     

Multi-Hop Routing Optimization Method Based on Improved Ant Algorithm for Vehicle to Roadside Network

This paper proposes a route optimization method to improve the performance of route selection in Vehicle Ad-hoc Network （VANET）. A novel bionic swarm intelligence algorithm, which is called ant colony algorithm, was introduced into a traditional ad-hoc route algorithm named AODV. Based on the analysis of movement characteristics of vehicles and according to the spatial relationship between the vehicles and the roadside units, the parameters in ant colony system were modified to enhance the performance of the route selection probability rules. When the vehicle moves into the range of several different roadsides, it could build the route by sending some route testing packets as ants, so that the route table can be built by the reply information of test ants, and then the node can establish the optimization path to send the application packets. The simulation results indicate that the proposed algorithm has better performance than the traditional AODV algorithm, especially when the vehicle is in higher speed or the number of nodes increases.     

Evolutionary Optimization of Kernel Weights Improves Protein Complex Comembership Prediction

In recent years, more and more high-throughput data sources useful for protein complex prediction have become available (e.g., gene sequence, mRNA expression, and interactions). The integration of these different data sources can be challenging. Recently, it has been recognized that kernel-based classifiers are well suited for this task. However, the different kernels (data sources) are often combined using equal weights. Although several methods have been developed to optimize kernel weights, no large-scale example of an improvement in classifier performance has been shown yet. In this work, we employ an evolutionary algorithm to determine weights for a larger set of kernels by optimizing a criterion based on the area under the ROC curve. We show that setting the right kernel weights can indeed improve performance. We compare this to the existing kernel weight optimization methods (i.e., (regularized) optimization of the SVM criterion or aligning the kernel with an ideal kernel) and find that these do not result in a significant performance improvement and can even cause a decrease in performance. Results also show that an expert approach of assigning high weights to features with high individual performance is not necessarily the best strategy.     

利用改进的3DMax算法重构染色体3D结构

近年来,随着高通量染色体构象捕获(Hi-C)等技术的发展和高通量测序成本的降低,全基因组交互作用的数据量快速增长,交互作用图谱分辨率不断提高,促使染色体和基因组三维结构建模的研究取得了很大进展,已经提出了几种从染色体构象捕捉数据中构建单个染色体或整个基因组结构的方法。文中通过对在 Hi-C 数据基础上对染色体三维结构重建的相关文献进行分析,总结了重建染色体三维空间结构的经典算法3DMax的原理,并且提出了一种新的随机梯度上升算法:XNadam,是Nadam优化方法的一个变体,将其应用于3DMax算法中,以便提高3DMax算法的性能,从而用于预测染色体三维结构。