连续时间遗传算法模型及其强收敛性分析

本文在隐马尔可夫链的框架下利用隐马尔可夫链{Xt:t∈[0,∞)}的观测链的概率分布提出一个连续化遗传算法模型，并给出其一个强收敛结果，讨论了其离散骨架的性质。     

Capability Analysis of Chaotic Mutation and Its Self-Adaption

Through studying several kinds of chaotic mappings‘ distributions of orbital points, we analyze the capabilityof the chaotic mutations based on these mappings. Nunerical experiments support our conclusions very well. Thecapability analysis also led to a self-adaptive mechanism of chaotic mutation. The introducing of the self-adaptivechaotic mutation can improve the performance of genetic algorithm very prominently.     

中国普通野生稻线粒体DNA的限制性片段长度多态性

用BamHI／H454、BamHI／pQT2-7-1、EcoRI／B376和EcoRI／pQT12四种酶／探针组合对85份普通野生稻、亚洲栽培稻和橹稻进行了线粒体DNA的限制性片段长度多态性的分析．共检测到16条多态性带，15种表型，组合成14种线粒体DNA变异类型．其中抽稻和粳稻的线粒体DNA已分化，培稻偏粳型，大部分普通野生稻属（或偏）拉型，但江西的东乡普通野生稻类型比较独特．中国普遍野生稻的线粒体DNA与地理分布相关，湖南的江永、茶陵和江西的东乡等不同的群体以地理位置相聚，随地理梯度遗传分化由少到多．     

Application of Genetic Algorithm to the QSAR Research of Pyrrolobenzothiazepinones and Pyrrolobenzoxazepinones-Novel and Specific Non-Nucleoside HIV-1 Reverse Transcription Inhibitors

Quantitativestructure-activityrelationship(QSAR)modelingprovidesarationalbasisforunderstandingmechanismsofbiologicalperformanceandformodifyingchemicalstfucturetoimProveperformancebyaltCringchemicalstIuctllre.Itiswellknownthatoneofthemostimportantanddiffcultproblemintraditionalquantitativestructure-activityrelationshipistheproperchoiceoftheadequatefeaturesforbuildingtheregressionmodels.Recentlysomereportssuggestthatgeneticalgorithms(GA)maybeusefulinQSARanalysis.WehavedevelopedaQSARprogra…     

A DERIVATIVE-FREE ALGORITHM FOR UNCONSTRAINED OPTIMIZATION

In this paper a hybrid algorithm which combines the pattern search method and the genetic algorithm for unconstrained optimization is presented. The algorithm is a deterministic pattern search algorithm,but in the search step of pattern search algorithm,the trial points are produced by a way like the genetic algorithm. At each iterate, by reduplication,crossover and mutation, a finite set of points can be used. In theory,the algorithm is globally convergent. The most stir is the numerical results showing that it can find the global minimizer for some problems ,which other pattern search algorithms don＇t bear.     

The coevolution theory of the origin of the genetic code

A review of the coevolution theory of the origin of the genetic code is presented. This theory maintains that the origin of the code should be sought in the biosynthetic relationships between amino acids. In particular, some amino acids, the precursors, occupied the structure of the genetic code early on. As the product amino acids developed from these precursors, part or all of the codon domain of the precursor amino acid was ceded to the product amino acids, which resulted in the structuring of the genetic code. This paper therefore reviews the evidence in favour of this theory. The existence of some molecular fossils representing the biosynthetic pathways on which the coevolution theory suggests biosynthetic transformations took place (precursor amino acid → product amino acid) seems to be a strong corroboration of this theory. A generalisation imposed by this theory on the ancestral metabolic state is then discussed and, finally, the main prospects that seem to stem from the coevolution theory are presented.     

遗传算法、差分演化和一个处理约束的映射

S.Koziel和Z.Michalewicz(1999年)提出了一个处理约束的映射,研究该映射与不同算法相结合后的不同的代数结构.从理论上证明了当其与遗传算法相结合时,该映射是同构映射,而在差分演化算法的变异操作下,该映射不是同态映射,更不是同构映射.进而表明,该映射更适宜于与遗传算法相结合,而并不太适宜于与差分演化算法(及其类似的算法)相结合。     

基于最优保存和自适应性的混合遗传算法

1 引 言遗传算法（Genetic Algorithm,GA）是由Michigan大学Holland等创立的.常用的遗传算法一般有以下三种:简单遗传算法（Simple Genetic Algorithm,SGA）或称标准遗传算法（Canonical Genetic Algorithm,CGA）、最优保存简单遗传算法（Optimum MaintainingSimple Genetric Algorithm,OMSGA）和自适应遗传算法（Adaptive Genetic Algorithm,AGA）.     

水资源可再生能力综合评价的遗传加权物元模型

为了科学地计算水资源可再生能力评价指标的权重 ,使评价方法具有可操作性 ,采用主、客观相结合的赋权基点法 ,以全局收敛的格雷码加速遗传算法为工具来确定权重 ,并结合物元分析理论 ,建立了一种新的评价模型——遗传加权物元模型 .文中给出了该模型实施的详细步骤 ,对黄河流域 9个行政分区的水资源可再生能力进行了综合评价 ,取得了较好的效果 .     

一种基于合作与满意的群决策方法

从信息熵和相对熵的概念出发 ,提出了“不合作度”和“不满意度”的概念 ,通过论证指出了理想合作群“不合作度”和“不满意度”均为零的特点 .针对此特点 ,建立了基于“不合作度”和“不满意度”最小的优化模型 ,并针对模型 ,对遗传算法进行改进 ,使之适合于求解模型 .最后通过算例表明了此群决策方法的有效性和实用性 .