An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem

Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been widely employed to solve scheduling problems.However,HHO suffers from premature convergence when solving NP-hard problems.Therefore,this paper proposes an improved HHO algorithm(GNHHO)to solve the FJSP.GNHHO introduces an elitism strategy,a chaotic mechanism,a nonlinear escaping energy update strategy,and a Gaussian random walk strategy to prevent premature convergence.A flexible job shop scheduling model is constructed,and the static and dynamic FJSP is investigated to minimize the makespan.This paper chooses a two-segment encoding mode based on the job and the machine of the FJSP.To verify the effectiveness of GNHHO,this study tests it in 23 benchmark functions,10 standard job shop scheduling problems(JSPs),and 5 standard FJSPs.Besides,this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company’s FJSP.The optimized scheduling scheme demonstrates significant improvements in makespan,with an advancement of 28.16%for static scheduling and 35.63%for dynamic scheduling.Moreover,it achieves an average increase of 21.50%in the on-time order delivery rate.The results demonstrate that the performance of the GNHHO algorithm in solving FJSP is superior to some existing algorithms.

An Improved Harris Hawk Optimization Algorithm

Aiming at the problems that the original Harris Hawk optimization algorithm is easy to fall into local optimum and slow in finding the optimum,this paper proposes an improved Harris Hawk optimization algorithm(GHHO).Firstly,we used a Gaussian chaotic mapping strategy to initialize the positions of individuals in the population,which enriches the initial individual species characteristics.Secondly,by optimizing the energy parameter and introducing the cosine strategy,the algorithm's ability to jump out of the local optimum is enhanced,which improves the performance of the algorithm.Finally,comparison experiments with other intelligent algorithms were conducted on 13 classical test function sets.The results show that GHHO has better performance in all aspects compared to other optimization algorithms.The improved algorithm is more suitable for generalization to real optimization problems.

Computing Connected Resolvability of Graphs Using Binary Enhanced Harris Hawks Optimization

In this paper,we consider the NP-hard problem offinding the minimum connected resolving set of graphs.A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the ver-tices in B.A resolving set B of G is connected if the subgraph B induced by B is a nontrivial connected subgraph of G.The cardinality of the minimal resolving set is the metric dimension of G and the cardinality of minimum connected resolving set is the connected metric dimension of G.The problem is solved heuristically by a binary version of an enhanced Harris Hawk Optimization(BEHHO)algorithm.This is thefirst attempt to determine the connected resolving set heuristically.BEHHO combines classical HHO with opposition-based learning,chaotic local search and is equipped with an S-shaped transfer function to convert the contin-uous variable into a binary one.The hawks of BEHHO are binary encoded and are used to represent which one of the vertices of a graph belongs to the connected resolving set.The feasibility is enforced by repairing hawks such that an addi-tional node selected from V\B is added to B up to obtain the connected resolving set.The proposed BEHHO algorithm is compared to binary Harris Hawk Optimi-zation(BHHO),binary opposition-based learning Harris Hawk Optimization(BOHHO),binary chaotic local search Harris Hawk Optimization(BCHHO)algorithms.Computational results confirm the superiority of the BEHHO for determining connected metric dimension.

Enhancing Cancer Classification through a Hybrid Bio-Inspired Evolutionary Algorithm for Biomarker Gene Selection

In this study,our aim is to address the problem of gene selection by proposing a hybrid bio-inspired evolutionary algorithm that combines Grey Wolf Optimization(GWO)with Harris Hawks Optimization(HHO)for feature selection.Themotivation for utilizingGWOandHHOstems fromtheir bio-inspired nature and their demonstrated success in optimization problems.We aimto leverage the strengths of these algorithms to enhance the effectiveness of feature selection in microarray-based cancer classification.We selected leave-one-out cross-validation(LOOCV)to evaluate the performance of both two widely used classifiers,k-nearest neighbors(KNN)and support vector machine(SVM),on high-dimensional cancer microarray data.The proposed method is extensively tested on six publicly available cancer microarray datasets,and a comprehensive comparison with recently published methods is conducted.Our hybrid algorithm demonstrates its effectiveness in improving classification performance,Surpassing alternative approaches in terms of precision.The outcomes confirm the capability of our method to substantially improve both the precision and efficiency of cancer classification,thereby advancing the development ofmore efficient treatment strategies.The proposed hybridmethod offers a promising solution to the gene selection problem in microarray-based cancer classification.It improves the accuracy and efficiency of cancer diagnosis and treatment,and its superior performance compared to other methods highlights its potential applicability in realworld cancer classification tasks.By harnessing the complementary search mechanisms of GWO and HHO,we leverage their bio-inspired behavior to identify informative genes relevant to cancer diagnosis and treatment.

