采用遗传优化自适应模糊PID控制球杆系统

为解决球杆系统动态、静态性能不高的问题,提出了遗传算法优化自适应模糊PID控制器的控制方法.该模型在拉格朗日方程建立球杆系统数学模型的基础上,采用遗传算法优化模糊控制规则、隶属函数和自适应PID参数.在GBB1004系统中建立了遗传算法优化后的自适应模糊PID控制器以及控制模型,并对该控制器进行实验验证.实验结果证明了遗传算法优化后的模糊控制器有效地减小了系统的超调量,缩短了系统的调节时间,能够较好地控制球杆系统.     

一种新的模糊自适应模拟退火遗传算法

针对遗传算法收敛速度慢、容易"早熟"等缺点,结合模糊推理、模拟退火算法和自适应机制,提出一种改进的遗传算法--模糊自适应模拟退火遗传算法(FASAGA),并分析了该算法的性能和特点,实验研究表明,该算法比标准的遗传算法(SGA)具有更快的收敛速度和寻优效果.     

基于二维模糊熵和遗传算法的图像阈值分割

针对目标和背景两类图像分割,考虑二维灰度直方图,采用了一种更符合图像空间分布特点的隶属函数,建立了对应的二维图像模糊熵,分别采用标准遗传算法和改进的自适应遗传算法对二维图像模糊熵的各个参数进行优化,根据最大模糊熵准则,确定目标和背景的最佳分割阈值。实验结果表明,基于改进的自适应遗传算法的二维最大模糊熵阈值分割法具有较好的分割性能和较快的分割速度,且对噪声具有一定的抑制能力。     

一种改进的模糊自适应遗传算法

模糊自适应遗传算法是将模糊控制器应用于遗传算法性能和参数控制的一种新型进化算法。提出了一种2输入和2输出的改进模糊自适应遗传算法。一方面,算法采用混沌初始化,提高了初始群体的质量;另一方面,算法将群体适应度方差作为模糊控制器的一个输入参量,来度量群体在空间分布的离散程度。将群体适应度均值商作为模糊控制器的另一个输入参量,来度量群体中个体的多样性。从而自适应地控制算法在进化过程中的交叉概率和变异概率。测试函数仿真结果表明,该算法很好地平衡了“开发”与“探测”,取得了较为满意的优化结果。     

基于GA的闪蒸罐压力模糊自适应PID控制

针对加氢裂化中对闪蒸罐压力控制的非线性、滞后性等问题,本文提出一种基于遗传算法的模糊PID控制器,用于改善闪蒸罐压力控制效果。该控制器利用遗传算法优化模糊控制器的量化因子和比例因子,从而实现模糊PID控制器参数K_p、K_i、K_d的自适应调节。结果表明,优化后的模糊自适应PID控制器与常规PID控制器相比,提高了绝热闪蒸罐压力控制的自适应能力和鲁棒性,改善了系统的动态特性和静态性能,对非线性和时滞性的控制效果更好。     

嵌套式模糊自适应遗传算法

针对简单遗传算法(SGA)收敛速度慢和早熟收敛现象,将模糊逻辑理论应用于遗传算法,并采用两级嵌套的遗传算法,随主遗传算法GA1求解优化问题的进化进程用模糊控制的方法自适应地调整遗传算法的交叉概率和变异概率;利用另一个遗传算法GA2优化模糊规则库,实现了一种嵌套式模糊自适应遗传算法(NFAGA)。仿真结果表明,这种算法的全局搜索收敛速度和解的质量明显优于SGA和一般的自适应遗传算法(AGA)。     

基于遗传优化和模糊推理PID及MATLAB仿真

本文提出一种基于遗传优化和模糊推理相结合的自适应模糊PID控制算法,算法由遗传算法和模糊推理两部分构成,分别用于离线优化和在线优化。仿真结果表明,这种自适应PID控制器的性能,比仅用遗传算法优化的PID控制器更好,并且抗干扰能力更强。     

基于遗传优化和模糊推理PID及MALTAB仿真

