基于蛙跳退火粒子群算法的民航发动机单元体修理级别决策及成本优化

针对民航发动机单元体送修工作范围决策及全寿命维修成本优化问题,提出了以返厂时间间隔为变量的基于蛙跳退火粒子群优化算法的发动机单元体修理级别决策及成本优化模型。首先,考虑维修指导手册中的各单元体送修逻辑图及限寿件到寿更换情况,构建了发动机送修成本函数。其次,借助蛙跳退火粒子群优化算法确定了全寿命期间内不同返厂次数的送修成本及各单元体维修等级。最后,通过算例将所提算法与基本粒子群优化算法、退火粒子群优化算法、混合蛙跳优化算法进行对比,分析了不同返厂次数对送修成本及可靠性的影响。实验结果表明,当发动机在全寿命期内进行5次返厂送修时,蛙跳退火粒子群优化算法的成本平均值为322.479 1美元/飞行小时,与其他三种优化算法相比成本最优,可为航空公司和大修企业提供送修决策支持。     

一种改进的简化粒子群算法

由于简化粒子群算法中每个粒子都采用相同的迭代公式进行进化,使得在进化后期粒子间的差异性不强,算法容易出现早熟、搜索速度慢的问题.针对上述问题,在简化粒子群优化算法的基础上,加入了混合蛙跳算法的分组思想,提出了一种蛙跳简化粒子群算法.算法将粒子群分为多组同时进行搜索,每组粒子进行若干次迭代后再重新进行分组.粒子的迭代方式在简化粒子群上增加了对各小组最优粒子信息的利用,使各小组就利用不同的迭代公式进化,保证了粒子间的差异性.分别用基本粒子群算法、简化粒子群算法、混合蛙跳算法和蛙跳简化粒子群算法(改进的算法)对4个经典函数进行测试.结果表明,改进的算法能够有效地避免早熟收敛问题,并能较大幅度地提高收敛速度和收敛精度.     

基于量子粒子群搜索策略的混合蛙跳算法

混合蛙跳算法（SFLA）是一种全新的群体智能优化算法。针对基本混合蛙跳算法局部搜索能力差,因而优化精度低、收敛速度慢的缺点,引入量子粒子群算法的搜索策略,提出了一种基于量子粒子群搜索策略的混合蛙跳算法（QPSO-SFLA）。通过对基准函数进行测试,实验结果表明改进的算法大大提高了算法的收敛速度,增强了算法的寻优能力。     

基于性能合同的多部件系统维修策略模型优化

针对多部件串联系统维修效率低下与供应商所获利润少的问题，考虑各部件间的经济相关性，提出基于性能合同的多部件系统的维修策略模型。首先，采用韦伯（Weibull）分布描述系统各部件的使用寿命规律，并通过判断各部件使用度与预防性维修阈值和机会维修阈值的关系来实施不同的维修策略；其次，计算单位更新周期内的各维修活动概率和对应维修次数，以供应商利润最大化为目标，以预防性维修阈值和机会维修阈值为决策变量，建立基于性能合同的多部件系统的维修策略模型；最后，利用灰狼优化（GWO）算法求解该模型。通过算例分析得出与遗传（GA）算法、粒子群优化（PSO）算法相比，灰狼优化算法在准确率上分别提高了22.6%和7.6%；基于线性收益函数，所提绩效模型的利润率高达25.3%，相较于传统成本模型提高了5.2%。基于性能合同的多部件系统维修策略优化模型和算法可以有效解决供应商维修质量与效率低下问题，为供应商和运营商共同制定维修合同提供依据。     

基于QPSFLA算法的云计算环境资源调度策略

针对云计算环境下的资源调度优化问题,提出了一种基于量子粒子群策略的混洗蛙跳改进算法(简称QPSFLA算法),旨在引入量子粒子群搜索策略防止传统混洗蛙跳算法容易陷入局部最优的问题。在CloudSim平台上的模拟试验结果表明,QPSFLA算法能够达到预期效果,而且比平台自带算法和传统混洗蛙跳算法效率更高。     

基于蒙特卡罗仿真的航空发动机大修费用估算

为准确估算某型发动机在大部件寿命控制维修体制下的大修费用,借鉴外方对发动机各大部件(单元体)具体大修项目的费用数据,并依据国内执行的具体的寿命控制与维修管理准则,应用Monte-Cado方法建立了发动机寿命控制与维修管理过程的动态仿真模型,为估算发动机在大部件寿命控制维修体制下的大修费用,获得了不同翻修间隔下发动机的大修费用和发动机大修费用随发动机最低放行寿命的变化规律.估算结果的对比分析表明,估算方法较为准确,且具有较好的工程适用性.     

用蛙跳算法优化RBF神经网络参数的研究

