Balancing Exploration–Exploitation of Multi-verse Optimizer for Parameter Extraction on Photovoltaic Models

Extracting photovoltaic(PV)model parameters based on the measured voltage and current information is crucial in the simulation and management of PV systems.To accurately and reliably extract the unknown parameters of different PV models,this paper proposes an improved multi-verse optimizer that integrates an iterative chaos map and the Nelder–Mead simplex method,INMVO.Quantitative experiments verified that the proposed INMVO fueled by both mechanisms has more affluent populations and a more reasonable balance between exploration and exploitation.Further,to verify the feasibility and competitiveness of the proposal,this paper employed INMVO to extract the unknown parameters on single-diode,double-diode,three-diode,and PV module four well-known PV models,and the high-performance techniques are selected for comparison.In addition,the Wilcoxon signed-rank and Friedman tests were employed to test the experimental results statistically.Various evaluation metrics,such as root means square error,relative error,absolute error,and statistical test,demonstrate that the proposed INMVO works effectively and accurately to extract the unknown parameters on different PV models compared to other techniques.In addition,the capability of INMVO to stably and accurately extract unknown parameters was also verified on three commercial PV modules under different irradiance and temperatures.In conclusion,the proposal in this paper can be implemented as an advanced and reliable tool for extracting the unknown parameters of different PV models.Note that the source code of INMVO is available at https://github.com/woniuzuioupao/INMVO.

Gaussian Backbone-Based Spherical Evolutionary Algorithm with Cross-search for Engineering Problems

In recent years,with the increasing demand for social production,engineering design problems have gradually become more and more complex.Many novel and well-performing meta-heuristic algorithms have been studied and developed to cope with this problem.Among them,the Spherical Evolutionary Algorithm(SE)is one of the classical representative methods that proposed in recent years with admirable optimization performance.However,it tends to stagnate prematurely to local optima in solving some specific problems.Therefore,this paper proposes an SE variant integrating the Cross-search Mutation(CSM)and Gaussian Backbone Strategy(GBS),called CGSE.In this study,the CSM can enhance its social learning ability,which strengthens the utilization rate of SE on effective information;the GBS cooperates with the original rules of SE to further improve the convergence effect of SE.To objectively demonstrate the core advantages of CGSE,this paper designs a series of global optimization experiments based on IEEE CEC2017,and CGSE is used to solve six engineering design problems with constraints.The final experimental results fully showcase that,compared with the existing well-known methods,CGSE has a very significant competitive advantage in global tasks and has certain practical value in real applications.Therefore,the proposed CGSE is a promising and first-rate algorithm with good potential strength in the field of engineering design.

Dynamic Individual Selection and Crossover Boosted Forensic-based Investigation Algorithm for Global Optimization and Feature Selection

The advent of Big Data has rendered Machine Learning tasks more intricate as they frequently involve higher-dimensional data.Feature Selection(FS)methods can abate the complexity of the data and enhance the accuracy,generalizability,and interpretability of models.Meta-heuristic algorithms are often utilized for FS tasks due to their low requirements and efficient performance.This paper introduces an augmented Forensic-Based Investigation algorithm(DCFBI)that incorporates a Dynamic Individual Selection(DIS)and crisscross(CC)mechanism to improve the pursuit phase of the FBI.Moreover,a binary version of DCFBI(BDCFBI)is applied to FS.Experiments conducted on IEEE CEC 2017 with other metaheuristics demonstrate that DCFBI surpasses them in search capability.The influence of different mechanisms on the original FBI is analyzed on benchmark functions,while its scalability is verified by comparing it with the original FBI on benchmarks with varied dimensions.BDCFBI is then applied to 18 real datasets from the UCI machine learning database and the Wieslaw dataset to select near-optimal features,which are then compared with six renowned binary metaheuristics.The results show that BDCFBI can be more competitive than similar methods and acquire a subset of features with superior classification accuracy.

Multi-verse Optimizer with Rosenbrock and Diffusion Mechanisms for Multilevel Threshold Image Segmentation from COVID-19 Chest X-Ray Images

