基于改进遗传算法的单级多项目无能力约束生产批量问题研究

通过对单级多项目无能力约束生产批量问题(SMULP)模型进行分析，得出了一些重要的结论．分析了基本遗传算法的缺陷及其产生的原因．对该问题在遗传算法的编码、适应度函数、选择复制操作、交叉方法、交叉概率、变异概率和终止条件等各个环节进行了改进．采用VB6．0对SMULP改进遗传算法编程实现，能很好地与ERP软件集成．并对SMULP改进遗传算法进行了性能分析．     

Maximizing a Family of Optimal Statistics over a Nuisance Parameter with Applications to Genetic Data Analysis

In this article, a simple algorithm is used to maximize a family of optimal statistics for hypothesis testing with a nuisance parameter not defined under the null hypothesis. This arises from genetic linkage and association studies and other hypothesis testing problems. The maximum of optimal statistics over the nuisance parameter space can be used as a robust test in this situation. Here, we use the maximum and minimum statistics to examine the sensitivity of testing results with respect to the unknown nuisance parameter. Examples from genetic linkage analysis using affected sub pairs and a candidate-gene association study in case-parents trio design are studied.     

测试产生的神经网络方法及若干问题研究

介绍了在微机上开发的一种基于神经网络的测试生成系统结构，详细讨论了系统中各模块的实现方案。从提高效率的角度，对电路测试生成中神经网络这一方法的发展及今后须解决的问题做了讨论     

Genetic algorithms for numerical optimization

Genetic algorithms (GAs) are stochastic adaptive algorithms whose search method is based on simulation of natural genetic inheritance and Darwinian striving for survival. They can be used to find approximate solutions to numerical optimization problems in cases where finding the exact optimum is prohibitively expensive, or where no algorithm is known. However, such applications can encounter problems that sometimes delay, if not prevent, finding the optimal solutions with desired precision. In this paper we describe applications of GAs to numerical optimization, present three novel ways to handle such problems, and give some experimental results.     

蛋白质谱数据的特征提取

变性蛋白质与正常对照组的蛋白质的HPLC-MS谱图存在人工无法发现的差异性,也是本文所说的特征,本文的研究工作就是通过信息学的方法寻找这些特征。实际工作中,我们先从谱图中提取数据,重新采样,并且对采样数据进行基线校正,归一化,噪声降解,得到预处理好的数据集。然后利用遗传算法来最优化结果,找到了变性蛋白质的特征谱线。我们期望根据这些特征建立未知蛋白质的分类模型,为疾病的诊断提供依据。     

基于模拟退火的进化算法性能对比研究

将模拟退火算法和遗传算法、粒子群优化算法分别进行结合,形成模拟退火—遗传算法以及模拟退火—粒子群优化算法,并作性能对比分析。研究结果表明,这两种算法都在进化代数和全局寻优能力方面有较大突破,在找寻最佳个体解的效率上,模拟退火—粒子群优化算法更突出。     

一种基于RCPT码的渐进图像传输方法

将等级树中的集分割编码器输出的码流分组,根据输出的分组数据对重建图像重要性的不同,传输前采用纠错能力不同的RCPT码保护。在总的码率限制下,采用遗传算法从有限码率集中选择每组数据的RCPT码码率,使接收端恢复的图像失真最小。将等误差保护码率作为遗传算法的初始种群,减少了最优码率集的搜索时间。在二进制对称信道上的仿真结果表明,该渐进图像传输方法实现简单,在高误码率信道条件下恢复图像仍能得到很高的峰值信噪比。     

A genetic algorithm tutorial

This tutorial covers the canonical genetic algorithm as well as more experimental forms of genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The tutorial also illustrates genetic search by hyperplane sampling. The theoretical foundations of genetic algorithms are reviewed, include the schema theorem as well as recently developed exact models of the canonical genetic algorithm.     

A genetic algorithm for determining optimal replenishment cycles to minimize maximum warehouse space requirements

In a supply chain, it is an important issue for logistic managers to offset the replenishment cycles of multiple products sharing a warehouse so as to minimize the maximum warehouse space requirement (MWSR). Most of the studies in the literature assume that warehouses replenish at the beginning of some basic planning period. In this paper, we relax this assumption by allowing the warehouse to replenish at any time. In order to solve this problem, we conduct theoretical analysis based on Fourier series and Fourier transforms and propose a procedure that is used to calculate MWSR efficiently for any given replenishment schedule. Then, we employ this procedure in a genetic algorithm (GA) to search for the optimal replenishment schedule. Using randomly generated instances, we show that the proposed GA significantly outperforms a previously published heuristic.     

Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs

We present a tractable class of integer feasibility problems. This class of max-closed IP problems was studied in somewhat restricted form by Glover, Pnueli, Hochbaum and Chandrasekaran and has a logic counterpart known as the class of Horn formulas. First we modify the existing algorithms in order to avoid the related recognition problem. Then we show that in order to solve these max-closed IP problems, simplicial path following methods can be used. This is important because these methods are flexible with respect to starting conditions, which make them more suitable than the top-down truncation algorithms that have been suggested.