Exploitation Capabilities Research Articles

An improved mountain gazelle optimizer based on chaotic map and spiral disturbance for medical feature selection.

Feature selection is an important solution for dealing with high-dimensional data in the fields of machine learning and data mining. In this paper, we present an improved mountain gazelle optimizer (IMGO) based on the newly proposed mountain gazelle optimizer (MGO) and design a binary version of IMGO (BIMGO) to solve the feature selection problem for medical data. First, the gazelle population is initialized using iterative chaotic map with infinite collapses (ICMIC) mapping, which increases the diversity of the population. Second, a nonlinear control factor is introduced to balance the exploration and exploitation components of the algorithm. Individuals in the population are perturbed using a spiral perturbation mechanism to enhance the local search capability of the algorithm. Finally, a neighborhood search strategy is used for the optimal individuals to enhance the exploitation and convergence capabilities of the algorithm. The superior ability of the IMGO algorithm to solve continuous problems is demonstrated on 23 benchmark datasets. Then, BIMGO is evaluated on 16 medical datasets of different dimensions and compared with 8 well-known metaheuristic algorithms. The experimental results indicate that BIMGO outperforms the competing algorithms in terms of the fitness value, number of selected features and sensitivity. In addition, the statistical results of the experiments demonstrate the significantly superior ability of BIMGO to select the most effective features in medical datasets.

HYBRID GUILLEMOT - CALLOSCIURUS PREVOSTII ALGORITHM

Hybrid Guillemot - Callosciurus prevostii Algorithm (HGC) is designed in this paper. Key objectives are active power loss reduction and voltage stability augmentation. In Guillemot algorithm, the passage of Guillemot will be in the direction of other Guillemot rendering to warmth deliberation and space. Callosciurus prevostii energetic foraging ploy and glissade process are imitated scientifically to design the algorithm. In the period of autumn season, Callosciurus prevostii seek for food resources by glissade from one Quercus rubra to another, and they change the locations. Guillemot Algorithm and Callosciurus prevostii Optimization Algorithm are hybridized to enhance the exploration and exploitation capabilities of the algorithm in order to attain better solutions. Hybrid Guillemot - Callosciurus prevostii Algorithm (HGC) validated in IEEE 30 and 354 test systems. Active power loss reduction has been achieved with voltage deviation minimization.

A Multi-strategy Improved Grasshopper Optimization Algorithm for Solving Global Optimization and Engineering Problems

This paper presents a multi-strategy improved grasshopper optimization algorithm (MSIGOA), which aims to address the shortcomings of the grasshopper optimization algorithm (GOA), including its slow convergence, vulnerability to trapping into local optima, and low accuracy. Firstly, to improve the uniformity of the population distribution in the search space, the MSIGOA uses circle mapping for the population initialization. A nonlinear decreasing coefficient is utilized instead of an original linear decreasing coefficient to improve the local exploitation and global exploration capabilities. Then, the modified golden sine mechanism is added during the position update stage to change the single position update mode of GOA and enhance the local exploitation capability. The greedy strategy is added to greedily select the new and old positions of the individual to retain a better position and increase the speed of convergence. Finally, the quasi-reflection-based learning mechanism is utilized to construct new populations to improve population multiplicity and the capability to escape from the local optima. This paper verifies the efficacy of MSIGOA by comparing it with other advanced algorithms on six engineering design problems, CEC2017 test functions, and 12 classical benchmark functions. The experimental results show that MSIGOA performs better than the original GOA and other compared algorithms and has stronger comprehensive optimization capabilities.

BDE-Jaya: A binary discrete enhanced Jaya algorithm for multiple automated guided vehicle scheduling problem in matrix manufacturing workshop

