BHJO: A Novel Hybrid Metaheuristic Algorithm Combining the Beluga Whale, Honey Badger, and Jellyfish Search Optimizers for Solving Engineering Design Problems

Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization problems.This approach aims to leverage the strengths of multiple algorithms,enhancing solution quality,convergence speed,and robustness,thereby offering a more versatile and efficient means of solving intricate real-world optimization tasks.In this paper,we introduce a hybrid algorithm that amalgamates three distinct metaheuristics:the Beluga Whale Optimization(BWO),the Honey Badger Algorithm(HBA),and the Jellyfish Search(JS)optimizer.The proposed hybrid algorithm will be referred to as BHJO.Through this fusion,the BHJO algorithm aims to leverage the strengths of each optimizer.Before this hybridization,we thoroughly examined the exploration and exploitation capabilities of the BWO,HBA,and JS metaheuristics,as well as their ability to strike a balance between exploration and exploitation.This meticulous analysis allowed us to identify the pros and cons of each algorithm,enabling us to combine them in a novel hybrid approach that capitalizes on their respective strengths for enhanced optimization performance.In addition,the BHJO algorithm incorporates Opposition-Based Learning(OBL)to harness the advantages offered by this technique,leveraging its diverse exploration,accelerated convergence,and improved solution quality to enhance the overall performance and effectiveness of the hybrid algorithm.Moreover,the performance of the BHJO algorithm was evaluated across a range of both unconstrained and constrained optimization problems,providing a comprehensive assessment of its efficacy and applicability in diverse problem domains.Similarly,the BHJO algorithm was subjected to a comparative analysis with several renowned algorithms,where mean and standard deviation values were utilized as evaluation metrics.This rigorous comparison aimed to assess the performance of the BHJOalgorithmabout its counterparts,shedding light on its effectiveness and reliability in solving optimization problems.Finally,the obtained numerical statistics underwent rigorous analysis using the Friedman post hoc Dunn’s test.The resulting numerical values revealed the BHJO algorithm’s competitiveness in tackling intricate optimization problems,affirming its capability to deliver favorable outcomes in challenging scenarios.

Development of hybrid optimization algorithm for structures furnished with seismic damper devices using the particle swarm optimization method and gravitational search algorithm

Previous studies about optimizing earthquake structural energy dissipation systems indicated that most existing techniques employ merely one or a few parameters as design variables in the optimization process,and thereby are only applicable only to simple,single,or multiple degree-of-freedom structures.The current approaches to optimization procedures take a specific damper with its properties and observe the effect of applying time history data to the building;however,there are many different dampers and isolators that can be used.Furthermore,there is a lack of studies regarding the optimum location for various viscous and wall dampers.The main aim of this study is hybridization of the particle swarm optimization(PSO) and gravitational search algorithm(GSA) to optimize the performance of earthquake energy dissipation systems(i.e.,damper devices) simultaneously with optimizing the characteristics of the structure.Four types of structural dampers device are considered in this study:(ⅰ) variable stiffness bracing(VSB) system,(ⅱ) rubber wall damper(RWD),(ⅲ) nonlinear conical spring bracing(NCSB) device,(iv) and multi-action stiffener(MAS) device.Since many parameters may affect the design of seismic resistant structures,this study proposes a hybrid of PSO and GSA to develop a hybrid,multi-objective optimization method to resolve the aforementioned problems.The characteristics of the above-mentioned damper devices as well as the section size for structural beams and columns are considered as variables for development of the PSO-GSA optimization algorithm to minimize structural seismic response in terms of nodal displacement(in three directions) as well as plastic hinge formation in structural members simultaneously with the weight of the structure.After that,the optimization algorithm is implemented to identify the best position of the damper device in the structural frame to have the maximum effect and minimize the seismic structure response.To examine the performance of the proposed PSO-GSA optimization method,it has been applied to a three-story reinforced structure equipped with a seismic damper device.The results revealed that the method successfully optimized the earthquake energy dissipation systems and reduced the effects of earthquakes on structures,which significantly increase the building’s stability and safety during seismic excitation.The analysis results showed a reduction in the seismic response of the structure regarding the formation of plastic hinges in structural members as well as the displacement of each story to approximately 99.63%,60.5%,79.13% and 57.42% for the VSB device,RWD,NCSB device,and MAS device,respectively.This shows that using the PSO-GSA optimization algorithm and optimized damper devices in the structure resulted in no structural damage due to earthquake vibration.

