基于群体智能的思维进化算法设计

针对思维进化算法（ＭＥＡ）没有充分利用公告板信息的问题,结合群体智能的优点,提出基于群体智能的思维进化算法,同时分析其算法的机制,设计利用群体信息共享进行子群体迁徙策略和拥挤浓度控制异化策略,提高了搜索速度,保证了种群的多样性．通过整个群体的总体优化特征体现了寻优方式的实现,使得收敛速度和全局收敛性均达到最好平衡．测试函数寻优及ＰＩＤ 控制器参数整定实验,验证了算法的可行性和高效性．     

基于群体智能的思维进化算法设计

针对思维进化算法（ＭＥＡ）没有充分利用公告板信息的问题,结合群体智能的优点,提出基于群体智能的思维进化算法,同时分析其算法的机制,设计利用群体信息共享进行子群体迁徙策略和拥挤浓度控制异化策略,提高了搜索速度,保证了种群的多样性．通过整个群体的总体优化特征体现了寻优方式的实现,使得收敛速度和全局收敛性均达到最好平衡．测试函数寻优及ＰＩＤ 控制器参数整定实验,验证了算法的可行性和高效性．

     

解Job-shop调度问题的混合模拟退火进化规划

提出运用混合模拟退火进化规划（ＳＡＥＰ）求解Ｊｏｂ－ｓｈｏｐ调度问题．首先介绍了ＳＡＥＰ和进化规划（ＥＰ）的不同选择方法以及他们的变异算子,最后给出了仿真实例,并比较了这两种算法的优劣     

基于思维进化机器学习的自适应趋同策略

基于思维进化的机器学习（ＭＥＢＭＬ）主要由趋同和异化算子构成,趋同策略的优劣直接影响着进化的效率与最优性。本文通过对趋同机理的分析给出了一种自适应趋同策略,包括了群体规模自适应调整和方差自适应调整。最后,以优化问题为仿真实例说明了方法的有效性。     

基于进化算法的SFSN神经网络

提出一种基于进化算法的ＳＦＳＮｔＳａｍｐｌｉｎｇＦｒｅｑｕｃｈｅｙ０ｓｅｎｓｉｔｉｖｅ Ｎｅｔｗｏｒｋ）神经网络分类量化方法,该算法把并行全局寻代的进化算法ＥＰ（Ｅｖｏｌｕｔｉｏｎａｒｙ Ｐｒｕｇｒａｍｍｉｎｇ）融合进ＳＦＳＮ神经网络,使神经网络的结构优化与参数优化同时完成。即同时解决了最佳分类数与最佳矢量量化问题。实验结果证实了算法的有效性。     

一种用于非参数系统辨识的粗糙进化方法

提出了一种用于非参数系统辨识的粗糙进化方法,该方法由嵌入ＡｐＥｎ的进化计算（ＥＣ）、进化粗糙集、基于信息论的组合型进化策略（ＥＳ）５和鲁棒非参数系统辨识所构成,该方法已用于Ｌｏｇｉｓｔｉｃ方程的辨识,这对于诸如家用电器的地系统来说也属于一种实用的技术,实验结果表明了文中方法的实用性和有效性。     

用GESA方法求解任务安排问题

ＧＥＳＡ方法是一种并行算法，它以一种新颖的方式综合了遗传算法，模拟退火（ｓｉｍｕｌａｔｅｄａｎｎｅａｌｉｎｇ）模拟进化（ｓｉｎｕｌａｔｅｄｅｖｏｌｕｔｉｏｎ）的思想，特别是ＧＥＳＡ方法中实施了区域引导了（ｒｅｇｉｏｎａｌｇｕｉｄａｎｃｅ），用ＧＥＳＡ方法求解任务安排问题，结果表明ＧＥＳＡ方法性能优越。     

演化信息协助的动态协同随机漂移粒子群优化算法

为了改善随机漂移粒子群算法的群体多样性，通过演化信息的协助，提出动态协同随机漂移粒子群优化（CRDPSO）算法。利用上下文粒子的向量信息，粒子之间的动态协作增加了种群多样性，这有助于提高群体的搜索能力，并使整个群体协同搜索全局最优值。同时在演化过程中的每次迭代，利用二维空间分割树结构来存储算法中的估计解的位置和适应度值，从而实现快速适应度函数逼近。由于适应度函数逼近增强了变异策略，因此变异是自适应且无参数的。通过典型测试函数将CRDPSO算法和差分进化算法（DE）、协方差矩阵适应进化策略算法（CMA-ES）、非重复访问遗传算法（cNrGA）以及三种改进的量子行为粒子群算法（QPSO）进行比较。实验结果表明，不管是对于单峰还是多峰测试函数，CRDPSO的性能均是最优的，证明了该算法的有效性。     

求解三对角线性方程组的双向并行分裂法

