Exploration Capabilities Research Articles

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.

Achieving accurate trajectory predicting and tracking for autonomous vehicles via reinforcement learning-assisted control approaches

In complex urban traffic scenarios, autonomous vehicles face significant challenges in adapting to diverse and dynamic traffic conditions. Reward-based reinforcement learning has emerged as an effective approach to tackle these challenges. This paper presents a novel method that combines deep reinforcement learning with automotive dynamics systems. Building upon the Double Deep Q-learning algorithm, our approach integrates a Recurrent Neural Network with Gated Recurrent Units to enhance the environmental exploration capabilities of autonomous vehicles. To obtain more precise reward values, we introduce a trajectory tracking algorithm based on a combination of proportional-integral-derivative control and feedforward control within the automotive dynamics system. The proportional-integral-derivative controller is utilized for longitudinal control, while the Error-Optimized feedforward controller enhances lateral control, thereby improving trajectory tracking accuracy. Finally, extensive simulation experiments are conducted to evaluate the proposed method, comparing it against other baseline methods in terms of vehicle following and lane-changing scenarios. The results demonstrate that our approach significantly improves both the reward values and control performance of the algorithm.

Enhancing slime mould algorithm for engineering optimization: leveraging covariance matrix adaptation and best position management

Abstract The slime mould algorithm (SMA), as an emerging and promising swarm intelligence algorithm, has been studied in various fields. However, SMA suffers from issues such as easily getting trapped in local optima and slow convergence, which pose challenges when applied to practical problems. Therefore, this study proposes an improved SMA, named HESMA, by incorporating the covariance matrix adaptation evolution strategy (CMA-ES) and storing the best position of each individual (SBP). On one hand, CMA-ES enhances the algorithm’s local exploration capability, addressing the issue of the algorithm being unable to explore the vicinity of the optimal solution. On the other hand, SBP enhances the convergence speed of the algorithm and prevents it from diverging to other inferior solutions. Finally, to validate the effectiveness of our proposed algorithm, this study conducted experiments on 30 IEEE CEC 2017 benchmark functions and compared HESMA with 12 conventional metaheuristic algorithms. The results demonstrated that HESMA indeed achieved improvements over SMA. Furthermore, to highlight the performance of HESMA further, this study compared it with 13 advanced algorithms, and the results showed that HESMA outperformed these advanced algorithms significantly. Next, this study applied HESMA to five engineering optimization problems, and the experimental results revealed that HESMA exhibited significant advantages in solving real-world engineering optimization problems. These findings further support the effectiveness and practicality of our algorithm in addressing complex engineering design challenges.

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.

Equilibrium optimizer-based harmony search algorithm with nonlinear dynamic domains and its application to real-world optimization problems

Harmony Search (HS) algorithm is a swarm intelligence algorithm inspired by musical improvisation. Although HS has been applied to various engineering problems, it faces challenges such as getting trapped in local optima, slow convergence speed, and low optimization accuracy when applied to complex problems. To address these issues, this paper proposes an improved version of HS called Equilibrium Optimization-based Harmony Search Algorithm with Nonlinear Dynamic Domains (EO-HS-NDD). EO-HS-NDD integrates multiple leadership-guided strategies from the Equilibrium Optimizer (EO) algorithm, using harmony memory considering disharmony and historical harmony memory, while leveraging the hidden guidance direction information from the Equilibrium Optimizer. Additionally, the algorithm designs a nonlinear dynamic convergence domain to adaptively adjust the search space size and accelerate convergence speed. Furthermore, to balance exploration and exploitation capabilities, appropriate adaptive adjustments are made to Harmony Memory Considering Rate (HMCR) and Pitch Adjustment Rate (PAR). Experimental validation on the CEC2017 test function set demonstrates that EO-HS-NDD outperforms HS and nine other HS variants in terms of robustness, convergence speed, and optimization accuracy. Comparisons with advanced versions of the Differential Evolution (DE) algorithm also indicate that EO-HS-NDD exhibits superior solving capabilities. Moreover, EO-HS-NDD is applied to solve 15 real-world optimization problems from CEC2020 and compared with advanced algorithms from the CEC2020 competition. The experimental results show that EO-HS-NDD performs well in solving real-world optimization problems.

Multi-subswarm cooperative particle swarm optimization algorithm and its application

