Optimizing Grey Wolf Optimization: A Novel Agents’ Positions Updating Technique for Enhanced Efficiency and Performance

Grey Wolf Optimization (GWO) is a nature-inspired metaheuristic algorithm that has gained popularity for solving optimization problems. In GWO, the success of the algorithm heavily relies on the efficient updating of the agents’ positions relative to the leader wolves. In this paper, we provide a brief overview of the Grey Wolf Optimization technique and its significance in solving complex optimization problems. Building upon the foundation of GWO, we introduce a novel technique for updating agents’ positions, which aims to enhance the algorithm’s effectiveness and efficiency. To evaluate the performance of our proposed approach, we conduct comprehensive experiments and compare the results with the original Grey Wolf Optimization technique. Our comparative analysis demonstrates that the proposed technique achieves superior optimization outcomes. These findings underscore the potential of our approach in addressing optimization challenges effectively and efficiently, making it a valuable contribution to the field of optimization algorithms.

VGWO: Variant Grey Wolf Optimizer with High Accuracy and Low Time Complexity

The grey wolf optimizer(GWO)is a swarm-based intelligence optimization algorithm by simulating the steps of searching,encircling,and attacking prey in the process of wolf hunting.Along with its advantages of simple principle and few parameters setting,GWO bears drawbacks such as low solution accuracy and slow convergence speed.A few recent advanced GWOs are proposed to try to overcome these disadvantages.However,they are either difficult to apply to large-scale problems due to high time complexity or easily lead to early convergence.To solve the abovementioned issues,a high-accuracy variable grey wolf optimizer(VGWO)with low time complexity is proposed in this study.VGWO first uses the symmetrical wolf strategy to generate an initial population of individuals to lay the foundation for the global seek of the algorithm,and then inspired by the simulated annealing algorithm and the differential evolution algorithm,a mutation operation for generating a new mutant individual is performed on three wolves which are randomly selected in the current wolf individuals while after each iteration.A vectorized Manhattan distance calculation method is specifically designed to evaluate the probability of selecting the mutant individual based on its status in the current wolf population for the purpose of dynamically balancing global search and fast convergence capability of VGWO.A series of experiments are conducted on 19 benchmark functions from CEC2014 and CEC2020 and three real-world engineering cases.For 19 benchmark functions,VGWO’s optimization results place first in 80%of comparisons to the state-of-art GWOs and the CEC2020 competition winner.A further evaluation based on the Friedman test,VGWO also outperforms all other algorithms statistically in terms of robustness with a better average ranking value.

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.

Improved algorithms to plan missions for agile earth observation satellites

This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.

Multi-objective Trajectory Planning Method based on the Improved Elitist Non-dominated Sorting Genetic Algorithm

Robot manipulators perform a point-point task under kinematic and dynamic constraints.Due to multi-degreeof-freedom coupling characteristics,it is difficult to find a better desired trajectory.In this paper,a multi-objective trajectory planning approach based on an improved elitist non-dominated sorting genetic algorithm(INSGA-II)is proposed.Trajectory function is planned with a new composite polynomial that by combining of quintic polynomials with cubic Bezier curves.Then,an INSGA-II,by introducing three genetic operators:ranking group selection(RGS),direction-based crossover(DBX)and adaptive precision-controllable mutation(APCM),is developed to optimize travelling time and torque fluctuation.Inverted generational distance,hypervolume and optimizer overhead are selected to evaluate the convergence,diversity and computational effort of algorithms.The optimal solution is determined via fuzzy comprehensive evaluation to obtain the optimal trajectory.Taking a serial-parallel hybrid manipulator as instance,the velocity and acceleration profiles obtained using this composite polynomial are compared with those obtained using a quintic B-spline method.The effectiveness and practicability of the proposed method are verified by simulation results.This research proposes a trajectory optimization method which can offer a better solution with efficiency and stability for a point-to-point task of robot manipulators.