本文提出一种基于遗传优化和模糊推理相结合的自适应模糊PID控制算法,算法由遗传算法和模糊推理两部分构成,分别用于离线优化和在线优化.仿真结果表明,这种自适应PID控制器的性能,比仅用遗传算法优化的PID控制器更好,并且抗干扰能力更强.     

模糊自适应遗传算法

针对标准遗传算法在实际应用中存在的早熟问题,设计了标准遗传算法的一种改进形式--模糊自适应遗传算法.该算法是利用种群的方差和熵来衡量种群多样性,并根据每代种群的方差和熵设计模糊推理系统来自适应控制交叉概率和变异概率.通过多峰函数优化问题的仿真实验,表明了该模糊自适应遗传算法的可行性和有效性.     

模糊自适应遗传算法在多传感器多目标跟踪中的应用

应用模糊自适应遗传算法,将多传感器多目标跟踪的数据关联问题表达为一类约束的组合优化问题.静态关联用模糊自适应遗传算法进行量测粗关联,得到多假设航迹点量测.动态关联用多种群模糊自适应遗传算法进行航迹的形成和维持.仿真试验内容为被动式传感器的航迹形成和维持的问题.仿真试验的结果表明模糊自适应算法在多传感器多目标跟踪中应用的可行性.     

基于改进遗传算法的矩形件优化排样

论文利用遗传算法结合剩余矩形排样法求解矩形件正交排样问题。通过对排样问题已知解信息进行统计分析,并根据分析结果改进原遗传算法判断个体好坏的标准,对父代种群进行了优劣分类,针对不同的分类采用不同的遗传操作,构造出一种改进遗传算法。通过实例验证,该算法得到了排样问题的最优解,说明了其有效性。     

Multi-item partial backlogging inventory models over random planninghorizon in random fuzzy environment

In this paper, some multi-item inventory models for deteriorating items are developed in a random planning horizon under inflation and time value money with space and budget constraints. The proposed models allow stock dependent consumption rate and partially backlogged shortages. Here the time horizon is a random variable with exponential distribution. The inventory parameters other than planning horizon are deterministic in one model and in the other, the deterioration and net value of the money are fuzzy, available budget and space are fuzzy and random fuzzy respectively. Fuzzy and random fuzzy constraints have been defuzzified using possibility and possibility–probability chance constraint techniques. The fuzzy objective function also has been defuzzified using possibility chance constraint against a goal. Both deterministic optimization problems are formulated for maximization of profit and solved using genetic algorithm (GA) and fuzzy simulation based genetic algorithm (FAGA). The models are illustrated with some numerical data. Results for different achievement levels are obtained and sensitivity analysis on expected profit function is also presented.Scope and purposeThe traditional inventory model considers the ideal case in which depletion of inventory is caused by a constant demand rate. However for more sale, inventory should be maintained at a higher level. Of course, this would result in higher holding or procurement cost, etc. Also, in many real situations, during a shortage period, the longer the waiting time is, the smaller the backlogging rate would be. For instance, for fashionable commodities and high-tech products with short product life cycle, the willingness for a customer to wait for backlogging diminishes with the length of the waiting time. Most of the classical inventory models did not take into account the effects of inflation and time value of money. But at present, the economic situation of most of the countries has been much deteriorated due to large scale inflation and consequent sharp decline in the purchasing power of money. So, it has not been possible to ignore the effects of inflation and time value of money any further. The purpose of this article is to maximize the expected profit of two inventory control systems in the random planning horizon.     

Quantum inspired evolutionary algorithm for ordering problems

