改进鲸鱼算法在电动汽车有序充电中的应用

为解决大规模电动汽车无序充电对电网稳定性造成的影响,建立了电网层负荷峰谷差最小和用户层充电费用最小的两方面有序充电目标函数。为实现高效且快速的求解,对鲸鱼算法（Whale Optimization Algorithm,WOA）进行了改进,在该算法中加入两种非线性惯性权重来平衡局部搜索能力和全局搜索能力,并提出了一种教学策略（Teaching-Learning Strategy,TLS）来提高鲸鱼个体的位置质量,教学策略中采用变异手段增加种群的多样性,能有效防止迭代过早停滞。算例中分别利用IWOA、标准WOA、粒子群算法（Particle Swarm Optimization,PSO）测试基准函数,并对电动汽车有序充电优化目标进行求解,最后通过比较验证了IWOA的高效性和实用性。     

改进鲸鱼优化支持向量机的交通流量模糊粒化预测

针对支持向量机（SVM）在交通流量预测中存在波动性且预测精度低的问题,提出了采用模糊信息粒化（FIG）和改进鲸鱼优化算法（IWOA）的SVM模型来预测交通流量的变化趋势和动态区间。首先,对数据处理采用FIG方法进行处理,从而得到交通流量变化区间的上界（Up）、下界（Low）和趋势值（R）;其次,在鲸鱼优化算法（WOA）的种群初始化中采用动态对立学习来增加种群多样性,并引入了非线性收敛因子和自适应权重来增强算法的全局搜索及局部寻优能力,然后建立了IWOA模型,并分析了IWOA的复杂度;最后,以预测交通流量的均方误差（MSE）为目标函数,在IWOA迭代过程中不断优化SVM的超参数,建立了基于FIG-IWOA-SVM的交通流量区间预测模型。在国内和国外交通流量数据集上进行测试的结果表明,在国外交通流量预测上,与基于遗传算法优化的支持向量机（GA-SVM）、基于粒子群优化算法优化的支持向量机（PSO-SVM）和基于鲸鱼优化算法的支持向量机（WOA-SVM）相比,IWOA-SVM模型的平均绝对误差（MAE）分别降低了89.5%、81.5%和1.5%;而FIG-IWOA-SVM模型在交通流量动态区间和趋势预测上与FIG-GA-SVM、FIG-PSO-SVM和FIG-WOA-SVM等模型相比预测精度更高且预测范围更平稳。实验结果表明,在不增加算法复杂度的前提下,FIG-IWOA-SVM模型能够合理地预测交通流量的变化趋势和变化区间,为后续的交通规划和流量控制提供依据。     

改进的鲸鱼优化算法及其应用

为了准确地建立断路器热脱扣器的脱扣时间预测模型,改善脱扣器的稳定性。提出了一种改进的鲸鱼优化算法（IWOA）和支持向量回归（SVR）综合建模的方法。针对鲸鱼优化算法（WOA）具有易陷入局部最优解、收敛速度慢、收敛精度低等问题,提出三个策略改进,并在10个基本测试函数上进行比较,结果证明改进的鲸鱼优化算法具有更高的收敛精度和更快的收敛速度。建立IWOA-SVR脱扣时间预测模型,并优化断路器的生产过程,进而提高断路器的生产效率和产品质量。     

基于改进鲸鱼优化算法的外骨骼机器人步态检测

针对传统的外骨骼机器人步态检测算法中的信息单一化、准确率低、易陷入局部最优等问题，提出基于改进鲸鱼算法优化的支持向量机（IWOA-SVM）的外骨骼机器人步态检测算法，即在鲸鱼优化算法（WOA）中引入遗传算法（GA）的选择、交叉、变异操作，进而去优化支持向量机（SVM）的惩罚因子与核参数，再使用参数优化后的SVM建立分类模型，从而扩大算法的搜索范围，减小算法陷入局部最优的概率。首先，使用混合传感技术采集步态数据，即通过足底压力传感器和膝关节、髋关节角度传感器采集外骨骼机器人的运动数据，并作为步态检测系统的输入；然后，使用门限法对步态相位进行划分并标记标签；最后，将足底压力信号与髋关节、膝关节角度信号融合作为输入，使用IWOA-SVM算法完成对步态的检测。对6个标准测试函数进行仿真实验，并与GA、粒子群优化（PSO）算法、WOA进行比较，数值实验表明，改进鲸鱼优化算法（IWOA）的鲁棒性、寻优精度、收敛速度均优于其他优化算法。通过分析不同穿戴者的步态检测结果发现，准确率可达98.8%，验证了所提算法在新一代外骨骼机器人中的可行性和实用性，并与基于遗传优化算法的支持向量机（GA-SVM）、基于粒子群优化算法的支持向量机（PSO-SVM）、基于鲸鱼优化算法的支持向量机（WOA-SVM）算法进行比较，结果表明，该算法识别准确率分别提高了5.33%、2.70%、1.44%，能够对外骨骼机器人的步态进行有效检测，进而实现外骨骼机器人的精确控制及稳定行走。     

