基于改进免疫遗传优化蚁群算法的移动机器人路径寻优研究

针对移动机器人路径规划中使用蚁群算法(ACO)易陷入局部最优和收敛速度慢的问题,提出了一种适用于机器人静态路径寻优的改进免疫遗传优化蚁群算法(IMGAC)。该算法可以根据实际情况自动调整变异概率和变异方式,以及自动调节个体免疫位的长度,将通过改进的变异算子和免疫算子嵌入蚁群算法来提高全局寻优能力与收敛速度。仿真及实验表明:相比于经典ACO算法以及最大最小蚂蚁系统,IMGAC算法收敛速度更快,全局寻优能力更强。利用该算法寻找移动机器人最优路径,提高了静态路径寻优的效果和效率。     

基于跳点搜索-遗传算法的自主移动机器人路径规划

为了解决采用遗传算法解析最优路径中存在的转折点较多、易陷入局部最优解、迭代次数较多以及寻优时间过长等问题，引入自适应交叉算子和变异算子，将改进后的跳点搜索（jump point search）算法与改进遗传算法融合，得到跳点搜索-遗传（jump point search-genetic,JPSG）算法。JPSG算法利用JPS算法的高效局部搜索能力来提高整体搜索能力，加速算法整体收敛趋势；利用改进遗传算法的全局搜索能力改变JPS算法不能在复杂障碍物状况下解析最优路径的状态，提高算法对动态环境的适应性。在栅格矩阵中的路径规划仿真表明，相比于改进遗传算法、传统遗传算法，JPSG算法可以有效缩短寻优执行时间，提高寻优准确率，减少运算执行次数，在稳定性、准确性、快速性上具有明显的优势。     

精英策略的改进非支配遗传算法

在研究NSGA-Ⅱ算法的基础上,提出了一种新的精英策略.它既可以使种群中优良个体保持到下一代,又可以维护种群的多样性,避免算法陷入局部最优解.此外,对NSGA-Ⅱ算法的交叉算子和变异算子进行了重新选择,交叉算子采用模拟二进制交叉算子,变异算子采用非均匀变异算子.将它们引入INSGA-Ⅱ算法中,在优化前期可以进行大范围搜索,而后期可以集中搜索某个重点区域,从而可以提高解的精确性.通过经典函数测试,并将INSGA-Ⅱ算法与NSGA-Ⅱ算法的结果进行比较.结果表明,基于精英策略的改进算法INSGA-Ⅱ不仅取得了较好的结果,而且分布性也得到了有效的提高.     

多种群遗传算法在篦冷机二次风温预测中的应用

针对GA遗传算法种群多样性差、局部寻优能力差等问题,提出了多种群遗传算法(MGA)。该算法利用间断平衡理论,构建多种群、多交叉算子操作方式并结合局部搜索方法和种群动态调整策略,提高算法的局部寻优能力和寻优速度。通过与GA和ISGA算法相比,MGA运行时间短,搜索性能强。利用MGA优化MKLSSVM参数,建立基于MGA-MKLSSVM的水泥篦冷机二次风温预测模型。结果表明,此模型辨识精度高、泛化能力强。     

基于实数编码的改进遗传算法及在平面度误差评定中的应用

针对平面度误差计算的特点 ,提出了一种基于实数编码的改进遗传算法。该算法的遗传算子采用确定式良种选择、非一致算术交叉及基本位变异策略 ;交叉和变异概率根据个体适应度大小来自适应地确定 ;同时给出遗传算法评定平面度误差时适应度的计算方法。最后 ,通过不同评价方法对同一平面的平面度误差进行评定 ,结果证明该方法不仅能收敛到全局最优解 ,而且具有较快的收敛速度     

基于XFEM和改进人工蜂群算法的结构内部缺陷反演

将扩展有限元法与智能优化算法相结合,基于结构的实际响应值反演出结构内部缺陷信息。传统人工蜂群算法在一定程度上朝着任意的方向搜索,为了避免出现搜索的局部最优现象,该文在传统人工蜂群算法中嵌入了加权平均数突变和交叉算子,将这种改进算法用于单个圆形、椭圆形缺陷和两个不规则缺陷的反演分析,并研究了该算法在测得值有误差情况下的适应性。研究得到:这种改进人工蜂群算法能准确反演出结构的真实缺陷信息;改进人工蜂群算法相比于传统人工蜂群算法收敛速度更快且不易出现局部最优,且定位准确,鲁棒性较强。     

