随机化均匀设计遗传算法

众所周知,遗传算法的运行机理及特点是具有定向制导的随机搜索技术,其定向制导的原则是:导向以高适应度模式为祖先的"家族"方向.以此结论为基础.利用随机化均匀设计的理论和方法,对遗传算法中的交叉操作进行了重新设计,给出了一个新的GA算法,称之为随机化均匀设计遗传算法.最后将随机化均匀设计遗传算法应用于求解函数优化问题,并与简单遗传算法和佳点集遗传算法进行比较.通过模拟比较,可以看出新的算法不但提高了算法的速度和精度,而且避免了其它方法常有的早期收敛现象,     

均匀设计抽样及其优良性质

抽样和设计是计算机试验的一个重要研究课题。本文提出了一种新的抽样方法—均匀设计抽样,研究了它的一些基本性质,并将其应用于数值积分近似计算,这种抽样是王元和方开泰(1981)均匀设计思想的一个发展,也是对Latin Hypercube抽样的一个重要改进,通过与Monte Carlo方法,Latin Hypercube抽样(包括OA-Based Latin Hypercube抽样)和均匀设计的比较,表明了这种抽样的优越性,最后还讨论了在一般分布情形下如何应用这种抽样。     

从设计到抽样

张润楚,王兆军（１９９６）提出了均匀设计抽样,将均匀设计变成抽样．本文给出一种由设计到抽样的一般方法,它可以将任何一个有优良均匀性的设计点集变成所有样本都有同样优良均匀性的抽样。     

均匀设计抽样的一、二阶矩

（７）中给出并研究了均匀设计抽样（ＵＤＳ）及随机化均匀设计（ＲＵＤ）的一些优良性质，作者给出该设计和抽样的一、二阶矩。     

正交表型均匀LH设计和抽样

本文提出了一种新的设计和抽样方法－正交表型均匀LH设计和抽样,证明了这种抽样空间是OALH抽样空间的优良子集。这种设计和抽样空间中所有样本都与初始设计具有同阶低偏差等一些优良性质。并将它用于数值积分,证明了对有关参数的估计的方差阶低于其他抽样。同时还给出了有关的模拟结果。     

均匀设计抽样的应用

均匀设计抽样是张润楚和王兆军提出的，并且张润楚和王兆军从理论上证明了它的优良性质。本文考虑了均匀设计抽样在求函数的最大值，积分的近似计算，回归直线的拟合和极大似然估计的求取方面的应用。模拟的结果再次说明了均匀设计抽样的优良性。     

相对强弱指数的最佳参数组合

本文首先提出了广义均匀设计抽样,并给出了利用广义均匀设计抽样在半连续半离散区域上求取函数最值的方法,之后利用这种方法,针对香港股票市场,给出了技术分析指标－相对强弱指数的最佳参数组合．     

移动平均线的最佳参数组合

本文首先简化了（1）的偏差计算公式，并利用此公式给出某些新的均匀设计表及某些非平衡均匀设计表。其次，提出了广义的均匀设计抽样，最后把随机化均匀设计与广义的均匀设计抽样应用于移动平均线，得到了它的最佳参数组合并得到了改进后移动平均线的最佳参数组合。     

均匀设计抽样的偏差

该文证明了均匀设计抽样点集的偏差为O（n－1（lnn）d），另外也证明了随机化均匀设计点集的偏差有同样的阶．最后进行了随机模拟．     

均匀试验设计的理论、方法和应用——历史回顾

本文回顾计算机仿真试验设计的主要两种方法:拉丁超立体抽样和均匀设计,在过去二十五年的发展,特别是均匀设计的发展,包括均匀设计的优良性研究、新的均匀性测度、均匀设计表的构造,以及均匀性在因子设计中的应用。     

用遗传算法求解分组旅行推销员问题

在遗传算法能够有效解决TSP问题的基础上，根据遗传算法——通过搜索大规模，多样化的种群，在种群间交换个体所携带的遗传信息，保留种群中个体的优越遗传信息——的思想，设计了求解分组TSP问题的遗传算法。算法中染色体表示、评价函数的构造、杂交变异算子的设计经过实例计算的检验被证明较为可靠；算法运算速度快，容易获得有效解。     

Aerospace design optimization using a steady state real-coded genetic algorithm

This study demonstrates the advantages of using a real coded genetic algorithm (GA) for aerospace engineering design applications. The GA developed for this study runs steady state, meaning that after every function evaluation the worst performer is determined and that worst performer is then thrown out and replaced by a new member that has been evaluated. The new member is produced by mating two successful parents through a crossover routine, and then mutating that new member. For this study three different preliminary design studies were conducted using both a binary and a real coded GA including a single stage solid propellant missile systems design, a two stage solid propellant missile systems design and a single stage liquid propellant missile systems design.     

BP-GA混合优化策略在人力资源战略规划中的应用

