遗传算法综述

本文主要回顾了遗传算法的发展历程,并对遗传算法的基本原理及特点作了简要阐述。进一步指出了遗传算法存在的问题及相应的改进措施,讨论了遗传算法在实际中的应用。     

基于遗传算法的高职化工院校排课系统的设计与实现

排课问题是一个有约束的、多目标的组合优化问题,并且已经被证明是一个NP完全问题。遗传算法是一种随机搜索算法,非常适合于解决NP问题。本文将遗传算法应用于求解课表问题,采用优化编码结构组合的方法减少排课冲突,降低算法的复杂度;对排课问题的关键参数进行量化分析,针对染色体编码完成各个遗传算子的设计和开发任务,最后集成排课的整体优化算法。     

基于遗传算法的Peer to Peer路由算法R GA*

路由算法是制约PeertoPeer 系统整体性能的关键因素之一。目前大多数路由算法无法保证全局收敛,而链路延迟、费用、网络带宽等现实制约因素往往在选路时被忽略。针对上述问题,提出了基于遗传算法的RGA路由算法。通过适度函数和遗传因子,RGA可以快速地实现全局收敛。同时将链路的延迟、费用、带宽等参数插入到适度函数中, 避免了盲目路由。仿真试验的结果表明,RGA路由算法在大规模PeertoPeer系统中是高效和可扩展的。     

On Model-Based Evolutionary Computation

 Traditional evolutionary computing techniques use an explicit fitness function – mathematical or simulated – to derive a solution to a problem from a population of individuals, over a number of generations. In this paper an approach which allows such techniques to be used on problems in which evaluations are costly, which cannot be expressed formally, or which are difficult to simulate, is examined. A neural network is trained using example individuals with the explicit fitness and the resulting model of the fitness function is then used by the evolutionary algorithm to find a solution. It is shown that the approach is effective over a small range of function types in comparison to the traditional approach when limited training data is available. An iterative step is then added whereby after a number of generations the current best individual in a population is evaluated directly on the explicit fitness function. The individual and its “real” fitness are then added to the training data and the neural network is re-trained to improve its approximation of the fitness function. It is shown that in this way the performance of the model-based architecture is greatly improved on more rugged/complex landscapes without a large increase in the amount of training data required.     

Structure optimization of neural networks for evolutionary design optimization

We study the use of neural networks as approximate models for the fitness evaluation in evolutionary design optimization. To improve the quality of the neural network models, structure optimization of these networks is performed with respect to two different criteria: One is the commonly used approximation error with respect to all available data, and the other is the ability of the networks to learn different problems of a common class of problems fast and with high accuracy. Simulation results from turbine blade optimizations using the structurally optimized neural network models are presented to show that the performance of the models can be improved significantly through structure optimization.We would like to thank the BMBF, grant LOKI, number 01 IB 001 C, for their financial support of our research.     

用于分类规则提取的演化算法分析与设计

在知识发现流程中,分类规则是主要的挖掘任务之一。针对传统的基于统计分析的挖掘算法在保证知识的有趣性方面的缺陷,提出了利用演化计算这种智能计算模型的全局搜索特性和完全适应值导向特性来进行分类知识的自动挖掘和处理,不需要先验知识,以确保知识的有趣性。提出了用IF-THEN这种高层次的知识表示形式来提高知识的可理解性。并给出了个体表示,遗传操作和适应值评估等几个在演化算法中起重要作用的成分的设计原则和方法。     

Application of a novel IWO to the design of encoding sequences for DNA computing

Encoding and processing information in DNA-, RNA- and other biomolecule-based devices is an important requirement for DNA based computing with potentially important applications. To make DNA computing more reliable, much work has focused on designing the good DNA sequences. However, this is a bothersome task as encoding problem is an NP problem. In this paper, a new methodology based on the IWO algorithm is developed to optimize encoding sequences. Firstly, the mathematics models of constrained objective optimization design for encoding problems based on the thermodynamic criteria are set up. Then, a modified IWO method is developed by defining the colonizing behavior of weeds to overcome the obstacles of the original IWO algorithm, which cannot be applied to discrete problems directly. The experimental results show that the proposed method is effective and convenient for the user to design and select effective DNA sequences in silicon for controllable DNA computing.     

基于MGA的费用分配优化模型研究

针对费用分配实际问题,建立了优化数学模型,提出了基于遗传算法的多目标多因子求解方法,对求解过程中的选择操作方法、体内自交叉算子和增减变异算子、编码方法、适应度函数和原始种群等作了改进设计。     

Evolutionary ensemble of diverse artificial neural networks using speciation

Recently, many researchers have designed neural network architectures with evolutionary algorithms but most of them have used only the fittest solution of the last generation. To better exploit information, an ensemble of individuals is a more promising choice because information that is derived from combining a set of classifiers might produce higher accuracy than merely using the information from the best classifier among them. One of the major factors for optimum accuracy is the diversity of the classifier set. In this paper, we present a method of generating diverse evolutionary neural networks through fitness sharing and then combining these networks by the behavior knowledge space method. Fitness sharing that shares resources if the distance between the individuals is smaller than the sharing radius is a representative speciation method, which produces diverse results than standard evolutionary algorithms that converge to only one solution. Especially, the proposed method calculates the distance between the individuals using average output, Pearson correlation and modified Kullback–Leibler entropy to enhance fitness sharing performance. In experiments with Australian credit card assessment, breast cancer, and diabetes in the UCI database, the proposed method performed better than not only the non-speciation method but also better than previously published methods.     

基于老年群体的健身器材交互设计研究

当今社会,人口老龄化已经成为全世界共同的社会问题,中国也在逐步迈入老龄化社会行列,然而现代信息社会正向年轻化发展。两者的矛盾不言而喻,这让老年人与现代社会脱节越来越严重。文章以老年人健身器材为研究对象,在了解老年人特点的基础上,分析老年人交互式产品的设计原则,总结老年人健身器材设计现状,并提出老年人健身器材交互设计的方法,希望对解决当今社会老龄化问题有一定的推动作用。