Optimization of Thermal Aware VLSI Non-Slicing Floorplanning Using Hybrid Particle Swarm Optimization Algorithm-Harmony Search Algorithm

Floorplanning is a prominent area in the Very Large-Scale Integrated (VLSI) circuit design automation, because it influences the performance, size, yield and reliability of the VLSI chips. It is the process of estimating the positions and shapes of the modules. A high packing density, small feature size and high clock frequency make the Integrated Circuit (IC) to dissipate large amount of heat. So, in this paper, a methodology is presented to distribute the temperature of the module on the layout while simultaneously optimizing the total area and wirelength by using a hybrid Particle Swarm Optimization-Harmony Search (HPSOHS) algorithm. This hybrid algorithm employs diversification technique (PSO) to obtain global optima and intensification strategy (HS) to achieve the best solution at the local level and Modified Corner List algorithm (MCL) for floorplan representation. A thermal modelling tool called hotspot tool is integrated with the proposed algorithm to obtain the temperature at the block level. The proposed algorithm is illustrated using Microelectronics Centre of North Carolina (MCNC) benchmark circuits. The results obtained are compared with the solutions derived from other stochastic algorithms and the proposed algorithm provides better solution.

Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm

We present an improved hybrid genetic algorithm to solve the two-dimensional Eucli-dean traveling salesman problem (TSP), in which the crossover operator is enhanced with a local search. The proposed algorithm is expected to obtain higher quality solutions within a reasonable computational time for TSP by perfectly integrating GA and the local search. The elitist choice strategy, the local search crossover operator and the double-bridge random mutation are highlighted, to enhance the convergence and the possibility of escaping from the local optima. The experimental results illustrate that the novel hybrid genetic algorithm outperforms other genetic algorithms by providing higher accuracy and satisfactory efficiency in real optimization processing.

A new hybrid algorithm for global optimization and slope stability evaluation

A new hybrid optimization algorithm was presented by integrating the gravitational search algorithm(GSA)with the sequential quadratic programming(SQP),namely GSA-SQP,for solving global optimization problems and minimization of factor of safety in slope stability analysis.The new algorithm combines the global exploration ability of the GSA to converge rapidly to a near optimum solution.In addition,it uses the accurate local exploitation ability of the SQP to accelerate the search process and find an accurate solution.A set of five well-known benchmark optimization problems was used to validate the performance of the GSA-SQP as a global optimization algorithm and facilitate comparison with the classical GSA.In addition,the effectiveness of the proposed method for slope stability analysis was investigated using three case studies of slope stability problems from the literature.The factor of safety of earth slopes was evaluated using the Morgenstern–Price method.The numerical experiments demonstrate that the hybrid algorithm converges faster to a significantly more accurate final solution for a variety of benchmark test functions and slope stability problems.

An Evolutionary Algorithm with Multi-Local Search for the Resource-Constrained Project Scheduling Problem

This paper introduces a hybrid evolutionary algorithm for the resource-constrained project scheduling problem (RCPSP). Given an RCPSP instance, the algorithm identifies the problem structure and selects a suitable decoding scheme. Then a multi-pass biased sampling method followed up by a multi-local search is used to generate a diverse and good quality initial population. The population then evolves through modified order-based recombination and mutation operators to perform exploration for promising solutions within the entire region. Mutation is performed only if the current population has converged or the produced offspring by recombination operator is too similar to one of his parents. Finally the algorithm performs an intensified local search on the best solution found in the evolutionary stage. Computational experiments using standard instances indicate that the proposed algorithm works well in both computational time and solution quality.

混合遗传变邻域搜索算法求解柔性车间调度问题

针对考虑生产成本的柔性作业车间调度问题(flow job shop scheduling problem, FJSP),以完工时间与加工成本为优化指标,提出一种求解FJSP的混合遗传变邻域搜索算法。根据个体适应度对种群分割,结合自适应交叉概率改进子代种群产生方式;设计两种邻域结构增强算法的局部搜索能力;提出一种基于动态交叉变异概率的优化算法流程提高求解效率。运用提出的算法求解基准实例与实际问题测试,验证了算法的有效性。

面向多车场冷链物流配送的改进正余弦算法