Optimization of Resource Allocation in Unmanned Aerial Vehicles Based on Swarm Intelligence Algorithms

Due to their adaptability,Unmanned Aerial Vehicles(UAVs)play an essential role in the Internet of Things(IoT).Using wireless power transfer(WPT)techniques,an UAV can be supplied with energy while in flight,thereby extending the lifetime of this energy-constrained device.This paper investigates the optimization of resource allocation in light of the fact that power transfer and data transmission cannot be performed simultaneously.In this paper,we propose an optimization strategy for the resource allocation of UAVs in sensor communication networks.It is a practical solution to the problem of marine sensor networks that are located far from shore and have limited power.A corresponding system model is summarized based on the scenario and existing theoretical works.The minimum throughputmaximizing object is then formulated as an optimization problem.As swarm intelligence algorithms are utilized effectively in numerous fields,this paper chose to solve the formed optimization problem using the Harris Hawks Optimization and Whale Optimization Algorithms.This paper introduces a method for translating multi-decisions into a row vector in order to adapt swarm intelligence algorithms to the problem,as joint time and energy optimization have two sets of variables.The proposed method performs well in terms of stability and duration.Finally,performance is evaluated through numerical experiments.Simulation results demonstrate that the proposed method performs admirably in the given scenario.

Prediction of flyrock distance induced by mine blasting using a novel Harris Hawks optimization-based multi-layer perceptron neural network

In mining or construction projects,for exploitation of hard rock with high strength properties,blasting is frequently applied to breaking or moving them using high explosive energy.However,use of explosives may lead to the flyrock phenomenon.Flyrock can damage structures or nearby equipment in the surrounding areas and inflict harm to humans,especially workers in the working sites.Thus,prediction of flyrock is of high importance.In this investigation,examination and estimation/forecast of flyrock distance induced by blasting through the application of five artificial intelligent algorithms were carried out.One hundred and fifty-two blasting events in three open-pit granite mines in Johor,Malaysia,were monitored to collect field data.The collected data include blasting parameters and rock mass properties.Site-specific weathering index(WI),geological strength index(GSI) and rock quality designation(RQD)are rock mass properties.Multi-layer perceptron(MLP),random forest(RF),support vector machine(SVM),and hybrid models including Harris Hawks optimization-based MLP(known as HHO-MLP) and whale optimization algorithm-based MLP(known as WOA-MLP) were developed.The performance of various models was assessed through various performance indices,including a10-index,coefficient of determination(R^(2)),root mean squared error(RMSE),mean absolute percentage error(MAPE),variance accounted for(VAF),and root squared error(RSE).The a10-index values for MLP,RF,SVM,HHO-MLP and WOA-MLP are 0.953,0.933,0.937,0.991 and 0.972,respectively.R^(2) of HHO-MLP is 0.998,which achieved the best performance among all five machine learning(ML) models.

An Improved Jump Spider Optimization for Network Traffic Identification Feature Selection

The massive influx of traffic on the Internet has made the composition of web traffic increasingly complex.Traditional port-based or protocol-based network traffic identification methods are no longer suitable for today’s complex and changing networks.Recently,machine learning has beenwidely applied to network traffic recognition.Still,high-dimensional features and redundant data in network traffic can lead to slow convergence problems and low identification accuracy of network traffic recognition algorithms.Taking advantage of the faster optimizationseeking capability of the jumping spider optimization algorithm(JSOA),this paper proposes a jumping spider optimization algorithmthat incorporates the harris hawk optimization(HHO)and small hole imaging(HHJSOA).We use it in network traffic identification feature selection.First,the method incorporates the HHO escape energy factor and the hard siege strategy to forma newsearch strategy for HHJSOA.This location update strategy enhances the search range of the optimal solution of HHJSOA.We use small hole imaging to update the inferior individual.Next,the feature selection problem is coded to propose a jumping spiders individual coding scheme.Multiple iterations of the HHJSOA algorithmfind the optimal individual used as the selected feature for KNN classification.Finally,we validate the classification accuracy and performance of the HHJSOA algorithm using the UNSW-NB15 dataset and KDD99 dataset.Experimental results show that compared with other algorithms for the UNSW-NB15 dataset,the improvement is at least 0.0705,0.00147,and 1 on the accuracy,fitness value,and the number of features.In addition,compared with other feature selectionmethods for the same datasets,the proposed algorithmhas faster convergence,better merit-seeking,and robustness.Therefore,HHJSOAcan improve the classification accuracy and solve the problem that the network traffic recognition algorithm needs to be faster to converge and easily fall into local optimum due to high-dimensional features.

