SASEGASA: A New Generic Parallel Evolutionary Algorithm for Achieving Highest Quality Results

This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions.     

GA optimization on multi-segments muffler under space constraints

Whilst the space volume of muffler in noise control system is often constrained for maintenance in practical engineering work, the maximization on muffler’s performance becomes important and essential. In this paper, a novel approach genetic algorithms (GAs) based on the principles of natural biological evolution will be used to tackle this optimization of muffler design [M. Mitchell, An Introduction to Genetic Algorithms, The MIT Press, Cambridge, MA, 1996]. Here, the shape optimization of multi-segments muffler coupled with the GA searching technique is presented. The techniques of binary genetic algorithms (BGA) together with the commercial MATLAB package [G. Lindfield, J. Penny, Numerical Method Using Matlab, second ed., Prentice Hall, Englewood Cliffs, NJ, 2000] are applied in GA searching. In addition, a numerical case of pure tone elimination with 2-5 segments on muffler is introduced and fully discussed. To achieve the best optimization in GA, several GA parameters are on trial in various values. Results show that the GA operators, including crossover mutation and elitism, are essential in accuracy. Consequently, results verify that the optimal sound transmission loss at the designed frequency of 500 Hz is exactly maximized. The GA optimization on multi-segments muffler proposed in this study surely provides a quick and correct approach.     

智能组卷系统试题库结构的研究

在分析了传统的组卷系统的组卷算法及相应的试题库结构的基础上，基于遗传算法提出了一种新的试题库结构，并给定具体结构的确定方法。实践表明，这种结构下的试题库很好地配合遗传算法实现了智能组卷，并且系统效率更高，冗余度更小。     

最优保存遗传算法在最优资产组合计算中的应用

本文基文献 [1]的思路 ,详细论述了利用遗传算法解决有风险控制的最优资产组合问题的具体实现过程 .并论证了用浮点数的方法表示的最优保存遗传算法的全局收敛性     

三十烷醇在GA_3影响水稻幼苗生长和生理性状中的增效作用

微量三十烷醇（ＴＲＩＡ）与ＧＡ３配合使用，比ＧＡ３单独使用能明显地促进幼苗生长和增加幼苗干物质积累．同时还增强了ＧＡ３对幼叶中叶绿素含量、可溶性蛋白质含量、呼吸速率、细胞膜透性和过氧化物酶活性的影响．ＧＡ３＋ＴＲＩＡ与ＧＡ３处理相比，促进幼叶内源ＧＡ３水平提高，稳定保持内源ＺＴ于一定水平，ＴＲＩＡ在ＧＡ３低浓度时降低ＩＡＡ水平，在高浓度时则提高ＩＡＡ水平．作者认为ＴＲＩＡ可作为ＧＡ３处理时的增效剂．     

Properties of a genetic algorithm extended by a random self-learning operator and asymmetric mutations: A convergence study for a task of powder-pattern indexing

Genetic algorithms represent a powerful global-optimisation tool applicable in solving tasks of high complexity in science, technology, medicine, communication, etc. The usual genetic-algorithm calculation scheme is extended here by introduction of a quadratic self-learning operator, which performs a partial local search for randomly selected representatives of the population. This operator is aimed as a minor deterministic contribution to the (stochastic) genetic search. The population representing the trial solutions is split into two equal subpopulations allowed to exhibit different mutation rates (so called asymmetric mutation). The convergence is studied in detail exploiting a crystallographic-test example of indexing of powder diffraction data of orthorhombic lithium copper oxide, varying such parameters as mutation rates and the learning rate. It is shown through the averaged (over the subpopulation) fitness behaviour, how the genetic diversity in the population depends on the mutation rate of the given subpopulation. Conditions and algorithm parameter values favourable for convergence in the framework of proposed approach are discussed using the results for the mentioned example. Further data are studied with a somewhat modified algorithm using periodically varying mutation rates and a problem-specific operator. The chance of finding the global optimum and the convergence speed are observed to be strongly influenced by the effective mutation level and on the self-learning level. The optimal values of these two parameters are about 6 and 5%, respectively. The periodic changes of mutation rate are found to improve the explorative abilities of the algorithm. The results of the study confirm that the applied methodology leads to improvement of the classical genetic algorithm and, therefore, it is expected to be helpful in constructing of algorithms permitting to solve similar tasks of higher complexity.     

光束变换光学和光束质量研究的某些新进展

本对光束变换光学和光束质量研究的某些新进展，包括二维和三维非高斯光束通过一阶光束系统的传输，一般光束的分类及其光束质量的描述作了评述和分析，并对这一领域中需要解决的困难和问题作了讨论。