一种十进制自适应并行遗传算法

针对遗传算法中的早收敛现象,从增强和保持种群多样性出发,引入自适应并行遗传算子的进化策略,提出了一种十进制自适应并行遗传算法(Decimal Adaptive Parallel Genetic Algorithm).实验结果表明,该算法对多个标准测试函数都表现出较好的搜索性能.     

A new evolutionary algorithm for function optimization

A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good performance. The computation results show that its generality, precision, robustness, simplicity and performance are all satisfactory. Foundation item: Supported by the National Natural Science Foundation of China (No. 69635030), National 863 High Technology Project of China, the Key Scientific Technology Development Project of Hubei Province. Biography: GUO Tao(1971-), male, Ph D, research interests are in evolutionary computation and network computing.     

基于实数编码的多种群演化遗传算法

针对标准遗传算法(SGA)在实际应用中存在早熟收敛、精度较差及运算速度慢的缺点,提出了一种基于实数编码的多种群演化遗传算法(RMGA).实验结果表明该算法能够有效的提高全局搜索能力和局部快速搜索能力,对改进SGA的缺点是十分有效的.     

基于实数编码的遗传算法收敛性研究

基于群体搜索的遗传算法求解复杂优化问题具有独特的优势,现有遗传算法的研究大多集中在算法的设计和数值实验效果的比较上. 该文给出了求解一类复杂优化问题的遗传算法(RFGA)的基本框架,并用概率论的有关理论对RFGA的收敛性进行了研究,结果表明RFGA以概率1收敛到问题的最优解.     

A parallel global-local mixed evolutionary algorithm for multimodal function optimization based on domain decomposition

This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly. Foundation item: Supported by the National Natural Science Foundation of China (60133010,60073043,70071042) Biography: Wu Zhi-jian(1963-), male, Associate professor, research direction: parallel computing, evolutionary computation.     

改进的实码加速遗传算法

对实码加速遗传算法(RAGA)8个步骤的局部参数进行修改,再对最后一次加速收缩后的区间用标准遗传算法(SGA)进行精细搜索。经过实例证明,改进后的算法计算机运行的次数减少,并且精度也得到提高。另外,对加速后的区间产生偏向最优点一侧的概率做了理论上的探讨,提出了把区间端点值重新赋给2个个体参加下一轮搜索。这样处理后避免舍去上次搜索的最优值,在一定程度上避免了某个变量的搜索区间在最优值一侧发生偏移。     

遗传退火进化算法在背包问题中的应用

从增强算法收敛性和减少参数依赖性的角度出发，提出应用遗传退火进化算法求解背包问题，遗传退火进化算法结合了遗传算法和模拟退火算法的优点，并有效地克服了各自的弱点，使其在优化性能、优化效率和可靠性方面具有明显的优越性．阐明了用该算法求解背包问题的具体实现过程，并通过实际数值计算和结果比较表明，该算法优于遗传算法和模拟退火算法．     

基于演化算法的SAT问题求解

演化计算方法是近年来迅速发展起来的一种全新随机搜索和优化方法.首先介绍了演化算法的基本原理,然后给出了基于演化思想求解著名逻辑学问题——布尔可满足问题(SAT)的过程,最后分析了该方法的主要特点.     

Drift analysis in studying the convergence and hitting times of evolutionary algorithms: An overview

This paper introduces drift analysis approach in studying the convergence and hitting times of evolutionary algorithms. First the methodology of drift analysis is introduced, which links evolutionary algorithms with Markov chains or supermartingales. Then the drift conditions which guarantee the convergence of evolutionary algorithms are described. And next the drift conditions which are used to estimate the hitting times of evolutionary algorithms are presented. Finally an example is given to show how to analyse hitting times of EAs by drift analysis approach. Foundation item: Supported by Engineering and Physical Science Research Courcil (GR R52541 01) and State Laboratory of Software Engineering Foundation item: Supported by Engineering and Physical Science Research Courcil (GR R52541 01) and State Laboratory of Software Engineering Biography: He Jun( 1967-), male, visiting fellow at State Key Lab of Software Engineering, Ph D. , research direction: computational intelligence     

引入演化效率因子的演化算法设计

随着电子芯片技术的发展，电路系统不断向高集成度和智能化发展。在复杂电磁场环境的各种干扰下，对信息化电子系统的稳定性和可靠性要求越来越高，电子系统的可靠性及自主容错能力成为电路设计所面临的新挑战。为提高恶劣情况下电路的抗干扰能力，提出将分析得到的演化效率因素作为算法的影响因子，引入到演化算法的适应度函数中，对算法进行提高和改进。研究结果表明，在单点短路和断路故障仿真实验中，引入演化效率因子的演化算法的平均无故障概率分别为0.754和0.853。与传统的演化算法相比，两者分别提高了16.4%和14%；与自适应算法相比，两者分别提高了6.7%和5%，证明在受扰或局部损伤的情况下，引入演化效率因子能够有效提升电路系统的鲁棒性及容错抗扰能力。研究结果对改进电路设计的强化及完善有一定的参考价值。     

一种基于遗传算法的模糊C均值算法