改进群体智能算法的无线传感器网络覆盖优化

为解决无线传感器网络(Wireless Sensor Networks,WSN)节点分布不均和随机部署中的低覆盖率问题,该文提出一种改进群体智能算法的无线传感器网络覆盖优化算法,即改进的黑猩猩优化和哈里斯鹰优化的混合优化算法(Improved Chimp Optimization and Harris Hawk Optimization Algorithm,ICHHO).该算法首先对黑猩猩优化算法(Chimpanzee Optimization Algorithm,ChOA)进行改进,使用Levy Flight来改善其探索阶段,然后设计一个更新的公式来计算猎物逃逸能量,作为开发和探索之间的选择因素.传感器节点随机部署后,将ICHHO在传感器节点上执行,按照改进策略更新个体位置信息,计算相应的适应程度,找到最优传感器位置,并根据传感器概率模型确定网络最优覆盖率.仿真结果验证了ICHHO对于解决WSN覆盖问题的适用性,与其他优化算法的对比结果显示,ICHHO在提高覆盖率方面优于其他算法.

改进哈里斯鹰算法的仓储机器人路径规划研究

为提高静态环境下仓储移动机器人路径规划效率,解决传统哈里斯鹰(Harris Hawks optimization, HHO)算法在路径规划中存在收敛速度慢且易陷入局部最优的问题,提出了一种基于Tent混沌映射融合柯西反学习变异的哈里斯鹰优化算法(HHO algorithmbasedon Tentchaotic mapping hybrid Cauchy mutation and inverse learning, TCLHHO)。通过Tent混沌映射增加种群多样性,以提高算法的收敛速度;提出指数型的猎物逃逸能量更新策略,以平衡算法的全局搜索和局部开发能力;通过柯西反学习变异策略对最优个体进行扰动,扩大算法的搜索范围,增强全局搜索能力。根据真实仓储环境搭建二维栅格环境模型,并在Matlab中进行仿真对比实验。结果表明:该算法的规划速度、最优路径长度以及最优路径转折次数较对比算法具有较好的效果,验证了应用于智能仓储环境下改进的HHO路径规划问题的可行性和鲁棒性。

多策略集成的哈里斯鹰算法求解全局优化问题

为提高哈里斯鹰算法优化问题的性能,提出一种融合佳点集、非线性能量逃逸因子和Logistic-Cubic级联混沌扰动的多策略哈里斯鹰优化算法(Improve Harris Hawk Optimization,IHHO)。首先,引入佳点集策略代替随机初始种群,均匀初始种群分布性。其次,根据算法各个阶段不同特征提出一种非线性能量逃逸因子,平衡全局和局部勘探能力。最后,引入Logistic-Cubic级联混沌对搜索位置扰动,避免算法陷入局部最优。利用IHHO算法求解23个函数及三桁架工程设计问题,并利用目标收敛曲线、Wilcoxon秩和检验进行测试,结果表明,IHHO算法相比对比算法具有更强寻优性能、求解稳定性,在求解全局优化问题上具有一定竞争性。

基于改进哈里斯鹰优化算法的动态路径规划研究

针对传统栅格地图下的路径规划算法存在多峰值优化、无法实时避障等问题,提出了一种基于改进哈里斯鹰优化算法的动态路径规划方法。首先,提出方形邻格邻近扩散方法初始化哈里斯鹰种群位置,在路径规划问题模型下增加种群多样性;然后,提出一种非线性能量因子优化算法在搜索和开发之间的更新比例,提高全局搜索性能;最后,引入动态窗口法提高机器人实际运行路径的平滑程度,构造结合全局路径的动态窗口评价函数以改善动态窗口法前瞻性不足的问题。实验结果表明,所提方法可以兼顾实时避障和路径最优的需求。

基于改进哈里斯鹰算法的无人飞行器路径规划

