基于混合量子进化计算的混沌系统参数估计

混沌系统参数估计本质上是一多维参数优化问题.为精确估计混沌系统的未知参数,本文提出一种混合量子进化算法(HQEA)用于求解该优化问题,该方法采用实数量子角形式表示染色体,用量子比特的概率作为个体的当前位置信息;提出由差分进化计算更新量子位置状态的量子差分进化算法(QDE),并将其与实数编码量子进化算法(RQEA)相融合,以便令算法在解空间的全局探索和局部开发能力之间取得平衡.算法还引入量子非门算子,对当前最佳个体中按某个概率选中的量子比特位,进行变换操作,以便增强算法跳出局部最优解的能力.基准函数测试表明混合算法的全局搜索能力及可靠性都有很大改善.通过Lorenz混沌系统进行数值仿真,结果表明了该混合算法的有效性.     

基于混沌BBO算法的非线性模型参数整定

为提升原始生物地理学优化算法(BBO)性能，提出基于动态迁移机制和混合变异算子的混沌生物地理学算法。采用Tent映射生成混沌初始化种群，提升种群遍历性；将反向学习机制和差分算子集成到原始迁移算子中，提升算法收敛速度；采用混合变异算子增强算法跳出局部最优解能力。将该算法应用于非线性Richards模型参数整定，预测谷氨酸菌体生长浓度。实验结果表明，该算法的预测结果比同类文献更优，较对比算法更适用于Richards模型参数整定。     

蚁群混沌混合优化算法

为了克服混沌搜索的盲目性,提出了一种蚁群算法和混沌优化算法相结合的混合优化算法,该算法利用蚁群算法中信息素正反馈的思想指导当前混沌搜索的区域。工作蚁群按照信息素的浓度高低,分别按照不同的概率搜索不同的搜索区域,从而可减少混沌盲目搜索的次数。仿真结果表明,该方法能够明显提高混沌优化算法的寻优效率,同时算法的通用性将有所提高。另外,对于含有多个全局最优解的函数,在一次寻优过程中,该算法可以找到全部最优解,这是通常混沌搜索算法所不具备的。     

多目标混沌差分进化算法

将差分进化算法用于多目标优化问题,提出了多目标混沌差分进化算法(CDEMO).该算法利用混沌序列初始化种群,并用混沌备用种群进行替换操作.该操作不仅起到了维持非劣最优解集均匀性的作用,而且增强了算法的搜索功能.对CDEMO的性能进行研究,数值实验结果表明了CDEMO的有效性.     

Pi-sigma神经网络混合学习算法及收敛性分析

将一种解决函数优化问题的混合遗传算法用于Pi-sigma神经网络的训练。这种混合算法充分利用遗传算法算法的全局搜索能力,又利用了单纯型法的局部搜索能力,因此该混合遗传算法可以使Pi-sigma神经网络更快的收敛到全局最优解,而且收敛速度比遗传算法更快。实验证明了这种算法的优越性。最后还证明了该算法可以以概率1收敛到全局最优解。     

基于混合类电磁机制算法的混沌系统控制与同步

混沌系统控制与同步可通过优化方法设计控制律引导混沌系统轨道来实现．类电磁机制优化算法（EM）是模拟电磁场带电粒子间吸引一排斥行为机制的一种启发式搜索方法,目前还尚未在混沌系统控制与同步问题中得到应用．本文提出一种混合类电磁机制优化算法（HEM）用于求解该优化问题,该方法采用修改的类电磁机制算法（REM）与差分进化算法（DE）相融合平衡算法对解空间的全局探索和局部开发能力,基准函数测试表明混合算法改善了全局搜索能力及求解可靠性．在此基础上,采用HEM算法引导混沌系统的轨道,搜索施加于系统的小扰动使其轨迹在短时间内跟踪到目标区域;再将混沌系统的同步问题转化为在线轨道导引问题,采用HEM优化算法解决．通过典型离散Henon映射为例,数值仿真结果表明了该方法是解决混沌系统控制与同步的一种有效方法．     

基于混沌和差分进化的混合粒子群优化算法