模糊C-均值聚类(FCM)对初始值很敏感,易于陷入局部极小点而不能搜索到全局的聚类中心,遗传算法是一种通过模拟自然进化过程的搜索最优解的方法.因此,将FCM算法引入遗传算法的进化中,代替原来的交叉操作.实验结果表明,新方法明显优于传统 FCM算法.     

A two-level subspace evolutionary algorithm for solving multi-modal function optimization problems

In this paper, a new algorithm for solving multimodal function optimization problems-two-level subspace evolutionary algorithm is proposed. In the first level, the improved GT algorithm is used to do global recombination search so that the whole population can be separated into several niches according to the position of solutions; then, in the second level, the niche evolutionary strategy is used for local search in the subspaces gotten in the first level till solutions of the problem are found. The new algorithm has been tested on some hard problems and some good results are obtained. Foundation item: Supported by the National Natural Science Foundation of China (70071042, 60073043, 60133010). Biography: Li Yan( 1974-), female, Ph. D candidate, research interest: evolutionary computation.     

求解约束优化问题的一种新的进化算法

分析了现有的约束优化进化算法的一些不足之处，提出了一种处理约束优化问题的新算法。新算法将多目标优化思想与全局搜索和局部搜索机制有机地结合起来；在全局搜索过程中，作为一种小生态遗传算法，排挤操作利用Pareto优劣关系比较个体并接受具有相似性的父代个体和予代个体中的优胜者；在局部搜索过程中，首先对局部群体中的个体赋予Pareto强度，然后根据Pareto强度选择个体。通过一个复杂高维多峰测试函数验证了新算法的有效性。     

Cell evolutionary algorithm: a new optimization method on ground-state energy of the atomic

The purpose of this paper is to present a new general approach to solve ground-state energies of the double-electron systems in a uniform magnetic field, in which the basic element of evolution is the set in the solution space, rather than the point. The paper defines the Cell Evolutionary Algorithm, which implements such a view of the evolution mechanism. First, the optimal set in which the optimal solution may be obtained. Then this approach applies the embedded search method to get the optimal solution. We tested this approach on the atomic structure, and the results show that it can improve not only the efficiency but also the accuracy of the calculations as it relates to this specific problem. Foundation item: Supported by the opening Foundation of state key Laboratory of Magnetic Resonance and Atomic and Molecular physics, Wuhan Institute of physics, Chinese Academy of Science (981510) Biography: Liu Lian-jun(1946-), female, Associate professor, research direction: atom and molecular physics.     

一种分类的小波零树与分形混合图像编码算法

通过分析小波零树编码和分形编码各自的优点与不足,结合自身的特点,提出一种基于分类的混合图像编码算法。该方法把图像分割后的块分为3类,对不同类型的块分别采用分形算法或零树编码的改进算法SPIHT算法编码;结果表明,与单独使用这两种算法相比,混合编码算法的重构图像质量有一定程度的提高。     

A Multi-objective optimal evolutionary algorithm based on tree-ranking

Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has some shortcomings, in this paper, we proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can reach the Pare-to front, retain the diversity of the population, and use less time. Foundation item: Supported by the National Natural Science Foundation of China(60073043, 70071042, 60133010) Biography: Shi Chuan( 1978-), male, Master candidate, research direction; intellective computation, evolutionary computation.     

多维函数优化的遗传算法研究

本文研究了求解多变量函数优化问题的遗传算法,在此算法中采用了十进制浮点数基因表示方法,并相应地提出了一种叠加零均值Gauss随机扰动的变异方法,研究表明,对于满足组件假说的多维函数优化问题,这种遗传算法具有较高的搜索效率．     

A New Algorithm for On-Line Handwriting Signature Verification Based on Evolutionary Computation

The paper proposes an on-line signature verification algorithm, through which test sample and template signatures can be optimizedly matched, based on evolutionary computation （EC）. Firstly, the similarity of signature curve segment is defined, and shift and scale transforms are also introduced due to the randoness of on-line signature. Secondly, this paper puts forward signature verification matching algorithm after establishment of the mathematical model. Thirdly, the concrete realization of the algorithm based on EC is discussed as well. In addition, the influence of shift and scale on the matching result is fully considered in the algorithm. Finally, a computation example is given, and the matching results between the test sample curve and the template signature curve are analyzed in detail, The preliminary experiments reveal that the type of signature verification problem can be solved by EC.     

NIQGA改进及基于可变角距离的新型量子进化算法

为了提高量子进化算法的执行效率,在NIQGA算法基础上,通过改进△θi和S(αi,βi)参数表提出了一种改进算法INIQGA.又通过引入量子比特间角距离定义,提出了一种基于可变角距离旋转的量子进化算法QEA-VAR,该算法采用旋转门操作进行种群进化时,依据当前染色体中量子比特|φ〉i与最优解对应基态| 0〉或| 1〉的...     

一种面向新型视频编码器的快速算法

为降低多功能视频编码标准(VVC)编码的复杂度,提出一种面向VVC的帧内快速编码算法.首先,根据视频内容的时空域相关性,使用反向传播(BP)神经网络对CU的划分深度进行预测;然后,使用统计概率对CU的划分模式进行选择;最后,编码时跳过不必要的划分模式以节省编码时间.实验结果表明,与原始编码器相比,该算法平均可节省59.82%的编码时间,且在同等编码质量情况下比特率的平均增加值(BDBR)仅为2.05%.