This paper proposes a new quantum-inspired evolutionary algorithm for solving ordering problems. Quantum-inspired evolutionary algorithms based on binary and real representations have been previously developed to solve combinatorial and numerical optimization problems, providing better results than classical genetic algorithms with less computational effort. However, for ordering problems, order-based genetic algorithms are more suitable than those with binary and real representations. This is because specialized crossover and mutation processes are employed to always generate feasible solutions. Therefore, this work proposes a new quantum-inspired evolutionary algorithm especially devised for ordering problems (QIEA-O). Two versions of the algorithm have been proposed. The so-called pure version generates solutions by using the proposed procedure alone. The hybrid approach, on the other hand, combines the pure version with a traditional order-based genetic algorithm. The proposed quantum-inspired order-based evolutionary algorithms have been evaluated for two well-known benchmark applications – the traveling salesman problem (TSP) and the vehicle routing problem (VRP) – as well as in a real problem of line scheduling. Numerical results were obtained for ten cases (7 VRP and 3 TSP) with sizes ranging from 33 to 101 stops and 1 to 10 vehicles, where the proposed quantum-inspired order-based genetic algorithm has outperformed a traditional order-based genetic algorithm in most experiments.     

一种基于遗传算法的QoS多播路由算法

深入研究基于遗传算法的QoS多播路由算法,建立支持QoS的多播路由模型.对已有的QoS多播路由算法进行优化,提出适用于下一代网络的基于遗传算法的QoS多播路由算法.采用定长的染色体编码和预处理机制降低算法复杂度.仿真试验表明,该算法收敛速度快,可靠性高,能够更好地满足多播业务的需要.     

基于局部搜索和遗传算法的激光切割路径优化

为了缩短激光加工时间,提高加工效率,提出了一种新的局部搜索法与遗传算法相结合的激光切割路径优化算法。该算法从加工轮廓中提取节点,通过局部搜索法对节点进行局部路径优化,再运用的遗传算法求得近似最优解,遗传算法中的选择算子改进为基于相对适应度的轮盘赌选择算子。详细介绍了算法的原理及实现,通过编程仿真证明该算法与传统的遗传算法相比具有良好的优化效果,可明显缩短加工路径,减少加工时间,提高加工效率。     

求解混合流水车间调度问题的一种遗传算法

由于高度的计算复杂性(NP-hard问题),混合流水车间调度问题很难求得最优解,启发式算法和智能优化算法(如遗传算法)求解此类问题的近优解的有效性和实用性已被证实。该文提出了一种基于遗传算法的求解方法,在由染色体转换成可行调度的过程中引入工件插入方法,同时设计了一种新的交叉算子。通过大量的数值计算表明,该算法的优化质量大大优于传统的遗传算法和NEH启发式算法。     

一种用于多阈值图象自动分割的混合遗传算法

模糊Ｃ－均值算法是一种比较有效的数据聚类方法,遗传算法则是一种借鉴生物界自然选择和自然遗传机制的高度并行、随机、自适应的搜索算法,该文有机地利用遗传算法与模糊Ｃ－均值算法,并考虑图象的二维灰度信息,提出了一种适用于多阈值图象自动分割的新方案。该方案能够快速正确地实现分割,且不需要事先认定分割类数,实验结果令人满意。     

A guided genetic algorithm for diagonalization of symmetric and Hermitian matrices

The eigenvalues and eigenvectors of a matrix have many applications in engineering and science, such us studying and solving structural problems in both the treatment of signal or image processing, and the study of quantum mechanics. One of the most important aspects of an algorithm is the speed of execution, especially when it is used in large arrays. For this reason, in this paper the authors propose a new methodology using a genetic algorithm to compute all the eigenvectors and eigenvalues in real symmetric and Hermitian matrices. The algorithm uses a general-purpose library developed by the authors for genetic algorithms (GALGA). The speed of execution and the influence of population size have been studied. Moreover, the algorithm has been tested in different matrices and population sizes by comparing the speed of execution to the number of the eigenvectors. This new methodology is faster than the previous algorithm developed by the authors and all eigenvectors can be obtained with it. In addition, the performance using the Coope matrix has been tested contrasting the results with another technique published in the scientific literature.     

基于粗糙集理论的数据挖掘算法及其应用研究

文章对粗糙集理论及其应用进行了讨论，在分析和综合基于粗糙集理论的数据挖掘算法基础上，提出了新的遗传算法挖掘方法，并就应用模型和应用领域及方法问题进行了分析。通过应用实例表明，文章提供的方法和技术是可行的，具有较大的参考价值。