Grey Wolf Optimizer to Real Power Dispatch with Non-Linear Constraints

A new and efficient Grey Wolf Optimization(GWO)algorithm is implemented to solve real power economic dispatch(RPED)problems in this paper.The nonlinear RPED problem is one the most important and fundamental optimization problem which reduces the total cost in generating real power without violating the constraints.Conventional methods can solve the ELD problem with good solution quality with assumptions assigned to fuel cost curves without which these methods lead to suboptimal or infeasible solutions.The behavior of grey wolves which is mimicked in the GWO algorithm are leadership hierarchy and hunting mechanism.The leadership hierarchy is simulated using four types of grey wolves.In addition,searching,encircling and attacking of prey are the social behaviors implemented in the hunting mechanism.The GWO algorithm has been applied to solve convex RPED problems considering the all possible constraints.The results obtained from GWO algorithm are compared with other state-ofthe-art algorithms available in the recent literatures.It is found that the GWO algorithm is able to provide better solution quality in terms of cost,convergence and robustness for the considered ELD problems.

Smart Fraud Detection in E-Transactions Using Synthetic Minority Oversampling and Binary Harris Hawks Optimization

Fraud Transactions are haunting the economy of many individuals with several factors across the globe.This research focuses on developing a mechanism by integrating various optimized machine-learning algorithms to ensure the security and integrity of digital transactions.This research proposes a novel methodology through three stages.Firstly,Synthetic Minority Oversampling Technique(SMOTE)is applied to get balanced data.Secondly,SMOTE is fed to the nature-inspired Meta Heuristic(MH)algorithm,namely Binary Harris Hawks Optimization(BinHHO),Binary Aquila Optimization(BAO),and Binary Grey Wolf Optimization(BGWO),for feature selection.BinHHO has performed well when compared with the other two.Thirdly,features from BinHHO are fed to the supervised learning algorithms to classify the transactions such as fraud and non-fraud.The efficiency of BinHHO is analyzed with other popular MH algorithms.The BinHHO has achieved the highest accuracy of 99.95%and demonstrates amore significant positive effect on the performance of the proposed model.

Hybridized Intelligent Neural Network Optimization Model for Forecasting Prices of Rubber in Malaysia

Rubber producers,consumers,traders,and those who are involved in the rubber industry face major risks of rubber price fluctuations.As a result,decision-makers are required to make an accurate estimation of the price of rubber.This paper aims to propose hybrid intelligent models,which can be utilized to forecast the price of rubber in Malaysia by employing monthly Malaysia’s rubber pricing data,spanning from January 2016 to March 2021.The projected hybrid model consists of different algorithms with the symbolic Radial Basis Functions Neural Network k-Satisfiability Logic Mining(RBFNN-kSAT).These algorithms,including Grey Wolf Optimization Algorithm,Artificial Bee Colony Algorithm,and Particle Swarm Optimization Algorithm were utilized in the forecasting data analysis.Several factors,which affect the monthly price of rubber,such as rubber production,total exports of rubber,total imports of rubber,stocks of rubber,currency exchange rate,and crude oil prices were also considered in the analysis.To evaluate the results of the introduced model,a comparison has been conducted for each model to identify the most optimum model for forecasting the price of rubber.The findings showed that GWO with RBFNN-kSAT represents the most accurate and efficient model compared with ABC with RBFNNkSAT and PSO with RBFNN-kSAT in forecasting the price of rubber.The GWO with RBFNN-kSAT obtained the greatest average accuracy(92%),with a better correlation coefficient R=0.983871 than ABC with RBFNN-kSAT and PSO with RBFNN-kSAT.Furthermore,the empirical results of this study provided several directions for policymakers to make the right decision in terms of devising proper measures in the industry to address frequent price changes so that the Malaysian rubber industry maintains dominance in the international markets.

采煤机滚筒工作性能优化研究