With the advent of "Industry 4.0", more matrix manufacturing workshops have adopted automated guided vehicle (AGV) for material handling. AGV transportation has become a key link in manufacturing production. Traditional AGVs scheduling problem (AGVSP) is studied in depth. However, most research overlooks an important problem, in production with limited resources, the number of AGVs is insufficient. Therefore, the wait time of workstations is longer than expected. The service time of the task is delayed and the cost is increased. To solve above problem, this paper proposes the binary discrete enhanced Jaya (BDE-Jaya) algorithm. The main goal is to minimize transportation cost, including AGV traveling cost, service early penalty, and total tardiness (TTD). A key-task shift method is proposed to reduce TTD and task service early penalty. Two heuristics based on the problem features are designed to generate the initial solution. In the evolutionary stage, three offspring generation methods are used to improve the algorithm exploitation capability and exploration capability. Then, an insertion-based repair method is designed to prevent the exploitation process falling into local optimum. Furthermore, three parameters are proposed to improve the performance of the algorithm. Finally, simulation experiment shows that the proposed BDE-Jaya algorithm has significant advantages compared with other algorithms.

Neural population dynamics optimization algorithm: A novel brain-inspired meta-heuristic method

Meta-heuristic algorithms are popular for their efficiency in solving complex optimization problems. Although there are many known algorithms, identifying ways to improve their performance remains an important research area. This paper proposes a brain neuroscience-inspired meta-heuristic algorithm called the Neural Population Dynamics Optimization Algorithm (NPDOA). There are three strategies in NPDOA. (1) The attractor trending strategy drives neural populations towards optimal decisions, thereby ensuring exploitation capability. (2) The coupling disturbance strategy deviates neural populations from attractors by coupling with other neural populations, thus improving exploration ability. (3) The information projection strategy controls the communication between neural populations, enabling a transition from exploration to exploitation. The results of benchmark and practical problems verified the effectiveness of NPDOA.

A novel data-driven IBA-ELM model for SOH/SOC estimation of lithium-ion batteries

Lithium-ion batteries (Libs) have become the best power source for electric vehicles due to their high energy density and long cycle life. The state estimation is directly related to the safe and efficient use of Libs. In our previous research, a Bat Algorithm-Extreme Learning Machine (BA-ELM) model was constructed and promising results were achieved for state of health (SOH) estimation. To increase the engineering application value of BA-ELM for SOH/state of charge (SOC) estimation, optimization mechanism of improving the global exploration and local exploitation capabilities of the model was studied. First, three improved methods including a conversion mechanism of Artificial Bee Colony algorithm employing bees and scout bees, a mechanism for adaptive adjustment of the search frequency of bats according to the Euclidean distance difference, and an adaptive inertia weight coefficient method were proposed to construct a novel Improved Bat Algorithm (IBA)-ELM model. Second, a battery life degradation test platform was built to obtain the degradation dataset for Libs. The variation rules of nine battery variables and cycles were revealed. Four high-quality SOH-related features were extracted. Thus, the SOH estimation performance of six models was evaluated. Third, a Libs charge–discharge dataset under driving conditions was collected and processed. Four models were trained based on 72,048 samples from four conditions. Further, SOC estimation tests were conducted on 35,071 samples from completely different conditions. The results show that the root mean square error (RMSE) and mean absolute error (MAE) of SOH estimation by IBA-ELM decreased by 21.93 % and 23.79 %, respectively, compared to those by BA-ELM. The RMSE and MAE of SOC estimation decreased by more than 10 %. Error, radar, and violin plots demonstrate that the IBA-ELM could accurately estimate SOH/SOC in larger scale datasets, simultaneously exhibiting better generalization performance.

An Improved Football Team Training Algorithm for Global Optimization.

The football team training algorithm (FTTA) is a new metaheuristic algorithm that was proposed in 2024. The FTTA has better performance but faces challenges such as poor convergence accuracy and ease of falling into local optimality due to limitations such as referring too much to the optimal individual for updating and insufficient perturbation of the optimal agent. To address these concerns, this paper presents an improved football team training algorithm called IFTTA. To enhance the exploration ability in the collective training phase, this paper proposes the fitness distance-balanced collective training strategy. This enables the players to train more rationally in the collective training phase and balances the exploration and exploitation capabilities of the algorithm. To further perturb the optimal agent in FTTA, a non-monopoly extra training strategy is designed to enhance the ability to get rid of the local optimum. In addition, a population restart strategy is then designed to boost the convergence accuracy and population diversity of the algorithm. In this paper, we validate the performance of IFTTA and FTTA as well as six comparison algorithms in CEC2017 test suites. The experimental results show that IFTTA has strong optimization performance. Moreover, several engineering-constrained optimization problems confirm the potential of IFTTA to solve real-world optimization problems.