针对径向基函数（Radial Basis Functions,RBF）神经网络结构参数确定问题,提出了一种基于蛙跳算法优化RBF神经网络参数的新方法。将RBF神经网络参数组成一个多维向量,作为蛙跳算法中的参数进行优化。以适应度函数为标准,在可行解空间中搜索最优解,并对蛙跳算法进行了改进。非线性函数逼近实验结果表明,该优化算法相对标准遗传优化算法、粒子群优化算法有较小的均方误差,具有更好的逼近能力。     

无线传感网络覆盖的多步长粒子群优化研究

为了改善无线传感网络的网络性能,提高网络的覆盖率,实现网络覆盖范围的最大化,延长网络寿命,在多步长粒子群算法的基础上提出以网络覆盖率为优化目标的覆盖优化策略。该策略针对不同的个体情况改变粒子的最大飞行速度,实现粒子的多步长搜索,有效地解决了粒子群算法容易出现的早熟问题。仿真实验表明,与粒子群算法相比,多步长粒子群算法的有效覆盖率由74.76%提高到82.66%,到达收敛的迭代次数由360次减少到283次,收敛速度提高了21.4%。因此多步长粒子群优化策略比粒子群算法在无线传感网络覆盖优化上具有更好的效果。     

协同多目标攻击的混合蛙跳融合蚁群算法研究

针对未来超视距条件下的多机协同空战,提出了一种基于混合蛙跳融合蚁群算法的目标分配方法。以目标威胁评估值为准则建立空战决策模型,根据空战决策特点对青蛙粒子进行特殊编码处理,在混合蛙跳算法局部搜索过程中加入自适应差分扰动机制、在蚁群算法中引入变异算子以减少算法搜索时间。融合算法利用混合蛙跳算法快速的全局搜索能力生成初始优化解群,利用蚁群算法具有正反馈的特点求精确解,利用Matlab仿真。仿真结果表明该方法能够快速有效地给出合理的目标分配方案。     

基于免疫进化的粒子群混洗蛙跳算法

为了避免混洗蛙跳算法易于出现不成熟收敛,提高求解质量,提出了基于免疫进化的粒子群混洗蛙跳算法。该算法将粒子群算法中粒子追踪全局极值的思想融入混洗蛙跳算法中,对族群内的最差个体同时跟踪族群内和全局两个最优个体的信息,进行深度搜索;并引入免疫进化算法对群体中的最优个体进行免疫进化迭代计算,以达到充分利用最优个体的信息的目的。该算法不仅避免了陷入局部极值的局限,以更高的精度逼近全局最优解,而且能加速收敛。对多个典型测试函数的计算表明：基于免疫进化的粒子群混洗蛙跳算法比传统的混洗蛙跳算法具有更好的寻优能力、稳定效果和更快的收敛速度。     

Large scale economic dispatch of power systems using oppositional invasive weed optimization

This paper presents an evolutionary hybrid algorithm of invasive weed optimization (IWO) merged with oppositional based learning to solve the large scale economic load dispatch (ELD) problems. The oppositional invasive weed optimization (OIWO) is based on the colonizing behavior of weed plants and empowered by quasi opposite numbers. The proposed OIWO methodology has been developed to minimize the total generation cost by satisfying several constraints such as generation limits, load demand, valve point loading effect, multi-fuel options and transmission losses. The proposed algorithm is tested and validated using five different test systems. The most important merit of the proposed methodology is high accuracy and good convergence characteristics and robustness to solve ELD problems. The simulation results of the proposed OIWO algorithm show its applicability and superiority when compared with the results of other tested algorithms such as oppositional real coded chemical reaction, shuffled differential evolution, biogeography based optimization, improved coordinated aggregation based PSO, quantum-inspired particle swarm optimization, hybrid quantum mechanics inspired particle swarm optimization, modified shuffled frog leaping algorithm with genetic algorithm, simulated annealing based optimization and estimation of distribution and differential evolution algorithm.     

A hybrid self-adaptive particle swarm optimization and modified shuffled frog leaping algorithm for distribution feeder reconfiguration

One of the very important way to save the electrical energy in distribution system is network reconfiguration for loss reduction. This paper proposes a new hybrid evolutionary algorithm for solving the distribution feeder reconfiguration (DFR) problem. The proposed hybrid evolutionary algorithm is the combination of SAPSO (self-adaptive particle swarm optimization) and MSFLA (modified shuffled frog leaping algorithm), called SAPSO–MSFLA, which can find optimal configuration of distribution network. In the PSO algorithm, appropriate adjustment of the parameters is cumbersome and usually requires a lot of time and effort. Therefore, a self-adaptive framework is proposed to improve the robustness of the PSO, also in the modified shuffled frog leaping algorithm (MSFLA) to improve the performance of algorithm a new frog leaping rule is proposed to improve the local exploration of the SFLA. The main idea of integrating SAPSO and MSFLA is to use their advantages and avoid their disadvantages. The proposed algorithm is tested on two distribution test feeders. The results of simulation show that the proposed method is very powerful and guarantees to obtain the global optimization in minimum time.     

