The flying foxes optimization(FFO)algorithm,as a newly introduced metaheuristic algorithm,is inspired by the survival tactics of flying foxes in heat wave environments.FFO preferentially selects the best-performing in...The flying foxes optimization(FFO)algorithm,as a newly introduced metaheuristic algorithm,is inspired by the survival tactics of flying foxes in heat wave environments.FFO preferentially selects the best-performing individuals.This tendency will cause the newly generated solution to remain closely tied to the candidate optimal in the search area.To address this issue,the paper introduces an opposition-based learning-based search mechanism for FFO algorithm(IFFO).Firstly,this paper introduces niching techniques to improve the survival list method,which not only focuses on the adaptability of individuals but also considers the population’s crowding degree to enhance the global search capability.Secondly,an initialization strategy of opposition-based learning is used to perturb the initial population and elevate its quality.Finally,to verify the superiority of the improved search mechanism,IFFO,FFO and the cutting-edge metaheuristic algorithms are compared and analyzed using a set of test functions.The results prove that compared with other algorithms,IFFO is characterized by its rapid convergence,precise results and robust stability.展开更多
Due to the development of digital transformation,intelligent algorithms are getting more and more attention.The whale optimization algorithm(WOA)is one of swarm intelligence optimization algorithms and is widely used ...Due to the development of digital transformation,intelligent algorithms are getting more and more attention.The whale optimization algorithm(WOA)is one of swarm intelligence optimization algorithms and is widely used to solve practical engineering optimization problems.However,with the increased dimensions,higher requirements are put forward for algorithm performance.The double population whale optimization algorithm with distributed collaboration and reverse learning ability(DCRWOA)is proposed to solve the slow convergence speed and unstable search accuracy of the WOA algorithm in optimization problems.In the DCRWOA algorithm,the novel double population search strategy is constructed.Meanwhile,the reverse learning strategy is adopted in the population search process to help individuals quickly jump out of the non-ideal search area.Numerical experi-ments are carried out using standard test functions with different dimensions(10,50,100,200).The optimization case of shield construction parameters is also used to test the practical application performance of the proposed algo-rithm.The results show that the DCRWOA algorithm has higher optimization accuracy and stability,and the convergence speed is significantly improved.Therefore,the proposed DCRWOA algorithm provides a better method for solving practical optimization problems.展开更多
Chimp Optimization Algorithm(ChOA)is one of the most efficient recent optimization algorithms,which proved its ability to deal with different problems in various do-mains.However,ChOA suffers from the weakness of the ...Chimp Optimization Algorithm(ChOA)is one of the most efficient recent optimization algorithms,which proved its ability to deal with different problems in various do-mains.However,ChOA suffers from the weakness of the local search technique which leads to a loss of diversity,getting stuck in a local minimum,and procuring premature convergence.In response to these defects,this paper proposes an improved ChOA algorithm based on using Opposition-based learning(OBL)to enhance the choice of better solutions,written as OChOA.Then,utilizing Reinforcement Learning(RL)to improve the local research technique of OChOA,called RLOChOA.This way effectively avoids the algorithm falling into local optimum.The performance of the proposed RLOChOA algorithm is evaluated using the Friedman rank test on a set of CEC 2015 and CEC 2017 benchmark functions problems and a set of CEC 2011 real-world problems.Numerical results and statistical experiments show that RLOChOA provides better solution quality,convergence accuracy and stability compared with other state-of-the-art algorithms.展开更多
Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characte...Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.展开更多
The widespread adoption of cloud computing has underscored the critical importance of efficient resource allocation and management, particularly in task scheduling, which involves assigning tasks to computing resource...The widespread adoption of cloud computing has underscored the critical importance of efficient resource allocation and management, particularly in task scheduling, which involves assigning tasks to computing resources for optimized resource utilization. Several meta-heuristic algorithms have shown effectiveness in task scheduling, among which the relatively recent Willow Catkin Optimization (WCO) algorithm has demonstrated potential, albeit with apparent needs for enhanced global search capability and convergence speed. To address these limitations of WCO in cloud computing task scheduling, this paper introduces an improved version termed the Advanced Willow Catkin Optimization (AWCO) algorithm. AWCO enhances the algorithm’s performance by augmenting its global search capability through a quasi-opposition-based learning strategy and accelerating its convergence speed via sinusoidal mapping. A comprehensive evaluation utilizing the CEC2014 benchmark suite, comprising 30 test functions, demonstrates that AWCO achieves superior optimization outcomes, surpassing conventional WCO and a range of established meta-heuristics. The proposed algorithm also considers trade-offs among the cost, makespan, and load balancing objectives. Experimental results of AWCO are compared with those obtained using the other meta-heuristics, illustrating that the proposed algorithm provides superior performance in task scheduling. The method offers a robust foundation for enhancing the utilization of cloud computing resources in the domain of task scheduling within a cloud computing environment.展开更多
Whale optimization algorithm(WOA)tends to fall into the local optimum and fails to converge quickly in solving complex problems.To address the shortcomings,an improved WOA(QGBWOA)is proposed in this work.First,quasi-o...Whale optimization algorithm(WOA)tends to fall into the local optimum and fails to converge quickly in solving complex problems.To address the shortcomings,an improved WOA(QGBWOA)is proposed in this work.First,quasi-opposition-based learning is introduced to enhance the ability of WOA to search for optimal solutions.Second,a Gaussian barebone mechanism is embedded to promote diversity and expand the scope of the solution space in WOA.To verify the advantages of QGBWOA,comparison experiments between QGBWOA and its comparison peers were carried out on CEC 2014 with dimensions 10,30,50,and 100 and on CEC 2020 test with dimension 30.Furthermore,the performance results were tested using Wilcoxon signed-rank(WS),Friedman test,and post hoc statistical tests for statistical analysis.Convergence accuracy and speed are remarkably improved,as shown by experimental results.Finally,feature selection and multi-threshold image segmentation applications are demonstrated to validate the ability of QGBWOA to solve complex real-world problems.QGBWOA proves its superiority over compared algorithms in feature selection and multi-threshold image segmentation by performing several evaluation metrics.展开更多
The original whale optimization algorithm(WOA)has a low initial population quality and tends to converge to local optimal solutions.To address these challenges,this paper introduces an improved whale optimization algo...The original whale optimization algorithm(WOA)has a low initial population quality and tends to converge to local optimal solutions.To address these challenges,this paper introduces an improved whale optimization algorithm called OLCHWOA,incorporating a chaos mechanism and an opposition-based learning strategy.This algorithm introduces chaotic initialization and opposition-based initialization operators during the population initialization phase,thereby enhancing the quality of the initial whale population.Additionally,including an elite opposition-based learning operator significantly improves the algorithm’s global search capabilities during iterations.The work and contributions of this paper are primarily reflected in two aspects.Firstly,an improved whale algorithm with enhanced development capabilities and a wide range of application scenarios is proposed.Secondly,the proposed OLCHWOA is used to optimize the hyperparameters of the Long Short-Term Memory(LSTM)networks.Subsequently,a prediction model for Realized Volatility(RV)based on OLCHWOA-LSTM is proposed to optimize hyperparameters automatically.To evaluate the performance of OLCHWOA,a series of comparative experiments were conducted using a variety of advanced algorithms.These experiments included 38 standard test functions from CEC2013 and CEC2019 and three constrained engineering design problems.The experimental results show that OLCHWOA ranks first in accuracy and stability under the same maximum fitness function calls budget.Additionally,the China Securities Index 300(CSI 300)dataset is used to evaluate the effectiveness of the proposed OLCHWOA-LSTM model in predicting RV.The comparison results with the other eight models show that the proposed model has the highest accuracy and goodness of fit in predicting RV.This further confirms that OLCHWOA effectively addresses real-world optimization problems.展开更多
Pavement crack detection plays a crucial role in ensuring road safety and reducing maintenance expenses.Recent advancements in deep learning(DL)techniques have shown promising results in detecting pavement cracks;howe...Pavement crack detection plays a crucial role in ensuring road safety and reducing maintenance expenses.Recent advancements in deep learning(DL)techniques have shown promising results in detecting pavement cracks;however,the selection of relevant features for classification remains challenging.In this study,we propose a new approach for pavement crack detection that integrates deep learning for feature extraction,the whale optimization algorithm(WOA)for feature selection,and random forest(RF)for classification.The performance of the models was evaluated using accuracy,recall,precision,F1 score,and area under the receiver operating characteristic curve(AUC).Our findings reveal that Model 2,which incorporates RF into the ResNet-18 architecture,outperforms baseline Model 1 across all evaluation metrics.Nevertheless,our proposed model,which combines ResNet-18 with both WOA and RF,achieves significantly higher accuracy,recall,precision,and F1 score compared to the other two models.These results underscore the effectiveness of integrating RF and WOA into ResNet-18 for pavement crack detection applications.We applied the proposed approach to a dataset of pavement images,achieving an accuracy of 97.16%and an AUC of 0.984.Our results demonstrate that the proposed approach surpasses existing methods for pavement crack detection,offering a promising solution for the automatic identification of pavement cracks.By leveraging this approach,potential safety hazards can be identified more effectively,enabling timely repairs and maintenance measures.Lastly,the findings of this study also emphasize the potential of integrating RF and WOA with deep learning for pavement crack detection,providing road authorities with the necessary tools to make informed decisions regarding road infrastructure maintenance.展开更多
Extreme Learning Machine(ELM)is popular in batch learning,sequential learning,and progressive learning,due to its speed,easy integration,and generalization ability.While,Traditional ELM cannot train massive data rapid...Extreme Learning Machine(ELM)is popular in batch learning,sequential learning,and progressive learning,due to its speed,easy integration,and generalization ability.While,Traditional ELM cannot train massive data rapidly and efficiently due to its memory residence,high time and space complexity.In ELM,the hidden layer typically necessitates a huge number of nodes.Furthermore,there is no certainty that the arrangement of weights and biases within the hidden layer is optimal.To solve this problem,the traditional ELM has been hybridized with swarm intelligence optimization techniques.This paper displays five proposed hybrid Algorithms“Salp Swarm Algorithm(SSA-ELM),Grasshopper Algorithm(GOA-ELM),Grey Wolf Algorithm(GWO-ELM),Whale optimizationAlgorithm(WOA-ELM)andMoth Flame Optimization(MFO-ELM)”.These five optimizers are hybridized with standard ELM methodology for resolving the tumor type classification using gene expression data.The proposed models applied to the predication of electricity loading data,that describes the energy use of a single residence over a fouryear period.In the hidden layer,Swarm algorithms are used to pick a smaller number of nodes to speed up the execution of ELM.The best weights and preferences were calculated by these algorithms for the hidden layer.Experimental results demonstrated that the proposed MFO-ELM achieved 98.13%accuracy and this is the highest model in accuracy in tumor type classification gene expression data.While in predication,the proposed GOA-ELM achieved 0.397which is least RMSE compared to the other models.展开更多
The purpose of community detection in complex networks is to identify the structural location of nodes. Complex network methods are usually graphical, with graph nodes representing objects and edges representing conne...The purpose of community detection in complex networks is to identify the structural location of nodes. Complex network methods are usually graphical, with graph nodes representing objects and edges representing connections between things. Communities are node clusters with many internal links but minimal intergroup connections. Although community detection has attracted much attention in social media research, most face functional weaknesses because the structure of society is unclear or the characteristics of nodes in society are not the same. Also, many existing algorithms have complex and costly calculations. This paper proposes different Harris Hawk Optimization (HHO) algorithm methods (such as Improved HHO Opposition-Based Learning(OBL) (IHHOOBL), Improved HHO Lévy Flight (IHHOLF), and Improved HHO Chaotic Map (IHHOCM)) were designed to balance exploitation and exploration in this algorithm for community detection in the social network. The proposed methods are evaluated on 12 different datasets based on NMI and modularity criteria. The findings reveal that the IHHOOBL method has better detection accuracy than IHHOLF and IHHOCM. Also, to offer the efficiency of the , state-of-the-art algorithms have been used as comparisons. The improvement percentage of IHHOOBL compared to the state-of-the-art algorithm is about 7.18%.展开更多
Detecting COVID-19 cases as early as possible became a critical issue that must be addressed to avoid the pandemic’s additional spread and early provide the appropriate treatment to the affected patients.This study a...Detecting COVID-19 cases as early as possible became a critical issue that must be addressed to avoid the pandemic’s additional spread and early provide the appropriate treatment to the affected patients.This study aimed to develop a COVID-19 diagnosis and prediction(AIMDP)model that could identify patients with COVID-19 and distinguish it from other viral pneumonia signs detected in chest computed tomography(CT)scans.The proposed system uses convolutional neural networks(CNNs)as a deep learning technology to process hundreds of CT chest scan images and speeds up COVID-19 case prediction to facilitate its containment.We employed the whale optimization algorithm(WOA)to select the most relevant patient signs.A set of experiments validated AIMDP performance.It demonstrated the superiority of AIMDP in terms of the area under the curve-receiver operating characteristic(AUC-ROC)curve,positive predictive value(PPV),negative predictive rate(NPR)and negative predictive value(NPV).AIMDP was applied to a dataset of hundreds of real data and CT images,and it was found to achieve 96%AUC for diagnosing COVID-19 and 98%for overall accuracy.The results showed the promising performance of AIMDP for diagnosing COVID-19 when compared to other recent diagnosing and predicting models.展开更多
Recent studies employing deep learning to solve the traveling salesman problem(TSP)have mainly focused on learning construction heuristics.Such methods can improve TSP solutions,but still depend on additional programs...Recent studies employing deep learning to solve the traveling salesman problem(TSP)have mainly focused on learning construction heuristics.Such methods can improve TSP solutions,but still depend on additional programs.However,methods that focus on learning improvement heuristics to iteratively refine solutions remain insufficient.Traditional improvement heuristics are guided by a manually designed search strategy and may only achieve limited improvements.This paper proposes a novel framework for learning improvement heuristics,which automatically discovers better improvement policies for heuristics to iteratively solve the TSP.Our framework first designs a new architecture based on a transformer model to make the policy network parameterized,which introduces an action-dropout layer to prevent action selection from overfitting.It then proposes a deep reinforcement learning approach integrating a simulated annealing mechanism(named RL-SA)to learn the pairwise selected policy,aiming to improve the 2-opt algorithm's performance.The RL-SA leverages the whale optimization algorithm to generate initial solutions for better sampling efficiency and uses the Gaussian perturbation strategy to tackle the sparse reward problem of reinforcement learning.The experiment results show that the proposed approach is significantly superior to the state-of-the-art learning-based methods,and further reduces the gap between learning-based methods and highly optimized solvers in the benchmark datasets.Moreover,our pre-trained model M can be applied to guide the SA algorithm(named M-SA(ours)),which performs better than existing deep models in small-,medium-,and large-scale TSPLIB datasets.Additionally,the M-SA(ours)achieves excellent generalization performance in a real-world dataset on global liner shipping routes,with the optimization percentages in distance reduction ranging from3.52%to 17.99%.展开更多
Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization problems.This approach aims to leverage the strengt...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.展开更多
Phishing attacks present a persistent and evolving threat in the cybersecurity land-scape,necessitating the development of more sophisticated detection methods.Traditional machine learning approaches to phishing detec...Phishing attacks present a persistent and evolving threat in the cybersecurity land-scape,necessitating the development of more sophisticated detection methods.Traditional machine learning approaches to phishing detection have relied heavily on feature engineering and have often fallen short in adapting to the dynamically changing patterns of phishingUniformResource Locator(URLs).Addressing these challenge,we introduce a framework that integrates the sequential data processing strengths of a Recurrent Neural Network(RNN)with the hyperparameter optimization prowess of theWhale Optimization Algorithm(WOA).Ourmodel capitalizes on an extensive Kaggle dataset,featuring over 11,000 URLs,each delineated by 30 attributes.The WOA’s hyperparameter optimization enhances the RNN’s performance,evidenced by a meticulous validation process.The results,encapsulated in precision,recall,and F1-score metrics,surpass baseline models,achieving an overall accuracy of 92%.This study not only demonstrates the RNN’s proficiency in learning complex patterns but also underscores the WOA’s effectiveness in refining machine learning models for the critical task of phishing detection.展开更多
In the original Moth-Flame Optimization(MFO),the search behavior of the moth depends on the corresponding flame and the interaction between the moth and its corresponding flame,so it will get stuck in the local optimu...In the original Moth-Flame Optimization(MFO),the search behavior of the moth depends on the corresponding flame and the interaction between the moth and its corresponding flame,so it will get stuck in the local optimum easily when facing the multi-dimensional and high-dimensional optimization problems.Therefore,in this work,a generalized oppositional MFO with crossover strategy,named GCMFO,is presented to overcome the mentioned defects.In the proposed GCMFO,GOBL is employed to increase the population diversity and expand the search range in the initialization and iteration jump phase based on the jump rate;crisscross search(CC)is adopted to promote the exploitation and/or exploration ability of MFO.The proposed algorithm’s performance is estimated by organizing a series of experiments;firstly,the CEC2017 benchmark set is adopted to evaluate the performance of GCMFO in tackling high-dimensional and multimodal problems.Secondly,GCMFO is applied to handle multilevel thresholding image segmentation problems.At last,GCMFO is integrated into kernel extreme learning machine classifier to deal with three medical diagnosis cases,including the appendicitis diagnosis,overweight statuses diagnosis,and thyroid cancer diagnosis.Experimental results and discussions show that the proposed approach outperforms the original MFO and other state-of-the-art algorithms on both convergence speed and accuracy.It also indicates that the presented GCMFO has a promising potential for application.展开更多
Pulmonary Hypertension(PH)is a global health problem that affects about 1%of the global population.Animal models of PH play a vital role in unraveling the pathophysiological mechanisms of the disease.The present study...Pulmonary Hypertension(PH)is a global health problem that affects about 1%of the global population.Animal models of PH play a vital role in unraveling the pathophysiological mechanisms of the disease.The present study proposes a Kernel Extreme Learning Machine(KELM)model based on an improved Whale Optimization Algorithm(WOA)for predicting PH mouse models.The experimental results showed that the selected blood indicators,including Haemoglobin(HGB),Hematocrit(HCT),Mean,Platelet Volume(MPV),Platelet distribution width(PDW),and Platelet–Large Cell Ratio(P-LCR),were essential for identifying PH mouse models using the feature selection method proposed in this paper.Remarkably,the method achieved 100.0%accuracy and 100.0%specificity in classification,demonstrating that our method has great potential to be used for evaluating and identifying mouse PH models.展开更多
Mobile communication and the Internet of Things(IoT)technologies have recently been established to collect data from human beings and the environment.The data collected can be leveraged to provide intelligent services...Mobile communication and the Internet of Things(IoT)technologies have recently been established to collect data from human beings and the environment.The data collected can be leveraged to provide intelligent services through different applications.It is an extreme challenge to monitor disabled people from remote locations.It is because day-to-day events like falls heavily result in accidents.For a person with disabilities,a fall event is an important cause of mortality and post-traumatic complications.Therefore,detecting the fall events of disabled persons in smart homes at early stages is essential to provide the necessary support and increase their survival rate.The current study introduces a Whale Optimization Algorithm Deep Transfer Learning-DrivenAutomated Fall Detection(WOADTL-AFD)technique to improve the Quality of Life for persons with disabilities.The primary aim of the presented WOADTL-AFD technique is to identify and classify the fall events to help disabled individuals.To attain this,the proposed WOADTL-AFDmodel initially uses amodified SqueezeNet feature extractor which proficiently extracts the feature vectors.In addition,the WOADTLAFD technique classifies the fall events using an extreme Gradient Boosting(XGBoost)classifier.In the presented WOADTL-AFD technique,the WOA approach is used to fine-tune the hyperparameters involved in the modified SqueezeNet model.The proposedWOADTL-AFD technique was experimentally validated using the benchmark datasets,and the results confirmed the superior performance of the proposedWOADTL-AFD method compared to other recent approaches.展开更多
Effective technology for wind direction forecasting can be realized using the recent advances in machine learning.Consequently,the stability and safety of power systems are expected to be significantly improved.Howeve...Effective technology for wind direction forecasting can be realized using the recent advances in machine learning.Consequently,the stability and safety of power systems are expected to be significantly improved.However,the unstable and unpredictable qualities of the wind predict the wind direction a challenging problem.This paper proposes a practical forecasting approach based on the weighted ensemble of machine learning models.This weighted ensemble is optimized using a whale optimization algorithm guided by particle swarm optimization(PSO-Guided WOA).The proposed optimized weighted ensemble predicts the wind direction given a set of input features.The conducted experiments employed the wind power forecasting dataset,freely available on Kaggle and developed to predict the regular power generation at seven wind farms over forty-eight hours.The recorded results of the conducted experiments emphasize the effectiveness of the proposed ensemble in achieving accurate predictions of the wind direction.In addition,a comparison is established between the proposed optimized ensemble and other competing optimized ensembles to prove its superiority.Moreover,statistical analysis using one-way analysis of variance(ANOVA)and Wilcoxon’s rank-sum are provided based on the recorded results to confirm the excellent accuracy achieved by the proposed optimized weighted ensemble.展开更多
Cloud computing has been the core infrastructure for providing services to the offloaded workloads from IoT devices.However,for time-sensitive tasks,reducing end-to-end delay is a major concern.With advancements in th...Cloud computing has been the core infrastructure for providing services to the offloaded workloads from IoT devices.However,for time-sensitive tasks,reducing end-to-end delay is a major concern.With advancements in the IoT industry,the computation requirements of incoming tasks at the cloud are escalating,resulting in compromised quality of service.Fog computing emerged to alleviate such issues.However,the resources at the fog layer are limited and require efficient usage.The Whale Optimization Algorithm is a promising meta-heuristic algorithm extensively used to solve various optimization problems.However,being an exploitation-driven technique,its exploration potential is limited,resulting in reduced solution diversity,local optima,and poor convergence.To address these issues,this study proposes a dynamic opposition learning approach to enhance the Whale Optimization Algorithm to offload independent tasks.Opposition-Based Learning(OBL)has been extensively used to improve the exploration capability of the Whale Optimization Algorithm.However,it is computationally expensive and requires efficient utilization of appropriate OBL strategies to fully realize its advantages.Therefore,our proposed algorithm employs three OBL strategies at different stages to minimize end-to-end delay and improve load balancing during task offloading.First,basic OBL and quasi-OBL are employed during population initialization.Then,the proposed dynamic partial-opposition method enhances search space exploration using an information-based triggering mechanism that tracks the status of each agent.The results illustrate significant performance improvements by the proposed algorithm compared to SACO,PSOGA,IPSO,and oppoCWOA using the NASA Ames iPSC and HPC2N workload datasets.展开更多
基金support from the Ningxia Natural Science Foundation Project(2023AAC03361).
文摘The flying foxes optimization(FFO)algorithm,as a newly introduced metaheuristic algorithm,is inspired by the survival tactics of flying foxes in heat wave environments.FFO preferentially selects the best-performing individuals.This tendency will cause the newly generated solution to remain closely tied to the candidate optimal in the search area.To address this issue,the paper introduces an opposition-based learning-based search mechanism for FFO algorithm(IFFO).Firstly,this paper introduces niching techniques to improve the survival list method,which not only focuses on the adaptability of individuals but also considers the population’s crowding degree to enhance the global search capability.Secondly,an initialization strategy of opposition-based learning is used to perturb the initial population and elevate its quality.Finally,to verify the superiority of the improved search mechanism,IFFO,FFO and the cutting-edge metaheuristic algorithms are compared and analyzed using a set of test functions.The results prove that compared with other algorithms,IFFO is characterized by its rapid convergence,precise results and robust stability.
基金supported by Anhui Polytechnic University Introduced Talents Research Fund(No.2021YQQ064)Anhui Polytechnic University ScientificResearch Project(No.Xjky2022168).
文摘Due to the development of digital transformation,intelligent algorithms are getting more and more attention.The whale optimization algorithm(WOA)is one of swarm intelligence optimization algorithms and is widely used to solve practical engineering optimization problems.However,with the increased dimensions,higher requirements are put forward for algorithm performance.The double population whale optimization algorithm with distributed collaboration and reverse learning ability(DCRWOA)is proposed to solve the slow convergence speed and unstable search accuracy of the WOA algorithm in optimization problems.In the DCRWOA algorithm,the novel double population search strategy is constructed.Meanwhile,the reverse learning strategy is adopted in the population search process to help individuals quickly jump out of the non-ideal search area.Numerical experi-ments are carried out using standard test functions with different dimensions(10,50,100,200).The optimization case of shield construction parameters is also used to test the practical application performance of the proposed algo-rithm.The results show that the DCRWOA algorithm has higher optimization accuracy and stability,and the convergence speed is significantly improved.Therefore,the proposed DCRWOA algorithm provides a better method for solving practical optimization problems.
文摘Chimp Optimization Algorithm(ChOA)is one of the most efficient recent optimization algorithms,which proved its ability to deal with different problems in various do-mains.However,ChOA suffers from the weakness of the local search technique which leads to a loss of diversity,getting stuck in a local minimum,and procuring premature convergence.In response to these defects,this paper proposes an improved ChOA algorithm based on using Opposition-based learning(OBL)to enhance the choice of better solutions,written as OChOA.Then,utilizing Reinforcement Learning(RL)to improve the local research technique of OChOA,called RLOChOA.This way effectively avoids the algorithm falling into local optimum.The performance of the proposed RLOChOA algorithm is evaluated using the Friedman rank test on a set of CEC 2015 and CEC 2017 benchmark functions problems and a set of CEC 2011 real-world problems.Numerical results and statistical experiments show that RLOChOA provides better solution quality,convergence accuracy and stability compared with other state-of-the-art algorithms.
文摘Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.
文摘The widespread adoption of cloud computing has underscored the critical importance of efficient resource allocation and management, particularly in task scheduling, which involves assigning tasks to computing resources for optimized resource utilization. Several meta-heuristic algorithms have shown effectiveness in task scheduling, among which the relatively recent Willow Catkin Optimization (WCO) algorithm has demonstrated potential, albeit with apparent needs for enhanced global search capability and convergence speed. To address these limitations of WCO in cloud computing task scheduling, this paper introduces an improved version termed the Advanced Willow Catkin Optimization (AWCO) algorithm. AWCO enhances the algorithm’s performance by augmenting its global search capability through a quasi-opposition-based learning strategy and accelerating its convergence speed via sinusoidal mapping. A comprehensive evaluation utilizing the CEC2014 benchmark suite, comprising 30 test functions, demonstrates that AWCO achieves superior optimization outcomes, surpassing conventional WCO and a range of established meta-heuristics. The proposed algorithm also considers trade-offs among the cost, makespan, and load balancing objectives. Experimental results of AWCO are compared with those obtained using the other meta-heuristics, illustrating that the proposed algorithm provides superior performance in task scheduling. The method offers a robust foundation for enhancing the utilization of cloud computing resources in the domain of task scheduling within a cloud computing environment.
基金the Zhejiang Provincial Natural Science Foundation of China(no.LZ21F020001)the Basic Scientific Research Program of Wenzhou(no.S20220018).
文摘Whale optimization algorithm(WOA)tends to fall into the local optimum and fails to converge quickly in solving complex problems.To address the shortcomings,an improved WOA(QGBWOA)is proposed in this work.First,quasi-opposition-based learning is introduced to enhance the ability of WOA to search for optimal solutions.Second,a Gaussian barebone mechanism is embedded to promote diversity and expand the scope of the solution space in WOA.To verify the advantages of QGBWOA,comparison experiments between QGBWOA and its comparison peers were carried out on CEC 2014 with dimensions 10,30,50,and 100 and on CEC 2020 test with dimension 30.Furthermore,the performance results were tested using Wilcoxon signed-rank(WS),Friedman test,and post hoc statistical tests for statistical analysis.Convergence accuracy and speed are remarkably improved,as shown by experimental results.Finally,feature selection and multi-threshold image segmentation applications are demonstrated to validate the ability of QGBWOA to solve complex real-world problems.QGBWOA proves its superiority over compared algorithms in feature selection and multi-threshold image segmentation by performing several evaluation metrics.
基金The National Natural Science Foundation of China(Grant No.81973791)funded this research.
文摘The original whale optimization algorithm(WOA)has a low initial population quality and tends to converge to local optimal solutions.To address these challenges,this paper introduces an improved whale optimization algorithm called OLCHWOA,incorporating a chaos mechanism and an opposition-based learning strategy.This algorithm introduces chaotic initialization and opposition-based initialization operators during the population initialization phase,thereby enhancing the quality of the initial whale population.Additionally,including an elite opposition-based learning operator significantly improves the algorithm’s global search capabilities during iterations.The work and contributions of this paper are primarily reflected in two aspects.Firstly,an improved whale algorithm with enhanced development capabilities and a wide range of application scenarios is proposed.Secondly,the proposed OLCHWOA is used to optimize the hyperparameters of the Long Short-Term Memory(LSTM)networks.Subsequently,a prediction model for Realized Volatility(RV)based on OLCHWOA-LSTM is proposed to optimize hyperparameters automatically.To evaluate the performance of OLCHWOA,a series of comparative experiments were conducted using a variety of advanced algorithms.These experiments included 38 standard test functions from CEC2013 and CEC2019 and three constrained engineering design problems.The experimental results show that OLCHWOA ranks first in accuracy and stability under the same maximum fitness function calls budget.Additionally,the China Securities Index 300(CSI 300)dataset is used to evaluate the effectiveness of the proposed OLCHWOA-LSTM model in predicting RV.The comparison results with the other eight models show that the proposed model has the highest accuracy and goodness of fit in predicting RV.This further confirms that OLCHWOA effectively addresses real-world optimization problems.
文摘Pavement crack detection plays a crucial role in ensuring road safety and reducing maintenance expenses.Recent advancements in deep learning(DL)techniques have shown promising results in detecting pavement cracks;however,the selection of relevant features for classification remains challenging.In this study,we propose a new approach for pavement crack detection that integrates deep learning for feature extraction,the whale optimization algorithm(WOA)for feature selection,and random forest(RF)for classification.The performance of the models was evaluated using accuracy,recall,precision,F1 score,and area under the receiver operating characteristic curve(AUC).Our findings reveal that Model 2,which incorporates RF into the ResNet-18 architecture,outperforms baseline Model 1 across all evaluation metrics.Nevertheless,our proposed model,which combines ResNet-18 with both WOA and RF,achieves significantly higher accuracy,recall,precision,and F1 score compared to the other two models.These results underscore the effectiveness of integrating RF and WOA into ResNet-18 for pavement crack detection applications.We applied the proposed approach to a dataset of pavement images,achieving an accuracy of 97.16%and an AUC of 0.984.Our results demonstrate that the proposed approach surpasses existing methods for pavement crack detection,offering a promising solution for the automatic identification of pavement cracks.By leveraging this approach,potential safety hazards can be identified more effectively,enabling timely repairs and maintenance measures.Lastly,the findings of this study also emphasize the potential of integrating RF and WOA with deep learning for pavement crack detection,providing road authorities with the necessary tools to make informed decisions regarding road infrastructure maintenance.
文摘Extreme Learning Machine(ELM)is popular in batch learning,sequential learning,and progressive learning,due to its speed,easy integration,and generalization ability.While,Traditional ELM cannot train massive data rapidly and efficiently due to its memory residence,high time and space complexity.In ELM,the hidden layer typically necessitates a huge number of nodes.Furthermore,there is no certainty that the arrangement of weights and biases within the hidden layer is optimal.To solve this problem,the traditional ELM has been hybridized with swarm intelligence optimization techniques.This paper displays five proposed hybrid Algorithms“Salp Swarm Algorithm(SSA-ELM),Grasshopper Algorithm(GOA-ELM),Grey Wolf Algorithm(GWO-ELM),Whale optimizationAlgorithm(WOA-ELM)andMoth Flame Optimization(MFO-ELM)”.These five optimizers are hybridized with standard ELM methodology for resolving the tumor type classification using gene expression data.The proposed models applied to the predication of electricity loading data,that describes the energy use of a single residence over a fouryear period.In the hidden layer,Swarm algorithms are used to pick a smaller number of nodes to speed up the execution of ELM.The best weights and preferences were calculated by these algorithms for the hidden layer.Experimental results demonstrated that the proposed MFO-ELM achieved 98.13%accuracy and this is the highest model in accuracy in tumor type classification gene expression data.While in predication,the proposed GOA-ELM achieved 0.397which is least RMSE compared to the other models.
文摘The purpose of community detection in complex networks is to identify the structural location of nodes. Complex network methods are usually graphical, with graph nodes representing objects and edges representing connections between things. Communities are node clusters with many internal links but minimal intergroup connections. Although community detection has attracted much attention in social media research, most face functional weaknesses because the structure of society is unclear or the characteristics of nodes in society are not the same. Also, many existing algorithms have complex and costly calculations. This paper proposes different Harris Hawk Optimization (HHO) algorithm methods (such as Improved HHO Opposition-Based Learning(OBL) (IHHOOBL), Improved HHO Lévy Flight (IHHOLF), and Improved HHO Chaotic Map (IHHOCM)) were designed to balance exploitation and exploration in this algorithm for community detection in the social network. The proposed methods are evaluated on 12 different datasets based on NMI and modularity criteria. The findings reveal that the IHHOOBL method has better detection accuracy than IHHOLF and IHHOCM. Also, to offer the efficiency of the , state-of-the-art algorithms have been used as comparisons. The improvement percentage of IHHOOBL compared to the state-of-the-art algorithm is about 7.18%.
文摘Detecting COVID-19 cases as early as possible became a critical issue that must be addressed to avoid the pandemic’s additional spread and early provide the appropriate treatment to the affected patients.This study aimed to develop a COVID-19 diagnosis and prediction(AIMDP)model that could identify patients with COVID-19 and distinguish it from other viral pneumonia signs detected in chest computed tomography(CT)scans.The proposed system uses convolutional neural networks(CNNs)as a deep learning technology to process hundreds of CT chest scan images and speeds up COVID-19 case prediction to facilitate its containment.We employed the whale optimization algorithm(WOA)to select the most relevant patient signs.A set of experiments validated AIMDP performance.It demonstrated the superiority of AIMDP in terms of the area under the curve-receiver operating characteristic(AUC-ROC)curve,positive predictive value(PPV),negative predictive rate(NPR)and negative predictive value(NPV).AIMDP was applied to a dataset of hundreds of real data and CT images,and it was found to achieve 96%AUC for diagnosing COVID-19 and 98%for overall accuracy.The results showed the promising performance of AIMDP for diagnosing COVID-19 when compared to other recent diagnosing and predicting models.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.72101046 and 61672128)。
文摘Recent studies employing deep learning to solve the traveling salesman problem(TSP)have mainly focused on learning construction heuristics.Such methods can improve TSP solutions,but still depend on additional programs.However,methods that focus on learning improvement heuristics to iteratively refine solutions remain insufficient.Traditional improvement heuristics are guided by a manually designed search strategy and may only achieve limited improvements.This paper proposes a novel framework for learning improvement heuristics,which automatically discovers better improvement policies for heuristics to iteratively solve the TSP.Our framework first designs a new architecture based on a transformer model to make the policy network parameterized,which introduces an action-dropout layer to prevent action selection from overfitting.It then proposes a deep reinforcement learning approach integrating a simulated annealing mechanism(named RL-SA)to learn the pairwise selected policy,aiming to improve the 2-opt algorithm's performance.The RL-SA leverages the whale optimization algorithm to generate initial solutions for better sampling efficiency and uses the Gaussian perturbation strategy to tackle the sparse reward problem of reinforcement learning.The experiment results show that the proposed approach is significantly superior to the state-of-the-art learning-based methods,and further reduces the gap between learning-based methods and highly optimized solvers in the benchmark datasets.Moreover,our pre-trained model M can be applied to guide the SA algorithm(named M-SA(ours)),which performs better than existing deep models in small-,medium-,and large-scale TSPLIB datasets.Additionally,the M-SA(ours)achieves excellent generalization performance in a real-world dataset on global liner shipping routes,with the optimization percentages in distance reduction ranging from3.52%to 17.99%.
基金funded by the Researchers Supporting Program at King Saud University(RSPD2024R809).
文摘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.
基金Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2024R 343)PrincessNourah bint Abdulrahman University,Riyadh,Saudi ArabiaDeanship of Scientific Research at Northern Border University,Arar,Kingdom of Saudi Arabia,for funding this researchwork through the project number“NBU-FFR-2024-1092-02”.
文摘Phishing attacks present a persistent and evolving threat in the cybersecurity land-scape,necessitating the development of more sophisticated detection methods.Traditional machine learning approaches to phishing detection have relied heavily on feature engineering and have often fallen short in adapting to the dynamically changing patterns of phishingUniformResource Locator(URLs).Addressing these challenge,we introduce a framework that integrates the sequential data processing strengths of a Recurrent Neural Network(RNN)with the hyperparameter optimization prowess of theWhale Optimization Algorithm(WOA).Ourmodel capitalizes on an extensive Kaggle dataset,featuring over 11,000 URLs,each delineated by 30 attributes.The WOA’s hyperparameter optimization enhances the RNN’s performance,evidenced by a meticulous validation process.The results,encapsulated in precision,recall,and F1-score metrics,surpass baseline models,achieving an overall accuracy of 92%.This study not only demonstrates the RNN’s proficiency in learning complex patterns but also underscores the WOA’s effectiveness in refining machine learning models for the critical task of phishing detection.
基金This research is supported by the National Natural Science Foundation of China(62076185,U1809209)Zhejiang Provincial Natural Science Foundation of China(LY21F020030)+2 种基金Wenzhou Science&Technology Bureau(2018ZG016)Taif University Researchers Supporting Project Number(TURSP-2020/125)Taif University,Taif,Saudi Arabia。
文摘In the original Moth-Flame Optimization(MFO),the search behavior of the moth depends on the corresponding flame and the interaction between the moth and its corresponding flame,so it will get stuck in the local optimum easily when facing the multi-dimensional and high-dimensional optimization problems.Therefore,in this work,a generalized oppositional MFO with crossover strategy,named GCMFO,is presented to overcome the mentioned defects.In the proposed GCMFO,GOBL is employed to increase the population diversity and expand the search range in the initialization and iteration jump phase based on the jump rate;crisscross search(CC)is adopted to promote the exploitation and/or exploration ability of MFO.The proposed algorithm’s performance is estimated by organizing a series of experiments;firstly,the CEC2017 benchmark set is adopted to evaluate the performance of GCMFO in tackling high-dimensional and multimodal problems.Secondly,GCMFO is applied to handle multilevel thresholding image segmentation problems.At last,GCMFO is integrated into kernel extreme learning machine classifier to deal with three medical diagnosis cases,including the appendicitis diagnosis,overweight statuses diagnosis,and thyroid cancer diagnosis.Experimental results and discussions show that the proposed approach outperforms the original MFO and other state-of-the-art algorithms on both convergence speed and accuracy.It also indicates that the presented GCMFO has a promising potential for application.
基金the National Natural Science Foundation of China(82003831,62076185 and U1809209)the Project of Health Commission of Zhejiang Province(2020KY177)+2 种基金the Wenzhou Technology Foundation(Y2020002)the Natural Science Foundation of Zhejiang Province(LZ22F020005)the First Affiliated Hospital of Wenzhou Medical University Youth Excellence Project(QNYC114).
文摘Pulmonary Hypertension(PH)is a global health problem that affects about 1%of the global population.Animal models of PH play a vital role in unraveling the pathophysiological mechanisms of the disease.The present study proposes a Kernel Extreme Learning Machine(KELM)model based on an improved Whale Optimization Algorithm(WOA)for predicting PH mouse models.The experimental results showed that the selected blood indicators,including Haemoglobin(HGB),Hematocrit(HCT),Mean,Platelet Volume(MPV),Platelet distribution width(PDW),and Platelet–Large Cell Ratio(P-LCR),were essential for identifying PH mouse models using the feature selection method proposed in this paper.Remarkably,the method achieved 100.0%accuracy and 100.0%specificity in classification,demonstrating that our method has great potential to be used for evaluating and identifying mouse PH models.
基金The authors extend their appreciation to the King Salman Center for Disability Research for funding this work through Research Group no KSRG-2022-030.
文摘Mobile communication and the Internet of Things(IoT)technologies have recently been established to collect data from human beings and the environment.The data collected can be leveraged to provide intelligent services through different applications.It is an extreme challenge to monitor disabled people from remote locations.It is because day-to-day events like falls heavily result in accidents.For a person with disabilities,a fall event is an important cause of mortality and post-traumatic complications.Therefore,detecting the fall events of disabled persons in smart homes at early stages is essential to provide the necessary support and increase their survival rate.The current study introduces a Whale Optimization Algorithm Deep Transfer Learning-DrivenAutomated Fall Detection(WOADTL-AFD)technique to improve the Quality of Life for persons with disabilities.The primary aim of the presented WOADTL-AFD technique is to identify and classify the fall events to help disabled individuals.To attain this,the proposed WOADTL-AFDmodel initially uses amodified SqueezeNet feature extractor which proficiently extracts the feature vectors.In addition,the WOADTLAFD technique classifies the fall events using an extreme Gradient Boosting(XGBoost)classifier.In the presented WOADTL-AFD technique,the WOA approach is used to fine-tune the hyperparameters involved in the modified SqueezeNet model.The proposedWOADTL-AFD technique was experimentally validated using the benchmark datasets,and the results confirmed the superior performance of the proposedWOADTL-AFD method compared to other recent approaches.
文摘Effective technology for wind direction forecasting can be realized using the recent advances in machine learning.Consequently,the stability and safety of power systems are expected to be significantly improved.However,the unstable and unpredictable qualities of the wind predict the wind direction a challenging problem.This paper proposes a practical forecasting approach based on the weighted ensemble of machine learning models.This weighted ensemble is optimized using a whale optimization algorithm guided by particle swarm optimization(PSO-Guided WOA).The proposed optimized weighted ensemble predicts the wind direction given a set of input features.The conducted experiments employed the wind power forecasting dataset,freely available on Kaggle and developed to predict the regular power generation at seven wind farms over forty-eight hours.The recorded results of the conducted experiments emphasize the effectiveness of the proposed ensemble in achieving accurate predictions of the wind direction.In addition,a comparison is established between the proposed optimized ensemble and other competing optimized ensembles to prove its superiority.Moreover,statistical analysis using one-way analysis of variance(ANOVA)and Wilcoxon’s rank-sum are provided based on the recorded results to confirm the excellent accuracy achieved by the proposed optimized weighted ensemble.
基金supported and funded by‘Data Analytics and Visualization Development System for Subsurface Co2 Storage and Fluid Production’,Cost centre(015MD0-166)under the Center for research in Data Science(CerDaS)Universiti Teknologi PETRONAS,Malaysia.
文摘Cloud computing has been the core infrastructure for providing services to the offloaded workloads from IoT devices.However,for time-sensitive tasks,reducing end-to-end delay is a major concern.With advancements in the IoT industry,the computation requirements of incoming tasks at the cloud are escalating,resulting in compromised quality of service.Fog computing emerged to alleviate such issues.However,the resources at the fog layer are limited and require efficient usage.The Whale Optimization Algorithm is a promising meta-heuristic algorithm extensively used to solve various optimization problems.However,being an exploitation-driven technique,its exploration potential is limited,resulting in reduced solution diversity,local optima,and poor convergence.To address these issues,this study proposes a dynamic opposition learning approach to enhance the Whale Optimization Algorithm to offload independent tasks.Opposition-Based Learning(OBL)has been extensively used to improve the exploration capability of the Whale Optimization Algorithm.However,it is computationally expensive and requires efficient utilization of appropriate OBL strategies to fully realize its advantages.Therefore,our proposed algorithm employs three OBL strategies at different stages to minimize end-to-end delay and improve load balancing during task offloading.First,basic OBL and quasi-OBL are employed during population initialization.Then,the proposed dynamic partial-opposition method enhances search space exploration using an information-based triggering mechanism that tracks the status of each agent.The results illustrate significant performance improvements by the proposed algorithm compared to SACO,PSOGA,IPSO,and oppoCWOA using the NASA Ames iPSC and HPC2N workload datasets.