以冷链物流为对象,研究了一类考虑多中心联合配送和硬时间窗约束的调度问题。基于问题描述建立了以最小化总成本为目标的数学模型。提出了改进正余弦算法(enhanced sine-cosine algorithm,ESCA)以获取当前问题的满意解。结合问题特征创建了融合构造式规则的编解码方法,并辅以个体评估方法实现模型与正余弦算法(sine-cosine algorithm,SCA)的适配。同时,将反向学习机制嵌入ESCA的初始化流程,旨在提升初始解的性能。在种群进化方面,构建了融合双种群机制、非线性参数调节和随机扰动的混合进化机制以平衡寻优过程的全局探索和局部挖掘行为,并通过离散邻域搜索方法避免搜索停滞。开展了案例研究和算法对比实验,结果验证了ESCA算法的良好性能。

基于改进粒子群算法的木材板材下料方法

木材板材在家具行业应用广泛,以绿色环保、节约能源为目的的木材板材优化下料已经成为研究的热点。木材板材下料优化问题属于二维矩形下料问题,是一种具有高度计算复杂性的问题。本研究主要针对单规格木材板材进行矩形零件下料问题,在木材板材长和宽都大于零件长和宽的情况下,通过建立二维下料的数学模型,采用标准粒子群算法、变邻域搜索算法、粒子群混合变邻域搜索算法分别进行求解,并以某企业的下料实例进行分析计算。首先,利用标准粒子群算法求解单规格板材下料问题;其次,利用变邻域搜索算法求解单规格板材下料问题。在获得局部最优解的基础上改变其邻域结构再进行局部搜索,找到另一个局部最优解,如此不断迭代,直到满足算法的终止条件,获得全局最优解;最后,利用粒子群变邻域搜索混合算法求解单规格板材下料问题。针对粒子群算法局部搜索能力较差、容易过早收敛的问题和具有较好包容性的特点,将变邻域搜索的思想融入粒子群算法中,使结果更加趋向全局最优。结果表明:粒子群变邻域搜索混合算法相比粒子群算法和变邻域算法效率都有显著提升,能显著提高该木材板材的利用率,增加企业经济效益。

混合白鲸优化算法求解柔性作业车间调度问题

针对柔性作业车间调度问题(flexible job-shop scheduling problem,FJSP),提出一种混合白鲸优化算法(hybrid beluga whale optimization,HBWO)对其求解,旨在最小最大化完工时间。采用既定策略改进标准白鲸优化算法(beluga whale optimization,BWO),加快其收敛速度;基于机器选择和工序排序问题设计双层编码方案,解决FJSP离散化问题;采用主动编码及种群初始化策略,提高求解质量;基于工序的开始和结束时间确定关键路径和关键块,注重各工序时间维度;引入贪心思想至基于关键路径的混合变邻域搜索策略中,加大勘测搜索空间及减少无效搜索;此外,引入遗传算子防止算法陷入局部最优;通过35个标准算例的仿真实验与分析,证明了算法在求解FJSP问题中具有有效性。

基于改进布谷鸟搜索算法的光伏最大功率点跟踪策略

实际工程中,光伏阵列在随机变化的环境中会出现局部遮光的情况,从而导致光伏阵列的功率-电压特性曲线会呈现多峰值状态,传统的最大功率点跟踪(maximum power point tracking, MPPT)算法易陷入局部最优解,追踪速度和精准度无法得到满足。针对这一问题,提出一种基于布谷鸟搜索算法(cuckoo search algorithm, CS)和电导增量法(conductivity increment method, CI)结合的光伏MPPT算法,在算法前期利用布谷鸟搜索算法将大步长和小步长交替使用使得全局搜索能力增强,找到全局最大功率点所处区域附近;在后期,采用步长小、控制精度高的CI进行局部寻优,快速准确地锁定到最大功率点。在MATLAB/Simulink中搭建仿真模型,并与原始布谷鸟搜索算法和粒子群优化(particle swam optimization, PSO)算法进行比较。仿真结果表明,将CS与CI结合的算法使得收敛速度更快,精度更高,稳定状态时功率曲线的波动更小。

果蔬采后分级和预冷车辆协同调度模型与算法