Coronavirus Disease 2019(COVID-19)is the most severe epidemic that is prevalent all over the world.How quickly and accurately identifying COVID-19 is of great significance to controlling the spread speed of the epidemic.Moreover,it is essential to accurately and rapidly identify COVID-19 lesions by analyzing Chest X-ray images.As we all know,image segmentation is a critical stage in image processing and analysis.To achieve better image segmentation results,this paper proposes to improve the multi-verse optimizer algorithm using the Rosenbrock method and diffusion mechanism named RDMVO.Then utilizes RDMVO to calculate the maximum Kapur’s entropy for multilevel threshold image segmentation.This image segmentation scheme is called RDMVO-MIS.We ran two sets of experiments to test the performance of RDMVO and RDMVO-MIS.First,RDMVO was compared with other excellent peers on IEEE CEC2017 to test the performance of RDMVO on benchmark functions.Second,the image segmentation experiment was carried out using RDMVO-MIS,and some meta-heuristic algorithms were selected as comparisons.The test image dataset includes Berkeley images and COVID-19 Chest X-ray images.The experimental results verify that RDMVO is highly competitive in benchmark functions and image segmentation experiments compared with other meta-heuristic algorithms.

Boosting Kernel Search Optimizer with Slime Mould Foraging Behavior for Combined Economic Emission Dispatch Problems

Reducing pollutant emissions from electricity production in the power system positively impacts the control of greenhouse gas emissions.Boosting kernel search optimizer(BKSO)is introduced in this research to solve the combined economic emission dispatch(CEED)problem.Inspired by the foraging behavior in the slime mould algorithm(SMA),the kernel matrix of the kernel search optimizer(KSO)is intensified.The proposed BKSO is superior to the standard KSO in terms of exploitation ability,robustness,and convergence rate.The CEC2013 test function is used to assess the improved KSO's performance and compared to 11 well-known optimization algorithms.BKSO performs better in statistical results and convergence curves.At the same time,BKSO achieves better fuel costs and fewer pollution emissions by testing with four real CEED cases,and the Pareto solution obtained is also better than other MAs.Based on the experimental results,BKSO has better performance than other comparable MAs and can provide more economical,robust,and cleaner solutions to CEED problems.

A Boosted Communicational Salp Swarm Algorithm: Performance Optimization and Comprehensive Analysis

The Salp Swarm Algorithm (SSA) is a recently proposed swarm intelligence algorithm inspired by salps, a marine creature similar to jellyfish. Despite its simple structure and solid exploratory ability, SSA suffers from low convergence accuracy and slow convergence speed when dealing with some complex problems. Therefore, this paper proposes an improved algorithm based on SSA and adds three improvements. First, the Real-time Update Mechanism (RUM) underwrites the role of ensuring that excellent individual information will not be lost and information exchange will not lag in the iterative process. Second, the Communication Strategy (CMS), on the other hand, uses the multiplicative relationship of multiple individuals to regulate the exploration and exploitation process dynamically. Third, the Selective Replacement Strategy (SRS) is designed to adaptively adjust the variance ratio of individuals to enhance the accuracy and depth of convergence. The new proposal presented in this study is named RCSSSA. The global optimization capability of the algorithm was tested against various high-performance and novel algorithms at IEEE CEC 2014, and its constrained optimization capability was tested at IEEE CEC 2011. The experimental results demonstrate that the proposed algorithm can converge faster while obtaining better optimization results than traditional swarm intelligence and other improved algorithms. The statistical data in the table support its optimization capabilities, and multiple graphs deepen the understanding and analysis of the proposed algorithm.

Comprehensive Learning Strategy Enhanced Chaotic Whale Optimization for High-dimensional Feature Selection

Feature selection(FS)is an adequate data pre-processing method that reduces the dimensionality of datasets and is used in bioinformatics,finance,and medicine.Traditional FS approaches,however,frequently struggle to identify the most important characteristics when dealing with high-dimensional information.To alleviate the imbalance of explore search ability and exploit search ability of the Whale Optimization Algorithm(WOA),we propose an enhanced WOA,namely SCLWOA,that incorporates sine chaos and comprehensive learning(CL)strategies.Among them,the CL mechanism contributes to improving the ability to explore.At the same time,the sine chaos is used to enhance the exploitation capacity and help the optimizer to gain a better initial solution.The hybrid performance of SCLWOA was evaluated comprehensively on IEEE CEC2017 test functions,including its qualitative analysis and comparisons with other optimizers.The results demonstrate that SCLWOA is superior to other algorithms in accuracy and converges faster than others.Besides,the variant of Binary SCLWOA(BSCLWOA)and other binary optimizers obtained by the mapping function was evaluated on 12 UCI data sets.Subsequently,BSCLWOA has proven very competitive in classification precision and feature reduction.