Adaptive projection plane and reference point strategy for multi-objective particle swarm optimization

Achieving a balance between convergence and diversity and their mutual enhancement is a complex task in the process of algorithm improvement. This is crucial because it is directly related to the effectiveness of the algorithm in obtaining accurate and uniformly distributed Pareto frontiers. Although significant progress has been made in particle swarm algorithms, exploring new approaches is necessary. In this paper, we construct a projection plane (projection line in 2D) based on the extreme values of the non-dominated solutions, select a set of uniform reference points on the projection plane, and then project the non-dominated solutions onto the constructed projection plane to form projection points. The reference points and projection points on the projection plane are thus utilized to guide the updating of the population as well as the maintenance of the external archive, a strategy that enhances the algorithm's global exploration and local exploitation capabilities. Secondly, we aggregate the target values of particles into a single scalar value and combine the idea of particle fusion to design a scheme for the particle selection of individual optimal particles. This paper further improves the algorithm's overall performance by using the information between populations to select individual optimal particles. Lastly, it is evaluated against a number of multi-objective algorithms that are currently in use and perform well on 22 test problems. The findings demonstrate that the algorithm this paper proposes performs better when solving multi-objective problems.

Optimal energy management strategy for electric vehicles and electricity distribution system based on quantile deep learning with enhanced African vulture optimization

The increasing fluctuation in electricity prices due to unpredictable demand loads on the power grid has underscored the importance of finding optimal scheduling solutions for electric vehicles (EVs). Integrating EVs into the distribution system (DS) is critical for efficiently managing their energy needs. However, current EV scheduling approaches face challenges. Centralized solutions are often unreliable and complex, while existing decentralized methods struggle to efficiently schedule EVs in large networks with smart energy DS. To address these challenges, we propose a hybrid technique called Quantile Deep Learning with Enhanced African Vulture Optimization (Quantum VultureNet) for energy management systems (EMS) involving EVs and DS. This approach combines the African Vultures Optimization algorithm with elite mutation, learning based on dynamic opposition, and chaotic map-based population initialization. By enhancing exploration and exploitation capabilities, this hybrid method aims to improve the scheduling of EVs, particularly in dynamic environments. The primary goal of the Quantum VultureNet technique is to minimize system costs and power losses while optimizing energy management. The proposed system considers factors such as bidirectional energy trading, EV fleet arrival times in driving plans, Photo Voltaic uncertainty impacts on energy management systems, and factors affecting energy selling back to the grid. The model was implemented in MATLAB and compared with conventional methods. Simulation results demonstrate that the Quantum VultureNet technique effectively finds near-global optimum solutions with reduced computational complexity. This indicates the effectiveness of the proposed approach for EMS in EVs integrated with DS.

Quantum Chimp Optimization Algorithm: A Novel Integration of Quantum Mechanics Into the Chimp Optimization Framework for Enhanced Performance

Abstract This research introduces the Quantum Chimp Optimization Algorithm (QChOA), a pioneering methodology that integrates quantum mechanics principles into the Chimp Optimization Algorithm (ChOA). By incorporating non-linearity and uncertainty, the QChOA significantly improves the ChOA’s exploration and exploitation capabilities. A distinctive feature of the QChOA is its ability to displace a ’chimp,’ representing a potential solution, leading to heightened fitness levels compared to the current top search agent. Our comprehensive evaluation includes twenty- nine standard optimization test functions, thirty CEC-BC functions, the CEC06 test suite, ten real-world engineering challenges, and the IEEE CEC 2022 competition’s dynamic optimization problems. Comparative analyses involve four ChOA variants, three leading quantum-behaved algorithms, three state-ofthe-art algorithms, and eighteen benchmarks. Employing three non-parametric statistical tests (Wilcoxon rank-sum, Holm-Bonferroni, and Friedman average rank tests), results show that the QChOA outperforms counterparts in 51 out of 70 scenarios, exhibiting performance on par with SHADE and CMA-ES, and statistical equivalence to jDE100 and DISHchain1e+12. The study underscores the QChOA’s reliability and adaptability, positioning it as a valuable technique for diverse and intricate optimization challenges in the field.