研究粒子群算法优化问题,由于标准粒子群优化算法(PSO)在高维复杂函数优化中易早收敛,影响全系统优化。为改进的混合粒子群优化算法,提出了一种基于混沌和差分进化的混合粒子群优化算法(CDEHPSO)。把基于Logistic映射的混沌序列引入到种群初始化操作中。在算法进化过程中,通过一种粒子早熟判断机制,在基本粒子群优化算法中引入了差分变异、交叉和选择操作,对早熟粒子个体进行差分进化操作,从而维持了种群的多样性并有效避免了算法陷入局部最优。仿真结果表明,相比于粒子群优化算法和差分进化算法(DE),CDEHPSO算法具有收敛速度快、搜索能力强的优点。     

基于差分进化的BP神经网络预测混沌时间序列

针对BP神经网络预测模型收敛速度慢和容易陷入局部极小值的缺点,将差分进化算法和神经网络结合起来,提出了一种基于差分进化算法的BP神经网络预测混沌时间序列的方法,利用差分进化算法的全局寻优能力对BP神经网络的权值和阈值进行优化,然后训练BP神经网络预测模型求得最优解,将该预测方法用到3个典型的混沌时间序列进行算法的有效性验证,并与BP算法的预测精度进行了比较,仿真结果表明该方法对混沌时间序列预测具有更好的非线性拟合能力和更高的预测准确性。     

一种自适应交替的差分混合蛙跳优化算法

针对混合蛙跳算法在解决高维优化问题时易早熟收敛、求解精度低等问题,提出一种自适应交替的差分混合蛙跳优化算法。采用粒子群算法在短时间内产生一组满足约束条件的初始解,以提高初始解的质量。在此基础上,利用差分进化算法全局搜索能力强、种群多样性好等优点,设计一种自适应选择机制,动态地交替使用混合蛙跳算法和差分进化算法,使两者有机融合、优势互补。对6个经典函数的仿真测试结果表明,该算法可以丰富粒子的多样性,使算法前期和后期都具有较好的寻优能力,且寻优速率、求解精度、稳定性都优于混合蛙跳算法、差分进化算法和差分混合蛙跳算法。     

混沌时间序列的自适应变异差分进化ANFIS预测

提出了一种基于自适应变异差分进化（AMDE）算法的ANFIS模型对混沌时间序列进行预测的方法,该方法采用自适应变异差分进化算法和最小二乘法相结合的混合学习算法对ANFIS网络结构参数进行优化设计,利用差分进化算法的全局寻优能力对ANFIS网络前件参数进行优化,而网络的结论参数采用最小二乘法优化,混合学习算法提高了网络参数辨识的收敛速度和系统的全局收敛性,仿真实验结果表明了该方法的有效性。     

A neuro-genetic-simulated annealing approach to the inverse kinematics solution of robots: a simulation based study

In this study, a hybrid intelligent solution system including neural networks, genetic algorithms and simulated annealing has been proposed for the inverse kinematics solution of robotic manipulators. The main purpose of the proposed system is to decrease the end effector error of a neural network based inverse kinematics solution. In the designed hybrid intelligent system, simulated annealing algorithm has been used as a genetic operator to decrease the process time of the genetic algorithm to find the optimum solution. Obtained best solution from the neural network has been included in the initial solution of genetic algorithm with randomly produced solutions. The end effector error has been reduced micrometer levels after the implementation of the hybrid intelligent solution system.     

免疫遗传蚁群融合算法

提出了一种融合蚁群系统、免疫算法和遗传算法的混合算法。将免疫算法和遗传算法引入到每次蚁群迭代的过程中,利用免疫算法的局部优化能力和遗传算法的全局搜索能力,来提高蚁群系统的收敛速度。该算法通过遗传算法的选择、交叉、变异操作和免疫算法的自适应疫苗接种操作,有效地解决了蚁群系统的易陷入局部最优和易退化的缺点。通过对旅行商问题的仿真实验表明该算法具有非常好的收敛速度和全局最优解的搜索能力。     

用基于贪婪算法的混合遗传算法求解0/1背包问题

为了克服传统优化方法的缺点,提高求解的速度和精度,将贪婪算法的思想融入基本遗传算法之中,形成了基于贪婪算法的混合遗传算法.介绍用该算法求解0/1背包问题的基本思路和方法,通过实例计算证明了该方法的可行性和有效性.     

Hybrid real coded genetic algorithm solution to economic dispatch problem