基于自适应鲸鱼优化算法结合Elman神经网络的股市收盘价预测算法

针对Elman神经网络在基于股市网络舆情的收盘价预测中存在的收敛速度慢且预测精度低的问题,提出了结合基于自适应噪声的完全集合经验模态分解(CEEMDAN)的改进鲸鱼优化算法(IWOA)结合Elman神经网络预测模型。首先,通过文本挖掘技术对上海证券交易所股票价格综合指数(SSE)180股的网络舆情进行挖掘和量化,并利用Boruta算法筛选重要属性以降低属性集的复杂度;然后,通过CEEMDAN算法在属性集中添加一定数量特定方差的白噪声,实现属性序列的分解与降噪;同时,利用自适应权重改进鲸鱼优化算法(WOA)以增强其全局搜索及局部开采能力;最后,利用WOA在迭代过程中不断优化Elman神经网络的初始权重和阈值。结果表明:比起单独使用Elman神经网络,所提模型的平均绝对误差(MAE)从358.8120降低至113.0553;与未采用CEEMDAN算法的原始数据集相比,该模型的平均绝对百分比误差(MAPE)从4.9423%降低到1.44531%,说明所提模型有效提高了预测精度,为股市网络舆情的预测提供了一种有效的实验方法。     

An Integrated Optimization Enabled Sensor Deployment Model in Wireless Sensor Network

ABSTRACT

Target coverage (TCOV) and network connectivity (NCON) are the most basic problems affecting robust data communication and environmental sensing in a wireless sensor network (WSN) application. This article proposes an intelligent Context Aware Sensor Network (CASN) for the process of sensor deployment in WSNs. Accordingly, the process is sub-divided into two phases. In the initial phase, optimal TCOV is performed; whereas, in the second phase, the proposed algorithm establishes NCON among the sensors. The objective model that meets both TCOV and NCON is evaluated as the minimization problem. This problem is solved by a new method that hybridizes the Artificial Bee Colony (ABC) algorithm and the Whale Optimization Algorithm (WOA) together, which is known as the Onlooker Probability-based WOA (OP-WOA) for the determination of optimal sensor locations. In addition, the adopted OP-WOA model is compared with the Genetic Algorithm (GA), the Particle Swarm Optimization (PSO), the ABC algorithm, Differential Evolution (DE), FireFly (FF), the WOA, and the Evolutionary Algorithm (EA)-based TCOV and NCON models. Finally, the results attained from the execution demonstrate the enhanced performance of the implemented OP-WOA technique.     

改进鲸鱼算法及其在路径规划的应用

针对鲸鱼优化算法(WOA)存在的收敛速度慢、收敛精度低和易陷入局部最优等问题,提出了采用非线性收敛因子、协同a的惯性权重、时变独立搜索概率和免疫记忆改进的鲸鱼优化算法(IWTWOA);应用非线性收敛因子、协同a的惯性权重和时变独立搜索概率改进WOA迭代模型,平衡了算法的全局搜索和局部搜索能力,有效避免了陷入局部最优的问题;引入免疫算法的免疫记忆机制,提高了算法收敛速度;选取了15个基准测试函数进行性能测试,结果表明IWTWOA算法在稳定性、计算精度和收敛速度上均有所提高;最终将其应用在路径规划问题中,获得了较好的结果.     

基于改进鲸鱼优化算法的血液供应链网络多目标鲁棒优化设计

为解决血液供应链网络设计中的不确定性问题,建立了一种血液供应链网络多目标鲁棒优化设计模型。首先,针对带有5个节点的血液供应链网络,建立考虑安全库存的、目标为成本最小、存储时间最短的优化函数,并采用ε约束、Pareto最优和鲁棒优化方法对已建模型进行处理,将多目标问题转化为单目标鲁棒问题;其次,对原有鲸鱼优化算法（WOA）进行改进,引入差分算法的交叉和变异理念,增强了搜索能力并改善了局限性,从而得到差分鲸鱼优化算法（DWOA）,并采用此算法对处理后的模型求解。通过数值实例,验证当测试问题相同时,优化模型在需求短缺方面比确定模型的短缺量平均少76%。因此,所提优化模型在应对需求短缺时更具优势;通过仿真对比分析图像,得出DWOA相比WOA、粒子群优化（PSO）算法和遗传算法（GA）中断时间更短并且成本更低。     