动态联盟伙伴选择的一种自适应遗传算法

针对动态联盟伙伴选择优化问题,提出一种自适应遗传算法用来求解此类问题。该算法设计了自适应交叉和变异概率,在遗传过程中可以根据适应度自动选择,从而使群体中每个个体对环境的变化具有自适应调节能力;所设计的自适应变异概率可以避免算法的早熟现象;遗传过程中,通过保持迭代过程中的最优解,加快了搜索速度,并保证了收敛于全局最优解。通过算例,证实了该算法的有效。     

基于配电网优化规划中改进遗传算法的应用研究

文章以网架线路年综合费用最小为目标函数并计及支路载荷率的配电网网架规划的数学模型,利用二元变异算子替代一元算子,提高了算法的局部搜索效率和全局的优化能力。     

交叉变异的连续蚁群优化算法

研究了应用于连续空间优化问题的蚁群算法,给出了信息素的留存方式以及搜索策略.另外,针对蚁群算法易陷入局部最优的缺点,在最优蚂蚁周围进行了精细搜索,并加入了自适应的交叉变异算子,从而改进了蚁群算法的全局优化性能.数值仿真结果表明,该算法是一种有效的优化算法.     

基于遗传算法的矢量水听器阵相位误差校正

研究了矢量水听器阵各通道存在相位误差时,用MUSIC算法对信号到达方向进行估计的问题,并在利用遗传算法估计相位误差来对阵列流型进行修正时引入自适应概念,得出更加准确的信号到达方向值。采用与适应度函数值相对应的交叉概率与变异概率,逐步搜索,首先计算适应度值,采用轮盘赌法进行选择操作,并保存个体的适应度值,按照适应度分配交叉概率和变异概率,进行交叉变异操作,取得误差的最优解,通过仿真,可以看出引入自适应概念后的遗传算法具有较为精确的估计阵列相位误差的功能。与传统遗传算法相比,此方法能很好地得到全局最优解,并且成熟收敛,计算机仿真结果验证了本方法的有效性和可行性。     

基于ISSA⁃SVM的露点测量系统电路故障诊断方法研究

针对高精度谐振式露点测量系统中电路故障诊断问题,提出了一种基于改进的麻雀搜索算法（Improved Sparrow Search Algorithm, ISSA）优化智能分类器参数的电路故障诊断模型,采用测前仿真故障诊断方法中的智能诊断方法,选择适用于小样本、非线性问题的支持向量机（Support Vector Machine, SVM）作为智能分类器,针对麻雀搜索算法中收敛速度慢、易陷入局部最优等问题进行改进,并将改进后的优化算法用于SVM参数寻优,构建ISSA?SVM故障诊断模型用于谐振电路故障诊断。实验结果显示,ISSA?SVM模型在建立的电路上能够达到88.9%的故障诊断率,可靠性较强,能够作为高精度谐振式露点传感器电路的故障诊断方法。     

Cause and effect analysis by fuzzy relational equations and a genetic algorithm

This paper proposes using a genetic algorithm as a tool to solve the fault diagnosis problem. The fault diagnosis problem is based on a cause and effect analysis which is formally described by fuzzy relations. Fuzzy relations are formed on the basis of expert assessments. Application of expert fuzzy relations to restore and identify the causes through the observed effects requires the solution to a system of fuzzy relational equations. In this study this search for a solution amounts to solving a corresponding optimization problem. An optimization algorithm is based on the application of genetic operations of crossover, mutation and selection. The genetic algorithm suggested here represents an application in expert systems of fault diagnosis and quality control.     

Genetic algorithm with adaptive and dynamic penalty functions for the selection of cleaner production measures: a constrained optimization problem

This paper presents a new approach of genetic algorithm (GA) to solve the constrained optimization problem. In a constrained optimization problem, feasible and infeasible regions occupy the search space. The infeasible regions consist of the solutions that violate the constraint. Oftentimes classical genetic operators generate infeasible or invalid chromosomes. This situation takes a turn for the worse when infeasible chromosomes alone occupy the whole population. To address this problem, dynamic and adaptive penalty functions are proposed for the GA search process. This is a novel strategy because it will attempt to transform the constrained problem into an unconstrained problem by penalizing the GA fitness function dynamically and adaptively. New equations describing these functions are presented and tested. The effects of the proposed functions developed have been investigated and tested using different GA parameters such as mutation and crossover. Comparisons of the performance of the proposed adaptive and dynamic penalty functions with traditional static penalty functions are presented. The result from the experiments show that the proposed functions developed are more accurate, efficient, robust and easy to implement. The algorithms developed in this research can be applied to evaluate environmental impacts from process operations.     