AUV path planning in a three-dimensional marine environment based on a novel multiple swarm co-evolutionary algorithm

Autonomous underwater vehicles (AUVs) are rapidly advancing in ocean exploration. High-performance path planning techniques are essential for AUVs. Path planning for AUVs is a multi-faceted challenge, necessitating careful consideration of safety, energy consumption and the influence of sea currents to ensure the development of a high-quality trajectory that satisfies all operational criteria. Existing path planning algorithms have problems such as incomplete consideration of influencing factors, computational complexity and weak applicability. Therefore, we propose a swarm intelligence optimisation algorithm based on multiple swarm co-evolution (MCO) to address the issue of AUV path planning in a three-dimensional marine environment. First, a three-dimensional marine environment model and the corresponding path evaluation mechanism are established. Second, the MCO rule is established to ensure that the MCO has balanced exploration and exploitation capabilities. A shared dynamic optimal particle between populations is introduced to ensure information exchange between populations. In addition, the cross-integration mutation strategy has been proposed for promoting the fusion of two populations of superior genes to ensure the inheritance of superior paternal genes to the offspring. Finally, four comparison experiments are designed, and the experiments compare eight commonly used intelligent search algorithms and improved versions. The results of the experiments proved that the MCO has excellent three-dimensional marine environment path planning capability, with robustness and search capabilities superior to other swarm intelligence optimisation algorithms.

Disturbance rejecting PID-FF controller design of a non-ideal buck converter using an innovative snake optimizer with pattern search algorithm

The optimal design of a proportional-integral-derivative controller with two cascaded first-order low-pass filters (PID-FF) for non-ideal buck converters faces significant challenges, including effective disturbance rejection, robustness to parameter variations, and the mitigation of high-frequency signal noise, with existing approaches often struggling and leading to suboptimal performance in practical applications. This study addresses these challenges by introducing a constraint on the open-loop crossover frequency to mitigate high-frequency noise and ensuring the controller prioritizes maintaining constant output voltage and robust responsiveness to input voltage and load current variations. This study also introduces an innovative metaheuristic algorithm, the opposition-based snake optimizer with pattern search (OSOPS), designed to address these limitations. OSOPS enhances the Snake Optimizer (SO) by integrating opposition-based learning (OBL) and Pattern Search (PS), thereby improving its exploration and exploitation capabilities. The proposed algorithm design includes a crossover frequency constraint aimed at counteracting high-frequency noise and ensuring robust performance under diverse disturbances. The efficacy of the OSOPS algorithm is demonstrated through rigorous statistical box plot analysis and convergence response comparisons with the original SO algorithm. Additionally, we systematically compare the performance of the OSOPS-based PID–FF–controlled non-ideal buck converter system against systems utilizing the original SO algorithm and the classical pole placement (PP) method. This evaluation encompasses transient and frequency responses, disturbance rejection, and robustness analysis. The results reveal that the OSOPS-based system outperforms the SO- and PP-based systems with 14.21 % and 32.10 % faster rise times, along with 15.38 % and 84.95 % faster settling times, respectively. The OSOPS and SO systems also exhibit higher bandwidths, exceeding the PP-based system by 18.74 % and 17.03 %, respectively. By addressing the key challenges in PID-FF controller design for non-ideal buck converters, this study provides a substantial advancement in control strategy, promising enhanced performance in practical applications.

A memory interaction quadratic interpolation whale optimization algorithm based on reverse information correction for high-dimensional feature selection