在实际生产中,截割破碎过程是多作用耦合的结果,离散元法(DEM)与多体动力学(MBD)双向耦合技术可实现煤机设备与煤壁的信息交互,符合实际生产情况,具有较大的优越性。为提高采煤机滚筒的工作性能,基于DEM−MBD双向耦合机理,结合力学性能试验和模拟试验得到实际工况参数,采用仿真软件EDEM和RecurDyn建立了采煤机滚筒截割煤壁的双向耦合模型,对仿真过程中滚筒所受的转矩和截割力进行分析,证明耦合效果和截割效果较好。设计了单因素试验和正交试验,分析了滚筒运行参数对工作性能的影响规律,并利用SPSS软件得到滚筒转速、截割深度、牵引速度对截割比能耗、装煤率、载荷波动系数的影响程度,通过现场试验验证了模型的可行性。构建了以滚筒转速、截割深度、牵引速度为决策变量,以截割比能耗、装煤率和载荷波动系数为目标的多目标优化模型,利用改进多目标灰狼(MOGWO)算法和优劣解距离法(TOPSIS)对模型进行求解,得出当滚筒转速为31.12 r/min、截割深度为639.4 mm、牵引速度为5.58 m/min时,采煤机滚筒的工作性能最优,此时截割比能耗为0.4677 kW·h/^(3),装煤率为43.01%,载荷波动系数为0.3278。

基于改进灰狼算法的微网多主体主从博弈策略

为平衡包含电、热两种能源形式的微网系统内各参与者间的利益关系,通过改进灰狼算法提出了一种微网能量管理模型。首先,在充分分析微网结构及其各主体功能的基础上,为综合考虑源-网-荷的决策能力,将主从博弈方法应用于产能商、微网运营商、负荷聚合商之间的互动,建立一主多从的微网能量管理数学模型;其次,针对博弈上层模型高维、非线性的特点,在传统灰狼算法基础上,利用Tent映射对种群进行初始化、采用非线性收敛因子平衡种群搜索能力、利用莱维飞行策略降低陷入局部最优的风险。在模型求解时,博弈上层采用改进灰狼算法,下层采用二次规划方法,二者结合以探讨使各主体利益最大的策略;最后,通过算例进行验证,结果表明:本文算法更加高效,所提模型在提高参与者收益,平滑用户负荷分布方面更加优越。

考虑三级调度网络的应急物资多资源动态调度问题研究

为解决重大公共卫生事件发生后的物资调度问题,运用SEIR模型预测需求点的各类受灾人群,构建需求预测模型;以综合物资分配满意度最大、综合运输时间满意度最大和综合救援成本最小为目标,采用多供应点、多配送中心、多需求点的三级调度网络,实现多周期、多资源的动态调度;引入混沌反向学习、非线性收敛因子、随机差分变异和贪婪选择策略改进灰狼优化算法,并对模型进行求解。结果表明,该模型可有效平衡物资调度的满意度与经济性,改进灰狼优化算法可得到更优越的调度方案,解决灾后多周期应急物资调度问题。

改进灰狼算法优化GBDT在PM_(2.5)预测中的应用

针对灰狼算法易陷入局部最优解和全局搜索能力不足的问题,通过霍尔顿序列(Halton Sequence)搜索算法初始化狼群位置,避免灰狼算法陷入局部最优解和重复运算;引入莱维飞行和随机游动策略对灰狼算法的寻优过程进行优化,以增加算法的全局搜索能力;利用粒子群算法模拟灰狼种群得出的最佳适应度以用于惩罚项改进灰狼算法中的头狼更新策略。使用改进算法优化的梯度提升树(Gradient Boosting Decision Trees,GBDT)模型对北京市大气污染物监测数据中PM_(2.5)质量浓度进行预测,采用3种评估函数对各模型以及混合模型预测效果得分进行评估。结果显示,本文改进的灰狼算法对梯度提升树的优化效果优于其他算法,均方根误差E RMS为6.65μg/m^(3),平均绝对值误差E MA为3.20μg/m^(3),拟合优度(R^(2))为99%,比传统灰狼算法优化结果的均方根误差减少了19.19μg/m^(3),平均绝对值误差降低了10.03μg/m^(3),拟合优度增加了9百分点;与霍尔顿序列和莱维飞行改进的(Levy Flight-Halton Sequence,LHGWO)相比,改进的灰狼算法预测得分的均方根误差降低了10.39μg/m^(3),平均绝对值误差减小了6.71μg/m^(3),拟合优度提高了5百分点。研究表明了预测模型优化的有效性,为未来城市改善空气质量提供了科学依据和技术支持。