一种改进的盲解卷积算法在轴承声学诊断中的应用

针对时域盲解卷积算法滤波器长度估计困难的缺点,提出一种基于遗传算法优化的改进算法。该算法利用遗传算法搜索最佳时延,解决了盲解卷积结果不确定问题,并改进了信号分量的聚类指标,采用峭度作为独立分量间距离测度,提高了信号分量聚类的准确性,获得了可靠的估计信号。计算机仿真和实际环境中故障轴承声信号提取实验验证了该算法的有效性。     

A genetic algorithm approach to the integrated inventory-distribution problem

We introduce a new genetic algorithm (GA) approach for the integrated inventory distribution problem (IIDP). We present the developed genetic representation and use a randomized version of a previously developed construction heuristic to generate the initial random population. We design suitable crossover and mutation operators for the GA improvement phase. The comparison of results shows the significance of the designed GA over the construction heuristic and demonstrates the capability of reaching solutions within 20% of the optimum on sets of randomly generated test problems.     

A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel VNS execution

This paper addresses the flexible-job-shop scheduling problem (FJSP) with the objective of minimising total tardiness. FJSP is the generalisation of the classical job-shop scheduling problem. The difference is that in the FJSP problem, the operations associated with a job can be processed on any set of alternative machines. We developed a new algorithm by hybridising genetic algorithm and variable neighbourhood search (VNS). The genetic algorithm uses advanced crossover and mutation operators to adapt the chromosome structure and the characteristics of the problem. Parallel-executed VNS algorithm is used in the elitist selection phase of the GA. Local search in VNS uses assignment of operations to alternative machines and changing of the order of the selected operation on the assigned machine to increase the result quality while maintaining feasibility. The purpose of parallelisation in the VNS algorithm is to minimise execution time. The performance of the proposed method is validated by numerical experiments on several representative problems and compared with adapted constructive heuristic algorithms’ (earliest due date, critical ratio and slack time per remaining operation) results.     

改进野马算法求解低碳开放式送取货选址路径问题

目的 针对当前物流背景下普遍出现的送货公司外包、退换货频繁等问题,结合现有的碳排放政策,提出低碳背景下开放式同时送取货选址−路径模型(Low-Carbon Open Location-routing Problem with Simultaneous Pickup and Delivery Problem,LOLRPSPD),并通过改进野马算法进行求解。方法 首先设计一种新的解码方式,使得原离散问题可以采用连续算法求解。之后,运用哈尔顿序列生成初始解,改进非线性进化概率因子,使用模拟二进制交叉,增加变异操作,以及精英保留、设置连续失败重新初始化等步骤,改进野马算法。最后,通过6组不同大小的算例将改进野马算法与原始野马算法、模拟退火算法、粒子群算法、遗传算法进行对比。结果 针对中大型算例,改进野马算法远超原始野马算法。针对小型算例,在确保准确率的同时,改进野马算法对比各经典算法也在速度上具有优势。结论 提出的LOLRPSD模型具备合理性,改进的野马算法针对选址路径问题具有较好的搜索能力。     

Equivalence-set genes partitioning using an evolutionary-DP approach

Computation of transitive-closure equivalence sets has recently emerged as an important step for building static and dynamic models of gene network from DNA sequences. We present an evolutionary-DP approach in which dynamic programming (DP) is embedded into a genetic algorithm (GA) for fitness function evaluation of small equivalence sets (with m genes) within a large-scale genetic network of n genes, where n/spl Gt/m. This approach reduces a computation-intensive optimal problem of high dimension into a heuristic search problem on /sub n/C/sub m/ candidates. The DP computation of transitive closure forms the basic fitness evaluation for selecting candidate chromosomes generated by GA operators. By introducing bounded mutation and conditioned crossover operators to constrain the feasible solution domain, small transitive-closure equivalence sets for large genetic networks can be found with much reduced computational effort. Empirical results have successfully demonstrated the feasibility of our GA-DP approach for offering highly efficient solutions to large scale equivalence gene-set partitioning problem. We also describe dedicated GA-DP hardware using field programmable gate arrays (FPGAs), in which significant speedup could be obtained over software implementation.