Feature selection is a key technique for data dimensionality reduction, and there are many challenges in facing the exponential expansion phenomenon of high-dimensional decision space. In order to improve the quality of feature selection, we propose a memory interaction quadratic interpolation whale optimization algorithm based on reverse information correction (RQWOA). First, in order to improve the convergence capability of the Whale Optimization Algorithm (WOA) in high-dimensional space, we propose a quadratic interpolation mechanism with memory information interaction, improve the quality of the datum points used for quadratic interpolation through the proposed memory interaction mechanism, and accelerate the convergence speed and accuracy of the algorithm with the help of the quadratic interpolation on the algorithm exploitation capability. In addition, to address the invalid probability flip in the feature selection subset when mapping to the discrete space, we propose a reverse information correction mechanism to judge and correct each dimension in the feature subset by using the reverse complementary information provided by individuals with poor fitness values in the population, so as to better remove invalid or redundant features and improve the quality of feature selection. Finally, in the 15 high-dimensional feature datasets compared with the comparison methods, the accuracy of RQWOA is improved by 7.49 % on average, and the number of features is compressed by 80.42 % on average, which indicates that the RQWOA algorithm has stronger feature identification and redundancy removal capabilities and can better solve the feature selection problem.

Modified snake optimizer based multi-level thresholding for color image segmentation of agricultural diseases

Image segmentation is crucial for early identification and diagnosis of crop diseases in agriculture. It helps identify disease areas and characteristics, laying the groundwork for disease diagnosis and treatment. However, color image thresholding segmentation method faces challenges in finding the optimal threshold as the number of thresholds increases, which affects segmentation quality. In this paper, a modified snake optimizer (MSO) is proposed to address the color image thresholding segmentation problem using Kapur’s entropy as the objective function. MSO incorporates a dynamic adaptive parameter adjustment method. The improved global position update formula introduces guidance from the optimal individual and disturbance from random individuals, effectively achieving a balance between global and local search capabilities. A dynamic parameter adjustment method is added to accelerate convergence speed during snake movement to food. Lévy flight is introduced to the Flight mode to help the algorithm escape local extremums. A balancing strategy is implemented in the Mating mode, incorporating guidance from the optimal individual and information exchange between sub-populations, enabling balanced exploration and local exploitation capabilities. The hill-climbing jump operation for the optimal individual is added to help the algorithm overcome local stagnation. The proposed MSO is evaluated on CEC 2017 test functions and color test images, and the obtained results are compared with other segmentation methods and other intelligent optimization algorithms. The results demonstrate that MSO exhibits stable and excellent performance in both complex global optimization problems and color image thresholding segmentation problems. Finally, MSO is applied to segment rice disease images, and the results reveal significantly better segmentation performance compared to other algorithms. MSO shows great potential in solving the thresholding segmentation problem for agricultural disease images, thereby assisting in the accurate identification, diagnosis, and treatment of agricultural diseases and insect pests.

Credit card fraud detection using the brown bear optimization algorithm