采用混合优化策略训练神经网络,进而实现地区人力资源数据的时间序列预测.神经网络,尤其是应用反向传播(back propagation,简称BP)算法训练的神经网络,被广泛应用于预测中.但是BP神经网络训练速度慢、容易陷入局部极值.遗传算法(genetic algorithm,简称GA)具有很好的全局寻优性.因而提出将BP和GA结合起来的混合优化策略训练神经网络,来实现人力资源数据预测.与BP算法相比,数值计算结果表明预测精度高、速度快,为地区人力资源数据的时间序列预测研究提供了一条新的途径.     

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.     

A Seeded Memetic Algorithm for Large Unit Commitment Problems

The paper shows that the use of a memetic algorithm (MA), a genetic algorithm (GA) combined with local search, synergistically combined with Lagrangian relaxation is effective and efficient for solving large unit commitment problems in electric power systems. It is shown that standard implementations of GA or MA are not competitive with the traditional methods of dynamic programming (DP) and Lagrangian relaxation (LR). However, an MA seeded with LR proves to be superior to all alternatives on large problems. Eight problems from the literature and a new large, randomly generated problem are used to compare the performance of the proposed seeded MA with GA, MA, DP and LR. Compared with previously published results, this hybrid approach solves the larger problems better and uses less computational time.     

A Hybrid Metaheuristic for the Quadratic Assignment Problem

The quadratic assignment problem (QAP) is known to be NP-hard. We propose a hybrid metaheuristic called ANGEL to solve QAP. ANGEL combines the ant colony optimization (ACO), the genetic algorithm (GA) and a local search method (LS). There are two major phases in ANGEL, namely ACO phase and GA phase. Instead of starting from a population that consists of randomly generated chromosomes, GA has an initial population constructed by ACO in order to provide a good start. Pheromone acts as a feedback mechanism from GA phase to ACO phase. When GA phase reaches the termination criterion, control is transferred back to ACO phase. Then ACO utilizes pheromone updated by GA phase to explore solution space and produces a promising population for the next run of GA phase. The local search method is applied to improve the solutions obtained by ACO and GA. We also propose a new concept called the eugenic strategy intended to guide the genetic algorithm to evolve toward a better direction. We report the results of a comprehensive testing of ANGEL in solving QAP. Over a hundred instances of QAP benchmarks were tested and the results show that ANGEL is able to obtain the optimal solution with a high success rate of 90%. This work was supported in part by the National Science Council, R.O.C., under Contract NSC 91-2213-E-005-017.     

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

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

Heuristic solution approaches for the cumulative capacitated vehicle routing problem

Cumulative capacitated vehicle routing problem (CCVRP) is an extension of the well-known capacitated vehicle routing problem, where the objective is minimization of sum of the arrival times at nodes instead of minimizing the total tour cost. This type of routing problem arises when a priority is given to customer needs or dispatching vital goods supply after a natural disaster. This paper focuses on comparing the performances of neighbourhood and population-based approaches for the new problem CCVRP. Genetic algorithm (GA), an evolutionary algorithm using particle swarm optimization mechanism with GA operators, and tabu search (TS) are compared in terms of required CPU time and obtained objective values. In addition, a nearest neighbourhood-based initial solution technique is also proposed within the paper. To the best of authors’ knowledge, this paper constitutes a base for comparisons along with GA, and TS for further possible publications on the new problem CCVRP.     

Selecting informative rules with parallel genetic algorithm in classification problem

The classification system is very important for making decision and it has been attracted much attention of many researchers. Usually, the traditional classifiers are either domain specific or produce unsatisfactory results over classification problems with larger size and imbalanced data. Hence, genetic algorithms (GA) are recently being combined with traditional classifiers to find useful knowledge for making decision. Although, the main concerns of such GA-based system are the coverage of less search space and increase of computational cost with the growth of population. In this paper, a rule-based knowledge discovery model, combining C4.5 (a Decision Tree based rule inductive algorithm) and a new parallel genetic algorithm based on the idea of massive parallelism, is introduced. The prime goal of the model is to produce a compact set of informative rules from any kind of classification problem. More specifically, the proposed model receives a base method C4.5 to generate rules which are then refined by our proposed parallel GA. The strength of the developed system has been compared with pure C4.5 as well as the hybrid system (C4.5 + sequential genetic algorithm) on six real world benchmark data sets collected from UCI (University of California at Irvine) machine learning repository. Experiments on data sets validate the effectiveness of the new model. The presented results especially indicate that the model is powerful for volumetric data set.     

基于油耗的带有车容限制弧路径问题的模型及优化

提出了一种基于油耗的带有车容限制的弧路径问题(Capacitated Arc RoutingProblem,CARP),建立了以降低油耗为目标的问题模型,构造了相应的遗传算法.基于标准测试问题,同传统以距离为优化目标的遗传算法求得的油耗进行比较,实验结果表明,此算法可以快速、有效的求得以油耗为优化目标的CARP问题的优化解,为实际中降低车辆运输服务成本提供了较好方案.