针对无人飞行器三维路径规划问题,提出一种基于哈里斯鹰优化(Harris hawks optimization,HHO)算法的无人飞行器三维路径规划算法。首先根据路径规划代价指标和无人飞行器自身性能,建立路径规划模型确立代价函数和约束条件。接着针对传统HHO算法的不足,引入非线性能量因子来平衡全局搜索和局部搜索的关系,使算法避免陷入局部最小值;引入混沌映射对HHO算法进行初始化种群并对其进行局部混沌搜索,增强算法种群多样性和搜索能力。最后通过仿真实验证明,改进的哈里斯鹰优化(improvement Harris hawks optimization,IHHO)算法可以有效规划出安全的无人飞行器航线,并且能够跳出局部最小值和具备较优的收敛速度。

基于IHHO-HKELM输电线路覆冰预测模型

为了进一步提高输电线路覆冰预测精度,提出一种基于改进哈里斯鹰算法(improved harris hawk optimiza-tion,IHHO)优化混合核极限学习机(hybrid kernel extreme learning machine,HKELM)的输电线路覆冰预测模型。在核极限学习机(KELM)中引入混合核函数,形成HKELM,利用黄金正弦、非线性递减能量指数和高斯随机游走等策略对IHHO算法进行改进;以IHHO算法的优化性能采用其对HKELM的权值向量和核参数进行优化,建立基于IHHO-HKELM的输电线路覆冰预测模型,并通过计算气象因素与覆冰厚度之间的灰色关联度确定覆冰预测模型的输入量。算例分析结果表明,IHHO-HKELM模型预测结果的均方误差、最大误差和平均相对误差分别为0.285、0.860 mm和2.83%,预测效果好于其他模型,将本文覆冰预测模型应用于其他覆冰线路,可获得良好的应用效果并验证模型的优越性和实用性。

基于正余弦的非线性哈里斯鹰优化算法

针对哈里斯鹰优化算法(HHO)收敛精度低、易陷入局部最优等问题,提出了一种基于正余弦的非线性哈里斯鹰优化算法(SCNHHO)。首先,采用佳点集策略对种群进行初始化,使种群分布更均匀,提高算法收敛速度和精度;其次,在探索阶段引入正余弦策略,利用正余弦函数的震荡特性扩大搜索范围,寻求更多潜在的优质解;最后,在开发阶段引入非线性参数来平衡探索与开发,避免算法陷入局部最优。针对不同维度的基准测试函数进行性能测试,结合Wilcoxon秩和检验与Friedman检验的结果,将该算法与其他5个对比算法进行分析。结果表明,改进算法性能较原始HHO算法有较大提升,并且优于斑马优化算法(ZOA)、鲸鱼优化算法(WOA)和2种哈里斯鹰算法的变体(MHHO和IHHO),验证了改进策略的有效性。最后通过三杆桁架设计问题进一步验证了SCNHHO的实用性。

基于HHO-FA的PEMFC电堆辨识建模

为解决质子交换膜燃料电池(PEMFC)模型参数难以确定的问题,该文提出一种基于哈里斯鹰算法(HHO)和萤火虫算法(FA)联合的优化算法,即HHO-FA算法,用于PEMFC模型的参数辨识。为提高PEMFC建模精确度,HHO-FA保留HHO中搜索效率和精度较高的全局搜索过程,局部寻优过程结合具有群体寻优特征的FA算法,同时优化负责全局搜索和局部搜索切换的转换因子,加入惯性权重因子,优化算法结构。该文使用燃料电池的商业仿真工具箱Thermolib获取算例数据,并通过与粒子群算法(PSO)、HHO算法、蚁群算法(ACO)和FA算法对比分析,对HHO-FA的PEMFC参数辨识性能进行研究。仿真结果表明,相较于PSO、HHO、ACO和FA,HHO-FA的辨识精确度和收敛效率均最高,证实所提出HHO-FA算法在PEMFC模型参数辨识方面的突出性能。

正余弦动态干扰哈里斯鹰算法的PCNN参数优化图像融合

哈里斯鹰优化算法存在前期全局开发种群分布不广泛、后期局部开发易陷入收敛精度不够的缺陷,因此提出一种正余弦动态干扰的哈里斯鹰优化算法。首先,在前期的全局开发阶段,对两种不同的进化策略分别采用余弦函数和正弦函数进行鹰群群体分布干扰,从而扩大群体分布范围,强化鹰群初期全局探索阶段的广度,为后期进行局部开发提供更好的条件;然后,在局部开发阶段,通过对猎物逃逸能量公式进行曲线化调整,使得猎物能量损耗与自然界中的真实能量损失更加匹配,进而提升开发阶段的捕获能力;最后,将改进的正余弦动态干扰的哈里斯鹰优化算法对脉冲耦合神经网络(PCNN)的链接输入、时间衰减系数、链接强度3个参数进行优化,并应用于可见光与ToF置信图的图像融合。采用6种对比算法及24个测试函数对改进后的算法进行仿真实验验证,证明了基于正余弦动态干扰的哈里斯鹰优化算法具有较好的寻优能力和更高的收敛精度。通过与其他融合算法进行对比实验,验证了改进后的融合算法相比原始算法的融合效果有显著提升。