Fraud detection in banking systems is crucial for financial stability, customer protection, reputation management, and regulatory compliance. Machine Learning (ML) is vital in improving data analysis, real-time fraud detection, and developing fraud techniques by learning from data and adjusting detection strategies accordingly. Feature Selection (FS) is essential for enhancing fraud detection through ML to achieve optimal model accuracy. This is because it helps to eliminate the negative impact of redundant and irrelevant attributes. To enhance the accuracy of the given dataset, the researchers utilized multiple methods to determine the most fitting features. However, it is important to note that when implementing these methods on datasets with larger feature sizes, they may encounter issues with local optimality. Despite this, the researchers continue to work on improving the effectiveness of these methods. This study presents an effective methodology based on the Brown-Bear Optimization (BBO) algorithm to enhance the capacity to accurately identify financial CCF transactions by recognizing pertinent features. BBO has balanced capabilities to reduce dimensionality while enhancing classification accuracy. It is improved by adjusting the positions randomly to enhance exploration and exploitation capabilities, and then it is cloned into a binary variant named Binary BBOA (BBBOA). The Support Vector Machine (SVM), k-nearest Neighbor (k-NN), and Xgb-tree are the ML classifiers used with the suggested methodology. On the Australian credit dataset, the proposed methodology is compared with the basic BBOA and ten current optimizers, such as Binary African Vultures Optimization (BAVO), Binary Salp Swarm Algorithm (BSSA), Binary Atom Search Optimization (BASO), Binary Henry Gas Solubility Optimization (BHGSO), Binary Harris Hawks Optimization (BHHO), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO), Binary Grasshopper Optimization Algorithm (BGOA), and Binary Sailfish Optimizer (BSFO). Regarding Wilcoxon’s rank-sum test (α=0.05), the superiority and effective consequence of the presented methodology are clear on the utilized dataset and got an accuracy of classification up to 91% in the utilized dataset combined with an attribute reduction length down to 67%. The proposed methodology is further validated using 10 benchmark datasets and outperformed its competitors in most utilized datasets regarding different performance measures. In the end, the proposed methodology is further validated using ten benchmark datasets from the UCI repository. It outperformed its competitors in most of the utilized datasets regarding different performance measures.

The role of lean, agility and learning ambidexterity in Industry 4.0 implementations

There is an increasing interest in understanding the interdependencies between conventional lean and agile implementations and Industry 4.0 technology adoptions. Our knowledge of how they interact and enable Industry 4.0 implementations in learning organisations is still immature. Informed by the Strategic Momentum Theory and the contextual ambidexterity framework, this paper empirically investigates the effects of lean and agile implementations on Industry 4.0 technology adoptions with exploratory and exploitative learning as mediators. Using the data collected from an online survey of 166 Australian firms and analysed using the PLS-SEM method, we found that only lean practices have significant and positive direct effects on Industry 4.0 implementations, and exploitative learning partially mediates the relationship. We also found that agility does not have direct effects on Industry 4.0 implementations, and exploitative learning fully mediates their relationship. However, the mediating role of exploratory learning is not empirically confirmed. This study confirms several recent exploratory research studies that found evidence for the significant role lean implementations play in Industry 4.0 technology adoption. Agile practices need to first translate into exploitative learning. The findings inform practitioners that firms with investments in lean, agility and exploitative learning capability development will have advantages in technology implementations.

Coopetition, exploration and exploitation capabilities, and growth performance in digital healthcare ventures.

Studies focusing on coopetition and dynamic capabilities have expanded significantly over the past several decades. Coopetition strategy and dynamic capabilities are increasingly recognised as sources of sustained competitive advantage. The purpose of this paper is to provide a better understanding of the factors driving growth performance in digital healthcare ventures by examining the role of coopetition, exploration and exploitation capabilities, and environmental uncertainty. While numerous studies have examined the competitive advantage of coopetition, its specific contribution to the growth of ventures in the digital realm remains less explored. Clarifying the strategic role of coopetition in driving growth performance is critical for delineating the intricate relationship between coopetition and growth performance, particularly in the context of digital healthcare ventures. To fill in this research gap, this study uses coopetition theory and dynamic capabilities theory to look at how exploration and exploitation capabilities, as well as environmental uncertainty, affect the relationship between coopetition and growth performance in digital healthcare ventures. We collected a total of 338 questionnaires from Chinese digital healthcare ventures between March 2023 and August 2023. We conducted data analysis using SPSS 26.0 and its macro-program PROCESS. Our results confirm that coopetition has a positive effect on growth performance in digital healthcare ventures. Furthermore, exploration and exploitation capabilities fully mediate the relationship between coopetition and growth performance. Moreover, environmental uncertainty significantly and distinctively moderates the impact of exploration and exploitation capabilities on growth performance. This study contributes to the existing literature by providing deeper insight into the relationship between coopetition and growth performance in digital healthcare ventures. It also offers important practical implications for public health improvement and socio-economic development.

Many-objective artificial hummingbird algorithm: an effective many-objective algorithm for engineering design problems