Particle swarm optimization (PSO) is a classical evolutionary algorithm and has been widely used to solve continuous optimization problems. However, the performance of the PSO algorithm is highly sensitive to its control parameters and learning strategies. To address this problem, a multi-subswarm cooperative particle swarm optimization algorithm (MSC-PSO) is proposed in this paper. In MSC-PSO, firstly, a population muti-subswarm division method is designed to enhance the global exploration capability. Secondly, a level-based particle adaptive inertia weight strategy is introduced to adjust control parameters. Finally, a level-based update learning mechanism is used for particles adaptive selection learning strategy. The performance of the MSC-PSO is evaluated by the CEC2020 test suite, and five heuristic algorithms are compared with the MSC-PSO in the experiments. The experimental results demonstrate that the proposed MSC-PSO algorithm has significant advantages in terms of convergence speed and solving optimal solutions. Furthermore, the proposed MSC-PSO algorithm is used to solve the plant protection unmanned aerial vehicles (UAV) path planning problem. The experimental results proved that the proposed MSC-PSO algorithm effectively solves the real-world UAV path planning problem, and achieves at most a 34 % reduction in round-trip distance and a 24.1 % reduction in total non-spraying time compared to classical PSO.

Rolling bearing fault diagnosis based on DRS frequency spectrum image and improved DQN

Deep learning may encounter challenges in fault diagnosis, such as exploration capability, long-term planning, and handling non-deterministic factors. The paper introduces a novel fault diagnosis method for rolling bearings combining deep Q-network (DQN) with discrete random separation (DRS) frequency spectrum images. DRS can be used to separate the deterministic components and random components of the fault signal and extract the fault feature very effectively. The improved DQN incorporates the atrous spatial pyramid pooling module for multiscale contextual fault feature extraction, enhancing diagnosis accuracy. Various deep networks, including convolutional neural network, ResNet18, traditional DQN, and the improved DQN, are employed with different frequency spectrum images (power spectral density, cepstrum, and DRS) for diagnosing bearing faults. Simulation results demonstrate that combining DRS frequency spectrum images with the improved DQN enhances fault diagnosis accuracy across diverse conditions. Generalization tests reveal strong capability of the proposed method in handling conditions different from the training data. Validation tests on difficult-to-diagnose fault data from the CWRU-bearing dataset demonstrate commendable performance of the improved DQN, even on difficult datasets. Finally, validation tests using the XJTU–SY bearing dataset reaffirm the excellent performance and robust adaptability of the improved DQN in conjunction with DRS frequency spectrum images.

A Hybrid Equilibrium Optimizer Based on Moth Flame Optimization Algorithm to Solve Global Optimization Problems

Abstract Equilibrium optimizer (EO) is a novel metaheuristic algorithm that exhibits superior performance in solving global optimization problems, but it may encounter drawbacks such as imbalance between exploration and exploitation capabilities, and tendency to fall into local optimization in tricky multimodal problems. In order to address these problems, this study proposes a novel ensemble algorithm called hybrid moth equilibrium optimizer (HMEO), leveraging both the moth flame optimization (MFO) and EO. The proposed approach first integrates the exploitation potential of EO and then introduces the exploration capability of MFO to help enhance global search, local fine-tuning, and an appropriate balance during the search process. To verify the performance of the proposed hybrid algorithm, the suggested HMEO is applied on 29 test functions of the CEC 2017 benchmark test suite. The test results of the developed method are compared with several well-known metaheuristics, including the basic EO, the basic MFO, and some popular EO and MFO variants. Friedman rank test is employed to measure the performance of the newly proposed algorithm statistically. Moreover, the introduced method has been applied to address the mobile robot path planning (MRPP) problem to investigate its problem-solving ability of real-world problems. The experimental results show that the reported HMEO algorithm is superior to the comparative approaches.

Inverse Hessian by stochastic projection and application to system identification in nonlinear mechanics of solids

Parameter identification in nonlinear mechanics of solids, a class of non-convex optimization problems of significant interest, often has to balance fast convergence with enhanced exploration. Local optimization schemes based on Newton or quasi-Newton updates cannot tread this fine balance. A similar limitation also applies to many derivative-free global evolutionary searches that typically end up with slower convergence. Notwithstanding a relatively rapid convergence around a local optimum, schemes using classical gradients require that the objective function be smooth. Thus, applied to real-world scenarios, these algorithms face challenges such as non-smoothness including discontinuities in the objective function and costly evaluations of gradients or Hessians, whenever possible. Based on a novel stochastic projection to estimate inverse Hessians, this work aims at generalizing a fast Newton-type local search whilst retaining capabilities of noise-assisted exploration in non-convex optimization. In principle, such a meeting of the best of both worlds in optimization should provide for a powerful paradigm shift, offering a versatile and robust tool for solving complex identification and variational problems arising in nonlinear mechanics of solids. The approach is well-suited even for cases where the objective function is implicitly defined and not amenable to explicit evaluation. In a first implementation of our proposal, we assess its performance against a few benchmark non-convex problems. Finally, we solve a parameter estimation problem for an isotropic and incompressible hyperelastic material.