首先回顾了Ｈ．Ｈ．Ｗａｎｇ的分裂法＾［８］Ｍｉｃｈｉｅｌｓｅ＆Ｖｏｒｓｔ给出的改进算法＾［９］，分析了影响分裂法及改进算法的并行效率的主要因素，然后提出了一种求解三对角方程组的双向并行分裂法（简记为ＤＰＰ算法），ＤＰＰ算法的通讯建立的次数为Ｍ＆Ｖ算法的５０％，数据传输量为其３０％，最后在工作站网络环境下实现了ＤＰＰ算法，并就并行效率与Ｍ＆Ｖ算法进行了比较，结果表明在由６台工作站组成的网络中ＤＰＰ算     

描述系统扩展H∝控制

讨论了用扩展Ｈ∝控制方法来处理描述系统（ｄｅｓｃｒｉｐｔｏｒ ｓｙｓｔｅｍ,简记为ＤＳ）的非标准Ｈ∝控制问题,证明了解存在充要条件,并通过求解两个广义代数Ｒｉｃｃａｔｉ方程（ＧＡＲＥ）的准容许解,给出了ＤＳ扩展Ｈ∝控制器集合。     

On the equivalences and differences of evolutionary algorithms

Evolutionary algorithms (EAs) are fast and robust computation methods for global optimization, and have been widely used in many real-world applications. We first conceptually discuss the equivalences of various popular EAs including genetic algorithm (GA), biogeography-based optimization (BBO), differential evolution (DE), evolution strategy (ES) and particle swarm optimization (PSO). We find that the basic versions of BBO, DE, ES and PSO are equal to the GA with global uniform recombination (GA/GUR) under certain conditions. Then we discuss their differences based on biological motivations and implementation details, and point out that their distinctions enhance the diversity of EA research and applications. To further study the characteristics of various EAs, we compare the basic versions and advanced versions of GA, BBO, DE, ES and PSO to explore their optimization ability on a set of real-world continuous optimization problems. Empirical results show that among the basic versions of the algorithms, BBO performs best on the benchmarks that we studied. Among the advanced versions of the algorithms, DE and ES perform best on the benchmarks that we studied. However, our main conclusion is that the conceptual equivalence of the algorithms is supported by the fact that algorithmic modifications result in very different performance levels.     

Polygene-based evolutionary algorithms with frequent pattern mining

In this paper, we introduce polygene-based evolution, a novel framework for evolutionary algorithms (EAs) that features distinctive operations in the evolutionary process. In traditional EAs, the primitive evolution unit is a gene, wherein genes are independent components during evolution. In polygene-based evolutionary algorithms (PGEAs), the evolution unit is a polygene, i.e., a set of co-regulated genes. Discovering and maintaining quality polygenes can play an effective role in evolving quality individuals. Polygenes generalize genes, and PGEAs generalize EAs. Implementing the PGEA framework involves three phases: (I) polygene discovery, (II) polygene planting, and (III) polygene-compatible evolution. For Phase I, we adopt an associative classification-based approach to discover quality polygenes. For Phase II, we perform probabilistic planting to maintain the diversity of individuals. For Phase III, we incorporate polygene-compatible crossover and mutation in producing the next generation of individuals. Extensive experiments on function optimization benchmarks in comparison with the conventional and state-of-the-art EAs demonstrate the potential of the approach in terms of accuracy and efficiency improvement.     

Evolutionary design of Evolutionary Algorithms

Manual design of Evolutionary Algorithms (EAs) capable of performing very well on a wide range of problems is a difficult task. This is why we have to find other manners to construct algorithms that perform very well on some problems. One possibility (which is explored in this paper) is to let the evolution discover the optimal structure and parameters of the EA used for solving a specific problem. To this end a new model for automatic generation of EAs by evolutionary means is proposed here. The model is based on a simple Genetic Algorithm (GA). Every GA chromosome encodes an EA, which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization are generated by using the considered model. Numerical experiments show that the EAs perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.     

Time Complexity of Evolutionary Algorithms for Combinatorial Optimization： A Decade of Results

Computational time complexity analyzes of evolutionary algorithms (EAs) have been performed since the mid-nineties. The first results were related to very simple algorithms,such as the (1 1)-EA,on toy problems.These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems.In fact,in recent years,it has been possible to analyze the (1 1)-EA on combinatorial optimization problems with practical applications and more realistic population-baeed EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines.The most common mathematical techniques are introduced,the basic ideas behind them are discussed and their elective applications are highlighted.Solved problems that were still open are enumerated as are those still awaiting for a solution.New questions and problems arisen in the meantime are also considered.     

Improved differential evolution approach based on cultural algorithm and diversity measure applied to solve economic load dispatch problems