Abstract Many-objective optimization presents unique challenges in balancing diversity and convergence of solutions. Traditional approaches struggle with this balance, leading to suboptimal solution distributions in the objective space especially at higher number of objectives. This necessitates the need for innovative strategies to adeptly manage these complexities. This study introduces a Many-Objective Artificial Hummingbird Algorithm (MaOAHA), an advanced evolutionary algorithm designed to overcome the limitations of existing many-objective optimization methods. The objectives are to improve convergence rates, maintain solution diversity, and achieve a uniform distribution in the objective space. MaOAHA implements information feedback mechanism (IFM), reference point-based selection and association, non-dominated sorting, and niche preservation. The IFM utilizes historical data from previous generations to inform the update process, thereby improving the algorithm’s the exploration and exploitation capabilities. Reference point-based selection, along with non-dominated sorting, ensures solutions are both close to the Pareto front and evenly spread in the objective space. Niche preservation and density estimation strategies are employed to maintain diversity and prevent overcrowding. The comprehensive experimental analysis benchmarks MaOAHA against four leading algorithms viz. Many-Objective Gradient-Based Optimizer, Many-Objective Particle Swarm Optimizer, Reference Vector Guided Evolutionary Algorithm, and Nondominated Sorting Genetic Algorithm III. The DTLZ1–DTLZ7 benchmark sets with four, six, and eight objectives and five real-world problems (RWMaOP1–RWMaOP5) are considered for performance assessment of the selected algorithms. The results demonstrate that internal parameter-free MaOAHA significantly outperforms its counterparts, achieving better generational distance by up to 52.38%, inverse generational distance by up to 38.09%, spacing by up to 56%, spread by up to 71.42%, hypervolume by up to 44%, and runtime by up to 52%. These metrics affirm the MaOAHA’s capability to enhance the decision-making processes through its adept balance of convergence, diversity, and uniformity.

Heterogeneous pbest-guided comprehensive learning particle swarm optimization

The balance between exploration and exploitation in the particle swarm optimization (PSO) algorithm is often discussed but has not been well solved. To further improve the capabilities of exploration and exploitation in the search space, the aim of this study is to focus on a novel comprehensive learning strategy for the PSO algorithm, which is named the heterogeneous pbest-guided comprehensive learning particle swarm optimizer (HPBPSO). In this algorithm, the population is divided into two subpopulations. In the exploration subpopulation, a pbest-guided mechanism is designed for obtaining better particles’ personal best information. Meanwhile, the non-elite personal best particles learn from elite personal best particles by using dynamic crossover strategy. In the exploitation subpopulation, in order to fully leverage the benefits of learning from high-quality individuals, the learning process is divided into two distinct categories: elite individual learning and intragroup learning. Furthermore, intergroup perturbation is designed to accelerate convergence performance. The experiments on classical functions are firstly used to verify the effectiveness and mutuality of the proposed strategies. Moreover, the performance of the proposed algorithm is evaluated on two well-known benchmarks and medical image segmentation problem. According to the statistical results, the HPBPSO algorithm is not only better than the other existing state-of-the-art PSO variants and metaheuristic evolutionary algorithms, but also applicable to real-world optimization problems.

A multi-strategy driven reinforced hierarchical operator in the grey wolf optimizer for feature selection

In this study, a multi-strategy driven reinforced hierarchical operator for a grey wolf optimizer (RHGWO) is proposed to solve the feature selection (FS) problem, whereby tedious data are converted into information and often modeled as a combinatorial optimization problem. First, a multi-strategy mechanism is proposed to provide the GWO algorithm with exploration capabilities, including memory-based diversity and Lévy flight-based extension search. Next, a hierarchical segmentation technique is proposed to allocate exploration and exploitation, thereby providing exploration capability for superior wolves to search diverse regions and exploitation capability for inferior wolves to converge to the promising area. Subsequently, a chaotic elite learning strategy is designed for leaders to prevent misdirection. Finally, a more rational nonlinear parameter transformation is designed. Multiple experiments validate the adaptability and versatility of the proposed RHGWO algorithm.