A Kepler optimization algorithm improved using a novel Lévy-Normal mechanism for optimal parameters selection of proton exchange membrane fuel cells: A comparative study

Proton exchange membrane fuel cells (PEMFCs) are considered a promising renewable energy source and have sparked a lot of interest over the last few years due to their robust efficiency, low operating temperature, and longevity. The PEMFC's electrochemical model has seven unknown parameters, which are not given in the manufacturer's datasheets and need to be accurately estimated to present a more accurate model, leading to improved efficiency and performance of the PEMFC systems. The estimation of those unknown parameters has been dealt with as a complex and non-linear optimization problem that needs a powerful optimization algorithm to solve it. The existing optimization algorithms still have some disadvantages, such as falling into local minima and low convergence speed, which make them ineligible to solve this complicated problem with acceptable accuracy and low computational cost. Therefore, this study presents a new parameter estimation technique for estimating the unknown parameters of the PEMFC model more accurately, thereby achieving precise modeling of PEMFCs. This technique called IKOA is based on integrating the Kepler optimization algorithm (KOA) with a novel Lévy-Normal (LN) mechanism to strengthen its exploration and exploitation capabilities against this multimodal optimization problem. The Lévy flight in this mechanism aims to improve the KOA's exploitation operator to accelerate the convergence speed toward the near-optimal solution, thus minimizing the computational cost; meanwhile, the normal distribution is used to strengthen its exploration operator, thereby aiding in the escape of local minima. The proposed IKOA and KOA are herein evaluated against several rival algorithms using six well-known commercial PEMFC stacks to highlight their efficiency and effectiveness. Key performance metrics such as computational cost, fitness measures, and statistical validation through the Wilcoxon rank-sum test are herein used to highlight IKOA's effective performance in enhancing the predictive accuracy and operational efficiency of PEMFCs. The numerical findings show the high superiority of IKOA against all rival optimizers on all solved benchmarks.

A hybrid optimization approach for strategically placing electric vehicle charging stations in a radial distribution IEEE-33 bus system

The main objective of this study is to demonstrate the effectiveness of using Hybrid Particle Swarm Optimization (HPSO), a unique methodology, to optimize an IEEE-33 bus system for optimal placement of electric vehicles. This methodology has been specifically designed to effectively regulate voltage fluctuations while reducing power dissipation. The exploration capabilities of PSO and the exploitation capabilities of SA make HPSO a robust algorithm for a specific objective function. HPSO has shown superior performance compared to current traditional methods after careful study. Simulation results illustrate power loss reductions ranging from 1.01% to 8.21% compared to various metaheuristic methodologies. The inclusion of this approach demonstrates that combining the capabilities of PSO and SA facilitates the development of a highly efficient optimization framework by combining their stochastic search and fast convergence capabilities. This methodology not only sets innovative benchmarks for power system development, but also represents a significant paradigm shift in managing and improving durable and efficient electrical networks.

Evolutionary reinforcement learning with action sequence search for imperfect information games

Deep Reinforcement Learning (DRL) has achieved remarkable success in perfect information games. However, when applied to imperfect information games like Contract Bridge, DRL faces challenges not only from unobservable partial information but also from the lack of efficient exploration. Although several Evolutionary Reinforcement Learning algorithms (ERLs) have harnessed Evolutionary Algorithms (EAs) to enhance exploration capabilities, the practical performance of EAs is limited either by the high-dimensional parameter space or possibly inaccurate guidance from value networks. In this paper, we introduce a novel ERL algorithm that employs the Particle Swarm Optimization (PSO) algorithm to search for superior action sequences, thereby aiding agents in exploring uncharted territory. We conduct the search in action space and evaluate action sequences through interactions with the environment to avoid the limitations of parameter space and value networks, respectively. The diverse experiences collected in the search and evaluation can boost the learning of the DRL agent. In addition, the action sequence search is executed only when the agent converges to local optima, which can reduce the overall cost of action evaluation and avoid influencing the optimization process of DRL. Through experimental comparisons conducted on Contract Bridge, our method demonstrates superior performance when compared with several state-of-the-art DRL and ERL algorithms. Furthermore, we utilize our method in the Bridge Competition of AAMAS 2023 Imperfect Information Card Games Competition and rank the first.