This paper presents a new, two-phase hybrid real coded genetic algorithm (GA) based technique to solve economic dispatch (ED) problem with multiple fuel options. The proposed hybrid scheme is developed in such a way that a simple real coded GA is acting as a base level search, which makes a quick decision to direct the search towards the optimal region, and local optimization by direct search and systematic reduction in size of the search region method is next employed to do the fine tuning. Constraint satisfaction technique has been employed to improve the solution quality and reduce the computational expenses. In order to validate the effectiveness of the proposed hybrid real coded genetic algorithm, the result of 10-generation unit ED problem with multiple fuel options is considered. The result shows that the proposed hybrid algorithm not only improves the solution accuracy and reliability but also makes the algorithm more efficient in terms of number of function evaluations and computation time. The simulation study clearly demonstrates that the proposed hybrid real coded genetic algorithm is practical and valid for real-time applications.     

A vehicle routing problem solved by using a hybrid genetic algorithm

The main purpose of this study is to find out the best solution of the vehicle routing problem simultaneously considering heterogeneous vehicles, double trips, and multiple depots by using a hybrid genetic algorithm. This study suggested a mathematical programming model with a new numerical formula which presents the amount of delivery and sub-tour elimination. This model gives an optimal solution by using OPL-STUDIO(ILOG CPLEX). This study also suggests a hybrid genetic algorithm (HGA) which considers the improvement of generation for an initial solution, three different heuristic processes, and a float mutation rate for escaping from the local solution in order to find the best solution. The suggested HGA is also compared with the results of a general genetic algorithm and existing problems suggested by Eilon and Fisher. We found better solutions rather than the existing genetic algorithms.     

A vehicle routing problem solved by using a hybrid genetic algorithm

The main purpose of this study is to find out the best solution of the vehicle routing problem simultaneously considering heterogeneous vehicles, double trips, and multiple depots by using a hybrid genetic algorithm. This study suggested a mathematical programming model with a new numerical formula which presents the amount of delivery and sub-tour elimination. This model gives an optimal solution by using OPL-STUDIO(ILOG CPLEX). This study also suggests a hybrid genetic algorithm (HGA) which considers the improvement of generation for an initial solution, three different heuristic processes, and a float mutation rate for escaping from the local solution in order to find the best solution. The suggested HGA is also compared with the results of a general genetic algorithm and existing problems suggested by Eilon and Fisher. We found better solutions rather than the existing genetic algorithms.     

基于小生境混合遗传算法的PID参数整定

针对遗传算法过早收敛、易陷入局部极值以及进化后期收敛速度慢的不足,将小生境技术、遗传算法、Powell算法相结合,采用自适应的结合策略,提出了一种小生境混合遗传算法(NHGA).对两个经典测试函数的优化结果表明,与小生境遗传算法相比,算法在能够保持解的多样性的同时,能够明显的提高了收敛速度和精度,有效的避免过早收敛.将算法用于PID参数整定,分别针对高阶对象和时滞对象,以及采用不同的性能指标,算法都能迅速得到最优的PID参数.仿真结果表明了该算法的有效性和优越性.     

基于三链混合遗传算法的贴片机贴装过程优化

为提高贴片机的生产效率,对贴片机贴装过程中的元器件拾取贴放顺序进行优化,提出了一种改进的三链混 合遗传算法。该算法将传统遗传算法中的两条链增加为三条链,并采用了启发式改进遗传算子。实验结果表明,改进的三链 混合遗传算法能够减少种群数目,提高优化效率和优化效果,从而提高算法的全局搜索能力。该算法在多数情况下能够搜索 到优于传统遗传算法的解。     

非线性最小二乘全局解的混合计算智能算法

通过在遗传算法中嵌入牛顿算子，并定义适当的适应度和数据结构，从而得到可结合遗传算法和牛顿法两者长处，既有较快收敛性，又能以较大概率求得非线性最小二乘全局解的混合计算智能算法．数值结果表明了该方法显著优于遗传算法和牛顿法．     

A hybrid grouping genetic algorithm for the cell formation problem

The machine-part cell formation problem consists of constructing a set of machine cells and their corresponding product families with the objective of minimizing the inter-cell movement of the products while maximizing machine utilization. This paper presents a hybrid grouping genetic algorithm for the cell formation problem that combines a local search with a standard grouping genetic algorithm to form machine-part cells. Computational results using the grouping efficacy measure for a set of cell formation problems from the literature are presented. The hybrid grouping genetic algorithm is shown to outperform the standard grouping genetic algorithm by exceeding the solution quality on all test problems and by reducing the variability among the solutions found. The algorithm developed performs well on all test problems, exceeding or matching the solution quality of the results presented in previous literature for most problems.