含不相关机的多目标混合流水车间调度

考虑不相关机和传送等因素的多阶段混合流水车间问题,以最小化最大完工时间和总能耗为优化目标建立整数规划模型。针对该问题,提出一种多目标离散灰狼优化算法来求解。设计基于机器分配码和速度选择码的编码方式和基于最短处理时间原则的解码方案;采用反向学习策略改进初始灰狼种群质量;将基于多点变异的自走模式和基于均匀两点交叉与多点交叉的跟随模式结合构成搜索模式以协调开发和搜索能力;引入精英保留策略确保优良个体不丢失。通过一系列的仿真实验验证了该算法的有效性。

局部阴影下基于GWO-P&O混合算法的光伏最大功率点跟踪

针对局部遮阴环境下传统灰狼优化(Gray wolf optimization,GWO)算法在跟踪最大功率点时P-U特性曲线出现多峰值、后期收敛速度慢、稳态精度低等问题,结合灰狼优化算法和扰动观察法(Perturbation and observation,P&O)各自的优势,提出了基于GWO-P&O的混合优化最大功率点跟踪(Maximum power point tracking,MPPT)算法。首先,采用灰狼优化算法逐渐向光伏的全局最大功率点靠近。其次,在灰狼优化算法收敛后期引入P&O法,既保持了灰狼优化算法较高的稳态精度,又能以较快速度寻找到局部最大功率点。最后,在不同环境工况下,将所提出的GWO-P&O方法与传统GWO算法进行对比。结果表明,改进的GWO-P&O算法在保证良好稳态性能的同时,一定程度上提高了GWO算法后期跟踪最大功率时的收敛速度。

突发自然灾害下的两阶段多目标应急物资中心选址问题研究

针对突发灾害情况下需求不确定的选址问题,构建最小化经济成本和最大化满意度的应急物资中心选址模型。首先,将选址问题划分为初期和后期的两阶段问题;其次,对物资需求量进行模糊需求预测,并使用可信性模糊机会约束规划将其转化为确定型约束;最后,设计改进灰狼优化(Improved Grey Wolf Optimization,IGWO)算法求解问题。IGWO算法采用佳点集初始化种群,对收敛因子进行余弦规律的非线性变化,并在粒子群优化(Particle Swarm Optimization,PSO)算法个体记忆的启发下,设计个体位置更新公式。在用10个标准函数验证IGWO有效性的基础上,通过湖北省新型冠状病毒应急物资中心选址案例分析,表明IGWO算法能有效求解多目标选址问题,在提高满意度的基础上降低经济成本,且多阶段模型在平衡满意度和经济成本方面结果更优。

基于EEMD-IGWO-SVM的电机轴承故障诊断

针对电机轴承易发生损坏、传统诊断方法耗时长且准确度低等问题,提出一种基于改进灰狼优化算法(IGWO)优化支持向量机(SVM)的电机轴承故障诊断方法。对电机振动数据进行集成经验模态分解(EEMD),提取出IMF能量矩作为特征向量,并结合IGWO-SVM分类器,构造电机轴承故障检测模型。在模型引入改进Tent混沌映射、非线性收敛因子、动态权重策略,得到改进的分类算法,该算法可以快速精准地寻找SVM的最优惩罚参数C和核参数γ。对电机轴承振动数据进行仿真实验,诊断结果表明该轴承故障方法平均准确率高达99.4%。最后通过实验验证提出的诊断方法具有良好的算法稳定性和抗噪性能,可有效提高故障诊断精度。