引入混合蛙跳搜索策略的人工蜂群粒子群算法

由于标准粒子群算法易于陷入局部最优和收敛速度慢等问题,提出了一种引入人工蜂群搜索策略和混合蛙跳搜索策略的粒子群算法（ABCSFL-PSO）。使用人工蜂群的搜索策略提高算法的探索能力,避免算法陷入局部最优;使用蛙跳算法中更新最差粒子的策略,来加快算法收敛速度,并进一步提高求解精度。在12个标准测试函数上的仿真实验结果表明,算法性能优良,不仅能够避免陷入局部最优,而且显著提升了收敛速度。     

混合蛙跳算法研究综述

针对混合蛙跳算法(SFLA)是一种结合了基于遗传基因的模因演算算法和基于群体觅食行为的粒子群优化算法的亚启发式协同搜索群智能算法,系统地介绍了SFLA的基本原理和算法流程,讨论了SFLA的研究进展和应用现状,并指出了SFLA的发展趋势和下一步的研究方向.     

量子群智能优化算法综述

随着科学技术的不断发展,最优化理论及其衍生出的算法已经广泛应用于人们的日常工作与生活当中,现实世界中的很多问题都可以被描述为组合优化问题。群智能优化算法这些年来被证明在解决组合优化问题方面效果显著,将当下处于研究热点的量子计算概念引入群智能优化算法形成的量子群智能优化算法,为更好地解决组合优化问题提出了一个新的研究方向。在过去的二十多年里,许多量子群智能优化算法被不断开发出来,同时在此基础上进行了大量改进与应用。综述了量子蚁群算法、量子粒子群算法、量子人工鱼群算法、量子人工蜂群算法、量子布谷鸟搜索算法、量子混合蛙跳算法、量子萤火虫算法、量子蝙蝠算法等量子群智能优化算法,并对量子群智能优化算法面临的问题以及未来研究方向进行了深入探讨。     

Parameter optimization of modern machining processes using teaching–learning-based optimization algorithm

Modern machining processes are now-a-days widely used by manufacturing industries in order to produce high quality precise and very complex products. These modern machining processes involve large number of input parameters which may affect the cost and quality of the products. Selection of optimum machining parameters in such processes is very important to satisfy all the conflicting objectives of the process. In this research work, a newly developed advanced algorithm named ‘teaching–learning-based optimization (TLBO) algorithm’ is applied for the process parameter optimization of selected modern machining processes. This algorithm is inspired by the teaching–learning process and it works on the effect of influence of a teacher on the output of learners in a class. The important modern machining processes identified for the process parameters optimization in this work are ultrasonic machining (USM), abrasive jet machining (AJM), and wire electrical discharge machining (WEDM) process. The examples considered for these processes were attempted previously by various researchers using different optimization techniques such as genetic algorithm (GA), simulated annealing (SA), artificial bee colony algorithm (ABC), particle swarm optimization (PSO), harmony search (HS), shuffled frog leaping (SFL) etc. However, comparison between the results obtained by the proposed algorithm and those obtained by different optimization algorithms shows the better performance of the proposed algorithm.     

A Pareto archive particle swarm optimization for multi-objective job shop scheduling

In this paper, we present a particle swarm optimization for multi-objective job shop scheduling problem. The objective is to simultaneously minimize makespan and total tardiness of jobs. By constructing the corresponding relation between real vector and the chromosome obtained by using priority rule-based representation method, job shop scheduling is converted into a continuous optimization problem. We then design a Pareto archive particle swarm optimization, in which the global best position selection is combined with the crowding measure-based archive maintenance. The proposed algorithm is evaluated on a set of benchmark problems and the computational results show that the proposed particle swarm optimization is capable of producing a number of high-quality Pareto optimal scheduling plans.     

A hybrid discrete particle swarm optimization for dual-resource constrained job shop scheduling with resource flexibility

In this paper, a novel hybrid discrete particle swarm optimization algorithm is proposed to solve the dual-resource constrained job shop scheduling problem with resource flexibility. Particles are represented based on a three-dimension chromosome coding scheme of operation sequence and resources allocation. Firstly, a mixed population initialization method is used for the particles. Then a discrete particle swarm optimization is designed as the global search process by taking the dual-resources feature into account. Moreover, an improved simulated annealing with variable neighborhoods structure is introduced to improve the local searching ability for the proposed algorithm. Finally, experimental results are given to show the effectiveness of the proposed algorithm.