基于改进鲸鱼算法寻优SVM的船用柴油机燃油系统故障诊断方法研究

鉴于船用柴油机的复杂性,难以及时有效地进行维护保养决策,故此提出一种拉普拉斯分值和改进鲸鱼算法的支持向量机相结合的故障诊断方法.首先利用LS对征兆样本集进行降维处理,然后通过IWOA来优化SVM的惩罚因子和核参数,构造成分类器模型来进行故障诊断.将改进的算法与传统的算法进行比较,验证了改进鲸鱼算法寻优SVM在故障诊断方面的有效性.     

基于混沌麻雀搜索算法的无人机航迹规划方法

针对无人机（UAV）航迹规划求解计算量大、难收敛等问题,提出了一种基于混沌麻雀搜索算法（CSSA）的航迹规划方法。首先,建立二维任务空间模型与航迹代价模型,将航迹规划问题转化为多维函数优化问题;其次,采用立方映射初始化种群,并使用反向学习策略（OBL）引入精英粒子,增强种群多样性,扩大搜索区域范围;然后,引入正弦余弦算法（SCA）,并采用线性递减策略平衡算法的开发与探索能力,当算法陷入停滞时,采用高斯游走策略帮助算法跳出局部最优;最后,将提出的改进算法在15个基准测试函数中进行性能验证,并应用于航迹规划问题求解。仿真结果表明,CSSA的寻优性能优于粒子群优化（PSO）算法、天牛群优化（BSO）算法、鲸鱼优化算法（WOA）、灰狼优化（GWO）算法和麻雀搜索算法（SSA）,并且能够快速地得到一条代价最优、满足约束的安全可行航迹,验证了所提方法的有效性。     

结合鲸鱼优化算法的自适应密度峰值聚类算法

针对密度峰值聚类算法（DPC）的聚类结果对截断距离[dc]的取值较为敏感、手动选取聚类中心存在着一定主观性的问题,提出了一种结合鲸鱼优化算法的自适应密度峰值聚类算法（WOA-DPC）。利用加权的局部密度和相对距离乘积的斜率变化趋势实现聚类中心的自动选择,避免了手动选取导致的聚类中心少选或多选的情况;考虑到合理的截断距离[dc]是提高DPC算法聚类效果的重要因素,建立以ACC指标为目标函数的优化问题,利用鲸鱼优化算法（WOA）有效地寻优能力对目标函数进行优化,寻找最佳的截断距离[dc];利用人工合成数据集与UCI上的真实数据集对WOA-DPC算法进行测试。实验结果表明,该算法在FMI、ARI和AMI指标上均优于DPC算法、DBSCAN算法以及K-Means算法,具有更好的聚类表现。     

改进麻雀搜索算法在分布式电源配置中的应用

针对麻雀搜索算法（Sparrow Search Algorithm,SSA）在解决高维、非线性的分布式电源（Distributed Generation,DG）优化配置问题中求解精度与稳定性不足的问题,提出一种改进麻雀搜索算法进行求解。通过引入Tent混沌提高初始解的质量,利用Levy飞行策略和柯西高斯变异,增强算法搜索方向的多元性以及跳出局部最优的能力,针对算法在工程应用中产生大量无效麻雀的问题,优化了麻雀位置更新公式,以提高SSA的工程实用性。分别用标准SSA、ISSA、蝴蝶优化算法（Butterfly Optimization Algorithm,BOA）、鲸鱼优化算法（Whale Optimization Algorithm,WOA）测试基准函数,对比验证ISSA的有效性,并将ISSA应用于IEEE33节点系统的DG化配置模型求解,所求的DG配置方案能更大程度地降低配电网有功损耗与电压偏差。     

基于正交自适应鲸鱼优化的云计算任务调度