基于改进秃鹰优化算法的海上混合光伏波浪能转换器阵列优化

近年来,海上能源发电技术备受瞩目,一种新兴趋势是将波浪能转换器(wave energy converter,WEC)与海上光伏(offshore floating photovoltaic,OFPV)相结合,形成混合光伏-波浪能转换器系统(hybrid PV-wave energy converter,HPV-WEC)。HPV-WEC具有提高海上空间利用率,降低成本以及实现功率稳定输出等优势。为了充分利用HPV-WEC系统之间的协同效应,在不增加新设备的情况下提高能源产量,提出了一种基于改进秃鹰优化算法(improved bald eagle search algorithm,IBES)的HPV-WEC阵列布局优化策略。IBES结合了莱维飞行策略和模拟退火(simulated annealing,SA)机制,以平衡局部开发和全局探索之间的关系。为了评估IBES在优化HPV-WEC阵列方面的有效性,进行了5个浮标和8个浮标规模的阵列优化,并将IBES与其他5种算法进行了比较。实验结果表明,IBES表现出实现最大总功率输出并具有显著的收敛特性。

改进时间卷积网络下局域网异常状态预测方法

局域网异常会阻碍网络运行速度,严重时会导致网络瘫痪。为了精准预测局域网是否存在异常,提出一种基于改进时间卷积网络的局域网异常预测方法。组建变分模态分解(Variational Mode Decomposition,VMD)高频噪声分量判定标准,剔除高频分量,将剩余VMD分量叠加重构,去除局域网数据中的噪声。建立局域网异常预测模型,将去噪后的局域网数据特征数值规约到和灰度图像像素值对应的范围内,形成局域网灰度图,并将其输入到改进时间卷积网络结构中训练和模型调优,完成局域网异常预测。经实验测试证明,所提方法可以获取高精度和高效率的局域网异常预测结果,在局域网异常预测领域具有广阔的发展前景。

基于改进鲸鱼算法的混合储能系统容量优化配置

针对微电网中使用可再生能源的高随机性和间歇性等特征,提出了一种混合储能系统容量优化配置方法。该方法以混合储能系统成本最低、平抑可再生能源功率波动效果最优与电网联络线利用率最高为目标,通过建立混合储能容量优化配置模型并采用改进鲸鱼优化算法对所建立的模型进行求解得到最优混合储能系统容量优化配置。最终对比传统鲸鱼优化算法和传统粒子群算法来验证改进鲸鱼算法可以更合理地配置混合储能系统的容量,使可再生能源功率波动的平抑效果提高,同时也使微网联络线利用率变高,保证微电网可靠、经济地运行,进而实现资源的合理利用。

Short-term wind power prediction using an improved grey wolf optimization algorithm with back-propagation neural network

A short-term wind power prediction method is proposed in this paper with experimental results obtained from a wind farm located in Northeast China.In order to improve the accuracy of the prediction method using a traditional back-propagation(BP)neural network algorithm,the improved grey wolf optimization(IGWO)algorithm has been adopted to optimize its parameters.The performance of the proposed method has been evaluated by experiments.First,the features of the wind farm are described to show the fundamental information of the experiments.A single turbine with rated power of 1500 kW and power generation coefficient of 2.74 in the wind farm was introduced to show the technical details of the turbines.Original wind power data of the whole farm were preprocessed by using the quartile method to remove the abnormal data points.Then,the retained wind power data were predicted and analysed by using the proposed IGWO-BP algorithm.Analysis of the results proves the practicability and efficiency of the prediction model.Results show that the average accuracy of prediction is~11%greater than the traditional BP method.In this way,the proposed wind power prediction method can be adopted to improve the accuracy of prediction and to ensure the effective utilization of wind energy.