求解有服务顺序限制的MDMOVRPTW的IHHO算法

针对有服务顺序限制的带时间窗的多需求多目标车辆路径问题(multi-demand and multi-objective vehicle routing problem with time window,MDMOVRPTW),在考虑多种需求由不同车辆按顺序服务等约束条件的同时,构建了最小化配送成本和最大化客户满意度的多目标模型。根据模型的特点设计了改进的哈里斯鹰优化(improved Harris hawks optimization,IHHO)算法,随机地将种群中部分支配解作为父代解,用临时组合算子和4种交叉算子搜索新解。最后,算例测试结果表明,相较于传统的哈里斯鹰优化算法,IHHO算法的求解性能得到了有效改善,各操作算子中交叉算子2的求解效果最好。将IHHO算法用于实例中,求解结果得到了改善,充分验证了IHHO算法的有效性。

应用多策略融合改进哈里斯鹰算法的移动 机器人路径规划方法

针对移动机器人在多障碍物室内环境中进行路径规划时存在的折点多、收敛速度慢、易陷入局部最优解等问题,提出一种基于多策略融合改进哈里斯鹰算法的移动机器人路径规划方法。首先,利用Tent混沌映射初始化和自适应正余弦算法,改善初始种群分布多样性并增强全局搜索能力;其次,使用模拟退火能量策略改善哈里斯鹰算法的行为选择,加强算法收敛速度;然后,使用柯西函数和改进莱维飞行优化算法位置更新行为,提升算法的寻优性能和效率;最后,使用消融实验和对比实验对移动机器人在不同复杂程度的地图场景中的路径规划性能进行验证。实验结果表明:多策略融合改进哈里斯鹰算法在移动机器人路径规划问题中,不仅可以有效减少折点数获得较好的路径平滑度,还可达到更快的收敛速度和更短的移动路径。

基于CMMFDE与多传感器信息融合的旋转机械故障诊断研究

采用单一传感器采集的振动信号难以准确描述旋转机械动态特性,导致提取的故障特征无法准确辨识旋转机械故障。针对这一缺陷,提出了一种基于复合多元多尺度波动散布熵(CMMFDE)、多传感器信息融合和哈里斯鹰算法优化极限学习机(HHO-ELM)的旋转机械故障诊断方法。首先,引入复合多元粗粒化处理,提出了CMMFDE方法,避免了传统单变量分析方法只能处理单一通道振动信号而导致特征的表征性能不足的缺陷,增强了故障特征的表征性能;随后,利用布置在旋转机械不同部位的传感器收集了多种类型的信号,组成混合多通道信号,并进行了CMMFDE分析,构建了故障特征;最后,采用HHO对极限学习机的参数进行了自适应优化,并对特征样本进行了训练和测试,完成了旋转机械的故障识别工作;利用齿轮箱、离心泵两种典型的旋转机械数据集进行了实验分析。研究结果表明:该方法对多个通道的信号进行分析时,所获得的准确率达到了100%和98%,优于对单个通道信号进行分析时获得的准确率,同时CMMFDE方法的准确率和特征提取时间均优于精细复合多元多尺度熵(RCMMSE)、精细复合多元多尺度模糊熵(RCMMFE)、精细复合多元多尺度排列熵(RCMMPE)、多元多尺度波动散布熵(MMFDE)。

递进式融合多策略的改进哈里斯鹰优化算法

针对哈里斯鹰优化算法(HHO)易陷入局部最优、全局探索性能与局部开发能力不平衡等缺点,提出递进式融合多策略的改进哈里斯鹰优化算法(IHHO).首先,调整随机游走机制的位置更新方程以实现小范围优质勘探,提升该机制有效性,加强算法局部开发能力;其次,采用S型自适应能量控制因子,使算法能根据搜索进程合理调控捕猎行为,修正寻优模型;最后,融入定点重组与诱变策略,既保证种群优良基因集中于某一个体,又丰富种群多样性,算法局部寻优性能和局部极值规避能力并进增强.实验表明,所提改进方法以递进式提升算法性能,经耦合叠加效应后所得IHHO的搜索精度高、收敛速度快,并且具有较强实用性.