Intra-organizational knowledge sharing, ambidexterity and firm performance: evaluating the role of knowledge quality

PurposeThis study aims to examine how knowledge sharing contributes to organizations’ ambidexterity, their overall performance and the role of knowledge quality in this relationship. Knowledge sharing is conceptualized based on tacit and explicit dimensions, and ambidexterity is viewed as comprising exploitative and explorative capabilities.Design/methodology/approachThis study uses a cross-sectional survey-based research design and structural equation modeling to test the proposed model of knowledge sharing and knowledge quality in organizational ambidexterity and the related hypotheses.FindingsThe results indicate that tacit knowledge sharing has a significant, direct impact on the exploitative and explorative capabilities of the organization and indirectly impacts both dimensions of ambidexterity (i.e. exploitative and explorative) through knowledge quality. In contrast, explicit knowledge sharing does not have a significant impact on knowledge quality and affects only the exploitative extent of ambidexterity. Both exploitative and explorative capabilities significantly impact organizational performance.Originality/valueTo the best of the authors’ knowledge, this study is the first study to empirically examine the role of knowledge quality in the context of knowledge sharing for ambidexterity, especially within the context of organizations in the United Arab Emirates.

Hybrid feature selection method for predicting software defect

To address the challenges associated with the abundance of features in software datasets, this study proposes a novel hybrid feature selection method that combines quantum particle swarm optimization (QPSO) and principal component analysis (PCA). The objective is to identify a subset of relevant features that can effectively contribute to the accuracy of a predictive model based on an artificial neural network (ANN). The quantum particle swarm optimization algorithm is employed to optimize the selection of features by simulating the behavior of quantum particles in a search space. This approach enhances the exploration and exploitation capabilities, allowing for a more effective identification of relevant features. Furthermore, principal component analysis is integrated into the hybrid method to reduce dimensionality and remove multicollinearity among features, thereby improving the efficiency of the feature selection process. The proposed hybrid method is applied to software defect datasets, where the selected subset of features is fed into an artificial neural network for defect prediction. The performance of the hybrid model is compared with traditional feature selection methods, standalone QPSO, and PCA. Experimental results demonstrate the effectiveness of the hybrid approach in achieving superior predictive accuracy while reducing the dimensionality of the dataset. The proposed approach not only enhances prediction accuracy but also provides a more interpretable and efficient subset of features for building robust defect prediction models.

Hybrid Genetic Algorithm and CMA-ES Optimization for RNN-Based Chemical Compound Classification

The compound classification strategies addressed in this study encounter challenges related to either low efficiency or accuracy. Precise classification of chemical compounds from SMILES symbols holds significant importance in domains such as drug discovery, materials science, and environmental toxicology. In this paper, we introduce a novel hybrid optimization framework named GA-CMA-ES which integrates Genetic Algorithms (GA) and the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) to train Recurrent Neural Networks (RNNs) for compound classification. Leveraging the global exploration capabilities og GAs and local exploration abilities of the CMA-ES, the proposed method achieves notable performance, attaining an 83% classification accuracy on a benchmark dataset, surpassing the baseline method. Furthermore, the hybrid approach exhibits enhanced convergence speed, computational efficiency, and robustness across diverse datasets and levels of complexity.

Particle Swarm Optimization Algorithm Using Velocity Pausing and Adaptive Strategy

Particle swarm optimization (PSO) as a swarm intelligence-based optimization algorithm has been widely applied to solve various real-world optimization problems. However, traditional PSO algorithms encounter issues such as premature convergence and an imbalance between global exploration and local exploitation capabilities when dealing with complex optimization tasks. To address these shortcomings, an enhanced PSO algorithm incorporating velocity pausing and adaptive strategies is proposed. By leveraging the search characteristics of velocity pausing and the terminal replacement mechanism, the problem of premature convergence inherent in standard PSO algorithms is mitigated. The algorithm further refines and controls the search space of the particle swarm through time-varying inertia coefficients, symmetric cooperative swarms concepts, and adaptive strategies, balancing global search and local exploitation. The performance of VASPSO was validated on 29 standard functions from Cec2017, comparing it against five PSO variants and seven swarm intelligence algorithms. Experimental results demonstrate that VASPSO exhibits considerable competitiveness when compared with 12 algorithms. The relevant code can be found on our project homepage.