新兴的移动式分级、预冷技术应用于果蔬田间采后处理,有助于降低采后损耗,也催生了采后“最先一公里”冷链物流环节协同运作优化问题。以采后分级、预冷环节为例,综合考虑果蔬最佳预冷时间、先分级后预冷的服务顺序等特有协同情景,构建了移动式分级预冷资源协同调度优化模型。与现有模型不同,本研究考虑延迟预冷对果蔬新鲜度的特殊影响,设计了延迟预冷成本函数,在保障产品质量的同时最小化服务运作成本。设计混合遗传算法对模型进行求解,该算法融合了遗传算法与邻域搜索算法,增强混合算法的局部和全局搜索能力。其中,结合问题的双需求特点及关键协同约束,设计了基于双序列的解的表达方式、基于最佳插入策略的交叉算子以及基于三阶段邻域搜索的变异操作,以提高算法的收敛速度与求解质量。通过与标准遗传算法和变邻域搜索算法对比,验证了本文算法在求解大规模算例时可以更快收敛到更高质量的解。基于陕西省洛川县水蜜桃产业的分级预冷数据证明了模型的合理性。本研究有助于把协同运作优化思想引入果蔬采后“最先一公里”冷链物流环节,为降低我国果蔬采后损耗提供创新性解决思路。

基于CEEMDAN和改进的混合时间序列模型工作面涌水量预测研究

为提高采煤工作面涌水量预测准确度,收集大量工作面涌水量观测数据进行整理、统计、分析,将涌水量稳定性、周期性和季节性特征考虑在内,提出1种基于数据驱动的完全自适应模态分解算法(CEEMDAN)和改进的混合时间序列模型工作面涌水量预测方法。该方法利用CEEMDAN处理涌水量数据,构建麻雀搜索算法(SSA)优化的长短期记忆网络(LSTM)和自回归移动平均模型(ARIMA)并行级联而成的混合时间序列模型对工作面涌水量进行预测。研究结果表明:该模型预测结果与真实数据相差更小,平均绝对误差为6.36 m 3/h,均方根误差为10.6 m 3/h,模型拟合系数为0.95,更适用于工作面涌水量预测。研究结果可为矿井工作面涌水量预测及防控提供参考。

基于差分进化粒子群混合算法的多无人机协同区域搜索策略

为提高无人机群在未知环境中的区域搜索效率,提出一种多无人机协同区域搜索策略。首先,根据区域搜索任务需求,建立包含区域覆盖率、区域不确定度、目标存在概率三种属性的区域信息地图;其次,以最大化搜索效率、同时最小化无人机搜索过程中的能耗为目标,建立无人机区域搜索滚动时域优化目标函数,指导无人机在线决策搜索路线;然后针对传统群智能优化算法易陷入局部最优的缺陷,设计差分进化粒子群混合算法在线求解该多目标优化问题,提高算法的寻优性能,从而提高无人机的搜索效率。最后,通过数值仿真实验,对所提算法进行验证,仿真结果表明,文中设计的基于差分进化粒子群混合算法的多无人机协同区域搜索策略与传统的群智能优化算法相比具有更高的区域搜索效率。

基于混合A^(*)搜索和贝塞尔曲线的船舶进港和靠泊路径规划算法

[目的]针对欠驱动无人艇自动进港和靠泊问题,提出一种基于混合A^(*)搜索和贝塞尔曲线的路径规划算法。[方法]该方法通过混合A^(*)搜索在非结构化环境下快速搜索出一条满足无人艇非完整性约束且无碰撞风险的轨迹。在此基础上,基于广义沃罗诺伊图提出曲线优化算法,使得搜索算法得到的轨迹更加平滑且远离环境障碍物,从而引导无人艇在受限水域完成进港任务。同时,针对“最后一公里”靠泊问题,引入四阶贝塞尔曲线,用于生成靠泊路径从而引导船体平稳且精准入泊。[结果]仿真和外场试验结果表明,无人艇能够实现自主避障且精准驶入泊位,靠泊精度指标均小于1.0。[结论]所提路径规划算法能确保欠驱动无人艇实现进港和靠泊任务,可为智能船舶的进一步发展提供思路。

基于混合和谐搜索算法的自压滴灌田间管网多目标优化设计