针对任务调度中存在的任务完成时间长、系统执行任务成本高且系统负载不均衡等问题,提出了一种基于正交自适应鲸鱼优化算法（OAWOA）的云计算任务调度方法。首先,将正交试验设计（OED）应用于种群初始化和全局搜索阶段,以提升和维持种群的多样性,避免算法过早陷入局部收敛状态;然后,利用自适应指数递减因子和双向搜索机制,来进一步加强算法的全局搜索能力;最后,对适应度函数进行优化,从而使算法实现多目标优化。通过仿真实验将所提的算法与鲸鱼优化算法（WOA）、粒子群优化（PSO）算法、蝙蝠算法（BA）以及其他两种改进的WOA进行比较。实验结果表明,在任务规模为50和500时所提算法都取得了更好的收敛效果,并且得到的系统执行任务的总时间和总成本均低于其他几种算法,同时负载均衡度仅低于BA。可见,所提算法在降低系统执行任务的总时间和总成本以及提高系统负载均衡方面均表现出了显著的优势。     

混合蝗虫优化算法求解作业车间调度问题

作为新兴的智能算法，蝗虫优化算法在作业车间调度问题中的应用符合智能制造的趋势。但由于全局寻优能力不足，基本蝗虫优化算法（GOA）在解决作业车间调度问题（JSP）时容易陷入局部最优，导致收敛精度较低。为了克服上述缺陷，利用量子旋转门操作对其进行改进，提出了一种基于量子计算思想的混合蝗虫优化算法（HGOA）。此外，对混合蝗虫优化算法进行了计算复杂度分析与全局收敛性证明，并利用11个作业车间标准测试问题进行了仿真实验。通过与基本蝗虫优化算法（GOA）、鲸鱼优化算法（WOA）、布谷鸟搜索算法（CS）、灰狼优化算法（GWO）的比较发现，混合蝗虫优化算法在平均值、最小值、寻优成功率及迭代次数方面存在较优结果。研究表明，混合蝗虫优化算法具有更强的全局搜索能力，更好的收敛精度，能够有效跳出局部最优。     

A whale optimization algorithm based on quadratic interpolation for high-dimensional global optimization problems

Whale Optimization Algorithm (WOA), as a new population-based optimization algorithm, performs well in solving optimization problems. However, when tackling high-dimensional global optimization problems, WOA tends to fall into local optimal solutions and has slow convergence rate and low solution accuracy. To address these problems, a whale optimization algorithm based on quadratic interpolation (QIWOA) is presented. On the one hand, a modified exploration process by introducing a new parameter is proposed to efficiently search the regions and deal with the premature convergence problem. On the other hand, quadratic interpolation around the best search agent helps QIWOA to improve the exploitation ability and the solution accuracy. Moreover, the algorithm tries to make a balance between exploitation and exploration. QIWOA is compared with several state-of-the-art algorithms on 30 high-dimensional benchmark functions with dimensions ranging from 100 to 2000. The experimental results show that QIWOA has faster convergence rate and higher solution accuracy than both WOA and other population-based algorithms. For functions with a flat or sharp bottom, QIWOA is difficult to find the global optimum, but it still performs best compared with other algorithms.     

基于改进的鲸鱼优化算法在ELD上的应用

针对电力系统经济负荷分配这一典型的非凸、非线性、组合优化问题,提出一种将基于自适应权重更新策略和差分进化的随机变异策略的鲸鱼优化优化算法(ADWOA)相结合。该算法首先在鲸鱼优化算法中引入了自适应权重来提高WOA的搜索能力,使算法能够在早期执行精细的全局搜索,在后期执行精确的局部搜索,加速寻优算法的迭代,同时由于随机变异策略,会再次更新位置。然后从更新的结果中选择最优位置,以加速种群的收敛,并有效防止种群陷入局部最优将适应度较好的个体信息更快地保留用于下一次鲸鱼优化算法的迭代,提高了求最优解的速度和精度。最后,对多个算法在电力系统经济负荷分配问题进行了测试,验证了基于自适应权重的的鲸鱼优化算法可以更合理地配置电力系统的经济负荷,能够有效找到可行解,避免陷入局部最优,能实现经济负荷的合理分配。     

ESSAWOA: Enhanced Whale Optimization Algorithm integrated with Salp Swarm Algorithm for global optimization