Multi-objective fuzzy green scheduling optimization method of special vehicle body-in-white prototype shop considering equipment preventive maintenance

Based on the advantages of non-contact, flexibility, and small heat-affected zone, laser processing technology is widely used in material removal, addition, modification and other manufacturing fields. However, the emission of large amounts of smoke during laser processing of metal materials will result in environmental pollution in the job shop. Additionally, the processing time of laser equipment becomes uncertain as the power decays with prolonged use. Therefore, this paper is mainly focus on a multi-objective flexible job shop fuzzy green scheduling problem to minimize the fuzzy makespan, fuzzy total energy consumption and fuzzy total smoke emission. To solve it, an improved multi-objective particle swarm optimization algorithm has been designed. Firstly, a preventive maintenance strategy is proposed to reduce the makespan and equipment failure frequency by considering periodic power attenuation of laser equipment. Next, different particle updating strategies are employed to enhance particles’ exploration capabilities. Subsequently, five neighborhood structures are introduced to improve the performance of local search. Finally, comparison experiments are conducted with an expanded common benchmark, and a production case study in a special vehicle body-in-white prototype job shop. The results effectively demonstrate the feasibility and effectiveness of the developed model and improved multi-objective particle swarm optimization algorithm.

New PID parameter tuning based on improved dung beetle optimization algorithm

AbstractIn this paper, a proportional‐integral‐derivative (PID) controller parameter optimization method based on the improved dung beetle optimization (IDBO) algorithm is proposed, which improves the balance between the global exploration and local exploitation capabilities of the dung beetle optimization (DBO) and significantly enhances the convergence speed and optimization accuracy. Initially, the dung beetle population is initialized using piecewise linear chaotic map (PWLCM) chaotic mapping in order to increase its variety and the DBO algorithm's capacity for global exploration. Furthermore, adaptive weighting in the DBO algorithm is now balanced between the capabilities of local exploitation and global exploration with the addition of adaptive weights. After that, in order to improve the DBO algorithm's capacity for local exploitation, a triangle wandering strategy is included during the dung beetle reproductive phase. Finally, using both Lévy flying wandering and greedy strategy (GS) together make it easier to take advantage of opportunities in both local and global areas. The outcomes of the traditional benchmark function test demonstrate a significant improvement in both convergence speed and optimization accuracy when the particle swarm optimization (PSO), DBO, grey wolf optimization (GWO), and sparrow search algorithm (SSA) algorithms are compared. The performance index function incorporates an overshooting penalty term to prevent the overshooting phenomenon in the control system. Simulation experiments are carried out for the DC motor control system, and the time domain performance, frequency domain performance, and robustness performance of the closed‐loop control system with ZN‐PID, Lambda‐PID, PSO‐PID, and IDBO‐PID rectified PID controller parameters are comparatively analyzed, which verifies the validity and practicability of the IDBO algorithm.

Meta‐heuristic optimization techniques for scheduling in multiple‐input multiple‐output multiple‐access channel system

SummaryIn a highly dense multiple‐input multiple‐output (MIMO) communication system, proper resource allocation is exceedingly challenging. The simultaneous selection of antennas at the base‐station (BS) and scheduling of users in an uplink multiple access channel (MAC) system add up to the signal processing load in the MIMO wireless system. The method chosen for combining the user scheduling and antenna selection must have a very low computational complexity. However, the exhaustive search algorithm (ESA), which achieves the best sum‐rate capacity in a MIMO‐MAC system, has a very high level of complexity. In this paper, we use a metaheuristic‐based optimization algorithms to optimize the sum‐rate capacity in a MAC system with significantly less computational complexity. First, we use the beluga whale optimization (BWO) metaheuristic method to solve the optimization problem. The BWO is a swarm‐based algorithm that draws inspiration from beluga whale behavior. An improved BWO (iBWO) is also presented and is utilized for the same optimization challenge. The proposed iBWO scheme improves the search capability of the algorithm and thereby ensures better exploration and exploitation capabilities of the beluga whales. We compare the performance of these algorithms with a standard differential evolution (DE) algorithm. The simulation results demonstrate that the proposed iBWO is a very competitive meta‐heuristic algorithm for solving optimization problems. The proposed iBWO algorithm achieves near optimal throughput in a MIMO‐MAC system. Also, the computational complexity related to the suggested optimization technique in a MIMO‐MAC system is found to be very less compared with the complexity related to ESA.