为了综合考虑管网投资和水压分布,合理进行管网布置和管径选择,以满足管网的经济性和可靠性,使自压滴灌管网系统达到投资最低和灌水均匀度最高的目的。以管网投资最低(管网经济性)和节点富余水头均值最小(管网可靠性)为目标,建立了自压滴灌“梳子”形和“丰字”形田间管网系统的多目标优化数学模型,提出了混合和谐搜索算法求解多目标优化模型的方法和步骤。以新疆某自压滴灌工程为例,采用该方法对其田间管网系统进行优化,优化方案的管网总投资为47.63万元,与原设计方案相比降低了9.86%;管网节点富余水头均值为8.87 m,与原设计方案相比降低了28.37%。该优化设计方法得到的优化结果,不仅节省投资明显,而且节点富余水头均值显著减小,说明管网系统的压力偏差小,灌水的均匀度显著提高。优化结果表明,混合和谐搜索算法收敛速度快,计算精度高,在自压滴灌管网的多目标优化设计中具有很好的应用价值。

作业车间调度的多工序精确联动邻域结构混合进化算法

针对作业车间调度问题,以最小化最大完工时间为优化目标,提出一种基于多工序精确联动邻域结构的混合进化算法。从理论上给出了关键块中工序无效移动的判定条件,据此设计了3对工序精确联动的邻域结构。为避免算法过早收敛,引入基于邻域惩罚的交叉父本匹配选择算子与基于动态惩罚阈值的种群更新策略。通过与其他先进算法在车间调度问题基准算例上进行对比实验,验证了所提算法的有效性与稳定性。

改进秃鹰搜索和K均值混合迭代的点云简化算法

针对激光雷达的固有特性和复杂环境易造成点云噪声和冗余点云,以及传统点云简化算法忽略了点云固有特征等问题,提出了一种基于改进秃鹰搜索和K均值聚类(KMC)混合迭代的点云简化算法(IBESSA)。首先,通过秃鹰搜索(BES)算法迭代阶段的竞争融合(CFBES),提高其收敛速度和优化精度;其次,通过CFBES和KMC算法的混合迭代,实现了点云数据的聚类;然后,在k近邻(k-NN)实现点云簇密度估计的基础上,结合香农熵实现点云信息量化;最后,删除信息量化值小于阈值的聚类簇,完成点云数据简化。使用UCI国际标准数据集和斯坦福点云数据集分别对CFBES-KMC算法的聚类效果及点云的简化效果进行验证,结果表明:与改进飞蛾扑火的K均值交叉迭代、K-means++、模糊C均值聚类算法的聚类效果相比,CFBES-KMC算法的聚类准确率分别提高了1.02%、12.31%、14.72%;在斯坦福点云数据集上,IBESSA算法在有效滤除冗余点云的基础上保留了原本点云的细节和形状特征,不失为一种高效的点云简化算法。

基于VMD-SSA-HKELM的短期光伏功率预测

为提高光伏功率的短期预测精度,提出一种变分模态分解(VMD)与麻雀搜索算法(SSA)优化混合核极限学习机(HKELM)相结合的短期光伏发电功率预测模型。运用皮尔逊相关系数(PCC)选取与光伏发电功率相关性较强的气象因素作为预测模型的输入变量;以平方欧氏距离作为衡量样本相似性的依据,筛选出不同天气类型下的最优训练样本。为降低数据的非平稳性,利用VMD将原始光伏功率数据分解为一系列不同带宽的模态分量,对各模态分量分别建立HKELM模型,通过引入SSA算法对HKELM模型进行参数寻优。将各模态分量的预测结果进行求和重构,得到光伏功率预测结果。仿真结果表明,相比于反向传播神经网络(BPNN)、极限学习机(ELM)、核极限学习机(VMDKELM)和混合核极限学习机(VMD-HKELM)模型,VMD-SSA-HKELM模型具有更高的预测精度,验证了本文模型的精确性和有效性。

基于灰数描述的不确定工时作业车间E/T调度优化

针对不确定加工时间的作业车间调度问题,考虑每个工件的交货期窗口,旨在最小化工件提前/拖期成本和机器空闲成本。分别采用基本遗传算法和混合遗传算法进行求解,并比较两种算法的求解质量。通过灰色理论和模糊数理论对不确定加工时间分别建立调度模型,分析两种模型的优化程度和稳定性。结果表明,与基本遗传算法相比,引入按指定邻域结构进行局部搜索的混合遗传算法具有更好收敛能力;与模糊数方式相比,采用灰色理论能够更好地描述不确定加工时间,且在求解过程中也具有更好的适应性和稳定性。