Evolutionary algorithms (EAs) are general-purpose stochastic search methods that use the metaphor of evolution as the key element in the design and implementation of computer-based problems solving systems. During the past two decades, EAs have attracted much attention and wide applications in a variety of fields, especially for optimization and design. EAs offer a number of advantages: robust and reliable performance, global search capability, little or no information requirement, and others. Among various EAs, differential evolution (DE), which characterized by the different mutation operator and competition strategy from the other EAs, has shown great promise in many numerical benchmark problems and real-world optimization applications. The potentialities of DE are its simple structure, easy use, convergence speed and robustness. To improve the global optimization property of DE, in this paper, a DE approach based on measure of population's diversity and cultural algorithm technique using normative and situational knowledge sources is proposed as alternative method to solving the economic load dispatch problems of thermal generators. The traditional and cultural DE approaches are validated for two test systems consisting of 13 and 40 thermal generators whose nonsmooth fuel cost function takes into account the valve-point loading effects. Simulation results indicate that performance of the cultural DE present best results when compared with previous optimization approaches in solving economic load dispatch problems.     

Observations in using parallel and sequential evolutionary algorithms for automatic software testing

In this paper we analyze the application of parallel and sequential evolutionary algorithms (EAs) to the automatic test data generation problem. The problem consists of automatically creating a set of input data to test a program. This is a fundamental step in software development and a time consuming task in existing software companies. Canonical sequential EAs have been used in the past for this task. We explore here the use of parallel EAs. Evidence of greater efficiency, larger diversity maintenance, additional availability of memory/CPU, and multi-solution capabilities of the parallel approach, reinforce the importance of the advances in research with these algorithms. We describe in this work how canonical genetic algorithms (GAs) and evolutionary strategies (ESs) can help in software testing, and what the advantages are (if any) of using decentralized populations in these techniques. In addition, we study the influence of some parameters of the proposed test data generator in the results. For the experiments we use a large benchmark composed of twelve programs that includes fundamental algorithms in computer science.     

How evolutionary algorithms are applied to statistical natural language processing

Statistical natural language processing (NLP) and evolutionary algorithms (EAs) are two very active areas of research which have been combined many times. In general, statistical models applied to deal with NLP tasks require designing specific algorithms to be trained and applied to process new texts. The development of such algorithms may be hard. This makes EAs attractive since they offer a general design, yet providing a high performance in particular conditions of application. In this article, we present a survey of many works which apply EAs to different NLP problems, including syntactic and semantic analysis, grammar induction, summaries and text generation, document clustering and machine translation. This review finishes extracting conclusions about which are the best suited problems or particular aspects within those problems to be solved with an evolutionary algorithm.     

Evolutionary algorithms based design of multivariable PID controller

In this paper, performance comparison of evolutionary algorithms (EAs) such as real coded genetic algorithm (RGA), modified particle swarm optimization (MPSO), covariance matrix adaptation evolution strategy (CMAES) and differential evolution (DE) on optimal design of multivariable PID controller design is considered. Decoupled multivariable PI and PID controller structure for Binary distillation column plant described by Wood and Berry, having 2 inputs and 2 outputs is taken. EAs simulations are carried with minimization of IAE as objective using two types of stopping criteria, namely, maximum number of functional evaluations (Fevalmax) and Fevalmax along with tolerance of PID parameters and IAE. To compare the performances of various EAs, statistical measures like best, mean, standard deviation of results and average computation time, over 20 independent trials are considered. Results obtained by various EAs are compared with previously reported results using BLT and GA with multi-crossover approach. Results clearly indicate the better performance of CMAES and MPSO designed PI/PID controller on multivariable system. Simulations also reveal that all the four algorithms considered are suitable for off-line tuning of PID controller. However, only CMAES and MPSO algorithms are suitable for on-line tuning of PID due to their better consistency and minimum computation time.     

A bi-population based scheme for an explicit exploration/exploitation trade-off in dynamic environments

Optimisation in changing environments is a challenging research topic since many real-world problems are inherently dynamic. Inspired by the natural evolution process, evolutionary algorithms (EAs) are among the most successful and promising approaches that have addressed dynamic optimisation problems. However, managing the exploration/exploitation trade-off in EAs is still a prevalent issue, and this is due to the difficulties associated with the control and measurement of such a behaviour. The proposal of this paper is to achieve a balance between exploration and exploitation in an explicit manner. The idea is to use two equally sized populations: the first one performs exploration while the second one is responsible for exploitation. These tasks are alternated from one generation to the next one in a regular pattern, so as to obtain a balanced search engine. Besides, we reinforce the ability of our algorithm to quickly adapt after cnhanges by means of a memory of past solutions. Such a combination aims to restrain the premature convergence, to broaden the search area, and to speed up the optimisation. We show through computational experiments, and based on a series of dynamic problems and many performance measures, that our approach improves the performance of EAs and outperforms competing algorithms.     

Hybridizations of evolutionary algorithms with Large Neighborhood Search

Recent developments of evolutionary algorithms (EAs) for discrete optimization problems are often characterized by the hybridization of EAs with local search methods, in particular, with Large Neighborhood Search. In this survey, we consider some of the most promising directions of this kind of hybridization and provide examples in the context of well-known optimization problems. We distinguish different approaches by the algorithmic components in which they make use of Large Neighborhood Search: initialization, recombination and the local improvement stages of hybrid EAs.