In this paper, a novel hybrid meta-heuristic algorithm called ESSAWOA is proposed for solving global optimization problems. The main idea of ESSAWOA is to enhance Whale Optimization Algorithm (WOA) by combining the mechanism of Salp Swarm Algorithm (SSA) and Lens Opposition-based Learning strategy (LOBL). The hybridization process includes three parts: First, the leader mechanism with strong exploitation of SSA is applied to update the population position before the basic WOA operation. Second, the nonlinear parameter related to the convergence property in SSA is introduced to the two phases of encircling prey and bubble-net attacking in WOA. Third, LOBL strategy is used to increase the population diversity of the proposed optimizer. The hybrid design is expected to significantly enhance the exploitation and exploration capacity of the proposed algorithm. To investigate the effectiveness of ESSAWOA, twenty-three benchmark functions of different dimensions and three classical engineering design problems are performed. Furthermore, SSA, WOA and seven other well-known meta-heuristic algorithms are employed to compare with the proposed optimizer. Our results reveal that ESSAWOA can effectively and quickly obtain the promising solution of these optimization problems in the search space. The performance of ESSAWOA is significantly superior to the basic WOA, SSA and other meta-heuristic algorithms.

     

Whale Optimization Algorithm and Moth-Flame Optimization for multilevel thresholding image segmentation

Determining the optimal thresholding for image segmentation has got more attention in recent years since it has many applications. There are several methods used to find the optimal thresholding values such as Otsu and Kapur based methods. These methods are suitable for bi-level thresholding case and they can be easily extended to the multilevel case, however, the process of determining the optimal thresholds in the case of multilevel thresholding is time-consuming. To avoid this problem, this paper examines the ability of two nature inspired algorithms namely: Whale Optimization Algorithm (WOA) and Moth-Flame Optimization (MFO) to determine the optimal multilevel thresholding for image segmentation. The MFO algorithm is inspired from the natural behavior of moths which have a special navigation style at night since they fly using the moonlight, whereas, the WOA algorithm emulates the natural cooperative behaviors of whales. The candidate solutions in the adapted algorithms were created using the image histogram, and then they were updated based on the characteristics of each algorithm. The solutions are assessed using the Otsu’s fitness function during the optimization operation. The performance of the proposed algorithms has been evaluated using several of benchmark images and has been compared with five different swarm algorithms. The results have been analyzed based on the best fitness values, PSNR, and SSIM measures, as well as time complexity and the ANOVA test. The experimental results showed that the proposed methods outperformed the other swarm algorithms; in addition, the MFO showed better results than WOA, as well as provided a good balance between exploration and exploitation in all images at small and high threshold numbers.     

基于鲸鱼群优化算法的带Sigmoid满意度应急车辆调度问题

针对突发大规模灾害事件下受灾点严重程度不同的特点,引入Sigmoid时间满意函数评价救援效果,建立平均时间满意度最大与救援路径最短双目标调度模型.设计了基于混沌序列搜索算子的混沌鲸鱼群算法,通过构建三组不同规模的实验案例对模型进行求解,并将所得结果与模拟退火算法和基本鲸鱼群算法进行比较.实验表明,在处理较小规模车辆调度情况下,三种算法处理效果差距不明显,随着求解规模增大,混沌鲸鱼群算法对解决所提问题具有更好的效果,是一种优化应急车辆的有效方法.     

A novel methodology for optimal single mobile robot scheduling using whale optimization algorithm

One of the fundamental requirements for creating an intelligent manufacturing environment is to develop a reliable, efficient and optimally scheduled material transport system. Besides traditional material transport solutions based on conveyor belts, industrial trucks, or automated guided vehicles, nowadays intelligent mobile robots are becoming widely used to satisfy this requirement. In this paper, the authors analyze a single mobile robot scheduling problem in order to find an optimal way to transport raw materials, goods, and parts within an intelligent manufacturing system. The proposed methodology is based on biologically inspired Whale Optimization Algorithm (WOA) and is aimed to find the optimal solution of the nondeterministic polynomial-hard (NP-hard) scheduling problem. The authors propose a novel mathematical model for the problem and give a mathematical formulation for minimization of seven fitness functions (makespan, robot finishing time, transport time, balanced level of robot utilization, robot waiting time, job waiting time, as well as total robot and job waiting time). This newly developed methodology is extensively experimentally tested on 26 benchmark problems through three experimental studies and compared to five meta-heuristic algorithms including genetic algorithm (GA), simulated annealing (SA), generic and chaotic Particle Swarm Optimization algorithm (PSO and cPSO), and hybrid GA–SA algorithm. Furthermore, the data are analyzed by using the Friedman statistical test to prove that results are statistically significant. Finally, generated scheduling plans are tested by Khepera II mobile robot within a laboratory model of the manufacturing environment. The experimental results show that the proposed methodology provides very competitive results compared to the state-of-art optimization algorithms.