An Optimized System of Random Forest Model by Global Harmony Search with Generalized Opposition-Based Learning for Forecasting TBM Advance Rate

As massive underground projects have become popular in dense urban cities,a problem has arisen:which model predicts the best for Tunnel Boring Machine(TBM)performance in these tunneling projects?However,performance level of TBMs in complex geological conditions is still a great challenge for practitioners and researchers.On the other hand,a reliable and accurate prediction of TBM performance is essential to planning an applicable tunnel construction schedule.The performance of TBM is very difficult to estimate due to various geotechnical and geological factors and machine specifications.The previously-proposed intelligent techniques in this field are mostly based on a single or base model with a low level of accuracy.Hence,this study aims to introduce a hybrid randomforest(RF)technique optimized by global harmony search with generalized oppositionbased learning(GOGHS)for forecasting TBM advance rate(AR).Optimizing the RF hyper-parameters in terms of,e.g.,tree number and maximum tree depth is the main objective of using the GOGHS-RF model.In the modelling of this study,a comprehensive databasewith themost influential parameters onTBMtogetherwithTBM AR were used as input and output variables,respectively.To examine the capability and power of the GOGHSRF model,three more hybrid models of particle swarm optimization-RF,genetic algorithm-RF and artificial bee colony-RF were also constructed to forecast TBM AR.Evaluation of the developed models was performed by calculating several performance indices,including determination coefficient(R2),root-mean-square-error(RMSE),and mean-absolute-percentage-error(MAPE).The results showed that theGOGHS-RF is a more accurate technique for estimatingTBMAR compared to the other applied models.The newly-developedGOGHS-RFmodel enjoyed R2=0.9937 and 0.9844,respectively,for train and test stages,which are higher than a pre-developed RF.Also,the importance of the input parameters was interpreted through the SHapley Additive exPlanations(SHAP)method,and it was found that thrust force per cutter is the most important variable on TBMAR.The GOGHS-RF model can be used in mechanized tunnel projects for predicting and checking performance.

Enhancing Renewable Energy Integration:A Gaussian-Bare-Bones Levy Cheetah Optimization Approach to Optimal Power Flow in Electrical Networks

In the contemporary era,the global expansion of electrical grids is propelled by various renewable energy sources(RESs).Efficient integration of stochastic RESs and optimal power flow(OPF)management are critical for network optimization.This study introduces an innovative solution,the Gaussian Bare-Bones Levy Cheetah Optimizer(GBBLCO),addressing OPF challenges in power generation systems with stochastic RESs.The primary objective is to minimize the total operating costs of RESs,considering four functions:overall operating costs,voltage deviation management,emissions reduction,voltage stability index(VSI)and power loss mitigation.Additionally,a carbon tax is included in the objective function to reduce carbon emissions.Thorough scrutiny,using modified IEEE 30-bus and IEEE 118-bus systems,validates GBBLCO’s superior performance in achieving optimal solutions.Simulation results demonstrate GBBLCO’s efficacy in six optimization scenarios:total cost with valve point effects,total cost with emission and carbon tax,total cost with prohibited operating zones,active power loss optimization,voltage deviation optimization and enhancing voltage stability index(VSI).GBBLCO outperforms conventional techniques in each scenario,showcasing rapid convergence and superior solution quality.Notably,GBBLCO navigates complexities introduced by valve point effects,adapts to environmental constraints,optimizes costs while considering prohibited operating zones,minimizes active power losses,and optimizes voltage deviation by enhancing the voltage stability index(VSI)effectively.This research significantly contributes to advancing OPF,emphasizing GBBLCO’s improved global search capabilities and ability to address challenges related to local minima.GBBLCO emerges as a versatile and robust optimization tool for diverse challenges in power systems,offering a promising solution for the evolving needs of renewable energy-integrated power grids.

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

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

Optimizing Memory Access Efficiency in CUDA Kernel via Data Layout Technique

Over the past decade, Graphics Processing Units (GPUs) have revolutionized high-performance computing, playing pivotal roles in advancing fields like IoT, autonomous vehicles, and exascale computing. Despite these advancements, efficiently programming GPUs remains a daunting challenge, often relying on trial-and-error optimization methods. This paper introduces an optimization technique for CUDA programs through a novel Data Layout strategy, aimed at restructuring memory data arrangement to significantly enhance data access locality. Focusing on the dynamic programming algorithm for chained matrix multiplication—a critical operation across various domains including artificial intelligence (AI), high-performance computing (HPC), and the Internet of Things (IoT)—this technique facilitates more localized access. We specifically illustrate the importance of efficient matrix multiplication in these areas, underscoring the technique’s broader applicability and its potential to address some of the most pressing computational challenges in GPU-accelerated applications. Our findings reveal a remarkable reduction in memory consumption and a substantial 50% decrease in execution time for CUDA programs utilizing this technique, thereby setting a new benchmark for optimization in GPU computing.

Optimizing wind farm layout for enhanced electricity extraction using a new hybrid PSO-ANN method

With the growing need for renewable energy,wind farms are playing an important role in generating clean power from wind resources.The best wind turbine architecture in a wind farm has a major influence on the energy extraction efficiency.This paper describes a unique strategy for optimizing wind turbine locations on a wind farm that combines the capabilities of particle swarm optimization(PSO)and artificial neural networks(ANNs).The PSO method was used to explore the solution space and develop preliminary turbine layouts,and the ANN model was used to fine-tune the placements based on the predicted energy generation.The proposed hybrid technique seeks to increase energy output while considering site-specific wind patterns and topographical limits.The efficacy and superiority of the hybrid PSO-ANN methodology are proved through comprehensive simulations and comparisons with existing approaches,giving exciting prospects for developing more efficient and sustainable wind farms.The integration of ANNs and PSO in our methodology is of paramount importance because it leverages the complementary strengths of both techniques.Furthermore,this novel methodology harnesses historical data through ANNs to identify optimal turbine positions that align with the wind speed and direction and enhance energy extraction efficiency.A notable increase in power generation is observed across various scenarios.The percentage increase in the power generation ranged from approximately 7.7%to 11.1%.Owing to its versatility and adaptability to site-specific conditions,the hybrid model offers promising prospects for advancing the field of wind farm layout optimization and contributing to a greener and more sustainable energy future.

Multi-Stage Multidisciplinary Design Optimization Method for Enhancing Complete Artillery Internal Ballistic Firing Performance

To enhance the comprehensive performance of artillery internal ballistics—encompassing power,accuracy,and service life—this study proposed a multi-stage multidisciplinary design optimization(MS-MDO)method.First,the comprehensive artillery internal ballistic dynamics(AIBD)model,based on propellant combustion,rotation band engraving,projectile axial motion,and rifling wear models,was established and validated.This model was systematically decomposed into subsystems from a system engineering perspective.The study then detailed the MS-MDO methodology,which included Stage I(MDO stage)employing an improved collaborative optimization method for consistent design variables,and Stage II(Performance Optimization)focusing on the independent optimization of local design variables and performance metrics.The methodology was applied to the AIBD problem.Results demonstrated that the MS-MDO method in Stage I effectively reduced iteration and evaluation counts,thereby accelerating system-level convergence.Meanwhile,Stage II optimization markedly enhanced overall performance.These comprehensive evaluation results affirmed the effectiveness of the MS-MDO method.

A Subdivision-Based Combined Shape and Topology Optimization in Acoustics

We propose a combined shape and topology optimization approach in this research for 3D acoustics by using the isogeometric boundary element method with subdivision surfaces.The existing structural optimization methods mainly contain shape and topology schemes,with the former changing the surface geometric profile of the structure and the latter changing thematerial distribution topology or hole topology of the structure.In the present acoustic performance optimization,the coordinates of the control points in the subdivision surfaces fine mesh are selected as the shape design parameters of the structure,the artificial density of the sound absorbing material covered on the structure surface is set as the topology design parameter,and the combined topology and shape optimization approach is established through the sound field analysis of the subdivision surfaces boundary element method as a bridge.The topology and shape sensitivities of the approach are calculated using the adjoint variable method,which ensures the efficiency of the optimization.The geometric jaggedness and material distribution discontinuities that appear in the optimization process are overcome to a certain degree by the multiresolution method and solid isotropic material with penalization.Numerical examples are given to validate the effectiveness of the presented optimization approach.

BHJO: A Novel Hybrid Metaheuristic Algorithm Combining the Beluga Whale, Honey Badger, and Jellyfish Search Optimizers for Solving Engineering Design Problems

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.

An Optimal Node Localization in WSN Based on Siege Whale Optimization Algorithm

Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.

An Improved JSO and Its Application in Spreader Optimization of Large Span Corridor Bridge

In this paper,given the shortcomings of jellyfish search algorithmwith low search ability in the early stage and easy to fall into local optimal solution,this paper introduces adaptive weight function and elite strategy,improving the global search scope in the early stage and the ability to refine the local development in the later stage.In the numerical study,the benchmark problem of dimensional optimization with a 10-bar truss structure and simultaneous dimensional shape optimization with a 15-bar truss structure is adopted,and the corresponding penalty method is used for constraint treatment.The test results show that the improved jellyfish search algorithm can provide better truss sections as well as weights.Because when the steel main truss of the large-span covered bridge is lifted,the site is limited and the large lifting equipment cannot enter the site,and the original structure does not meet the problem of stress concentration and large deformation of the bolt group,so the spreader is used to lift,and the improved jellyfish search algorithm is introduced into the design optimization of the spreader.The results show that the improved jellyfish algorithm can efficiently and accurately find out the optimal shape and weight of the spreader,and throughMidas Civil simulation,the spreader used canmeet the requirements of weight and safety.

Optimal Shape Factor and Fictitious Radius in the MQ-RBF:Solving Ill-Posed Laplacian Problems

To solve the Laplacian problems,we adopt a meshless method with the multiquadric radial basis function(MQRBF)as a basis whose center is distributed inside a circle with a fictitious radius.A maximal projection technique is developed to identify the optimal shape factor and fictitious radius by minimizing a merit function.A sample function is interpolated by theMQ-RBF to provide a trial coefficient vector to compute the merit function.We can quickly determine the optimal values of the parameters within a preferred rage using the golden section search algorithm.The novel method provides the optimal values of parameters and,hence,an optimal MQ-RBF;the performance of the method is validated in numerical examples.Moreover,nonharmonic problems are transformed to the Poisson equation endowed with a homogeneous boundary condition;this can overcome the problem of these problems being ill-posed.The optimal MQ-RBF is extremely accurate.We further propose a novel optimal polynomial method to solve the nonharmonic problems,which achieves high precision up to an order of 10^(−11).

Development of Fixture Layout Optimization for Thin-Walled Parts:A Review

An increasing number of researchers have researched fixture layout optimization for thin-walled part assembly during the past decades.However,few papers systematically review these researches.By analyzing existing literature,this paper summarizes the process of fixture layout optimization and the methods applied.The process of optimization is made up of optimization objective setting,assembly variation/deformation modeling,and fixture layout optimization.This paper makes a review of the fixture layout for thin-walled parts according to these three steps.First,two different kinds of optimization objectives are introduced.Researchers usually consider in-plane variations or out-of-plane deformations when designing objectives.Then,modeling methods for assembly variation and deformation are divided into two categories:Mechanism-based and data-based methods.Several common methods are discussed respectively.After that,optimization algorithms are reviewed systematically.There are two kinds of optimization algorithms:Traditional nonlinear programming and heuristic algorithms.Finally,discussions on the current situation are provided.The research direction of fixture layout optimization in the future is discussed from three aspects:Objective setting,improving modeling accuracy and optimization algorithms.Also,a new research point for fixture layout optimization is discussed.This paper systematically reviews the research on fixture layout optimization for thin-walled parts,and provides a reference for future research in this field.

AN OPTIMAL CONTROL PROBLEM FOR A LOTKA-VOLTERRA COMPETITION MODEL WITH CHEMO-REPULSION

In this paper we study a bilinear optimal control problem for a diffusive Lotka-Volterra competition model with chemo-repulsion in a bounded domain of ℝ^(ℕ),N=2,3.This model describes the competition of two species in which one of them avoid encounters with rivals through a chemo-repulsion mechanism.We prove the existence and uniqueness of weak-strong solutions,and then we analyze the existence of a global optimal solution for a related bilinear optimal control problem,where the control is acting on the chemical signal.Posteriorly,we derive first-order optimality conditions for local optimal solutions using the Lagrange multipliers theory.Finally,we propose a discrete approximation scheme of the optimality system based on the gradient method,which is validated with some computational experiments.

Smart Gait:A Gait Optimization Framework for Hexapod Robots

The current gait planning for legged robots is mostly based on human presets,which cannot match the flexible characteristics of natural mammals.This paper proposes a gait optimization framework for hexapod robots called Smart Gait.Smart Gait contains three modules:swing leg trajectory optimization,gait period&duty optimization,and gait sequence optimization.The full dynamics of a single leg,and the centroid dynamics of the overall robot are considered in the respective modules.The Smart Gait not only helps the robot to decrease the energy consumption when in locomotion,mostly,it enables the hexapod robot to determine its gait pattern transitions based on its current state,instead of repeating the formalistic clock-set step cycles.Our Smart Gait framework allows the hexapod robot to behave nimbly as a living animal when in 3D movements for the first time.The Smart Gait framework combines offline and online optimizations without any fussy data-driven training procedures,and it can run efficiently on board in real-time after deployment.Various experiments are carried out on the hexapod robot LittleStrong.The results show that the energy consumption is reduced by 15.9%when in locomotion.Adaptive gait patterns can be generated spontaneously both in regular and challenge environments,and when facing external interferences.

Application of Stork Optimization Algorithm for Solving Sustainable Lot Size Optimization

The efficiency of businesses is often hindered by the challenges encountered in traditional Supply Chain Manage-ment(SCM),which is characterized by elevated risks due to inadequate accountability and transparency.To address these challenges and improve operations in green manufacturing,optimization algorithms play a crucial role in supporting decision-making processes.In this study,we propose a solution to the green lot size optimization issue by leveraging bio-inspired algorithms,notably the Stork Optimization Algorithm(SOA).The SOA draws inspiration from the hunting and winter migration strategies employed by storks in nature.The theoretical framework of SOA is elaborated and mathematically modeled through two distinct phases:exploration,based on migration simulation,and exploitation,based on hunting strategy simulation.To tackle the green lot size optimization issue,our methodology involved gathering real-world data,which was then transformed into a simplified function with multiple constraints aimed at optimizing total costs and minimizing CO_(2) emissions.This function served as input for the SOA model.Subsequently,the SOA model was applied to identify the optimal lot size that strikes a balance between cost-effectiveness and sustainability.Through extensive experimentation,we compared the performance of SOA with twelve established metaheuristic algorithms,consistently demonstrating that SOA outperformed the others.This study’s contribution lies in providing an effective solution to the sustainable lot-size optimization dilemma,thereby reducing environmental impact and enhancing supply chain efficiency.The simulation findings underscore that SOA consistently achieves superior outcomes compared to existing optimization methodologies,making it a promising approach for green manufacturing and sustainable supply chain management.

A Multi-Stage Differential-Multifactorial Evolutionary Algorithm for Ingredient Optimization in the Copper Industry

Ingredient optimization plays a pivotal role in the copper industry,for which it is closely related to the concentrate utilization rate,stability of furnace conditions,and the quality of copper production.To acquire a practical ingredient plan,which should exhibit long duration time with sufficient utilization and feeding stability for real applications,an ingredient plan optimization model is proposed in this study to effectively guarantee continuous production and stable furnace conditions.To address the complex challenges posed by this integer programming model,including multiple coupling feeding stages,intricate constraints,and significant non-linearity,a multi-stage differential-multifactorial evolution algorithm is developed.In the proposed algorithm,the differential evolutionary(DE)algorithm is improved in three aspects to efficiently tackle challenges when optimizing the proposed model.First,unlike traditional time-consuming serial approaches,the multifactorial evolutionary algorithm is utilized to optimize multiple complex models contained in the population of evolutionary algorithm caused by the feeding stability in a parallel manner.Second,a repair algorithm is employed to adjust infeasible ingredient lists in a timely manner.In addition,a local search strategy taking feedback from the current optima and considering the different positions of global optimum is developed to avoiding premature convergence of the differential evolutionary algorithm.Finally,the simulation experiments considering different planning horizons using real data from the copper industry in China are conducted,which demonstrates the superiority of the proposed method on feeding duration and stability compared with other commonly deployed approaches.It is practically helpful for reducing material cost as well as increasing production profit for the copper industry.

Urban Electric Vehicle Charging Station Placement Optimization with Graylag Goose Optimization Voting Classifier

To reduce the negative effects that conventional modes of transportation have on the environment,researchers are working to increase the use of electric vehicles.The demand for environmentally friendly transportation may be hampered by obstacles such as a restricted range and extended rates of recharge.The establishment of urban charging infrastructure that includes both fast and ultra-fast terminals is essential to address this issue.Nevertheless,the powering of these terminals presents challenges because of the high energy requirements,whichmay influence the quality of service.Modelling the maximum hourly capacity of each station based on its geographic location is necessary to arrive at an accurate estimation of the resources required for charging infrastructure.It is vital to do an analysis of specific regional traffic patterns,such as road networks,route details,junction density,and economic zones,rather than making arbitrary conclusions about traffic patterns.When vehicle traffic is simulated using this data and other variables,it is possible to detect limits in the design of the current traffic engineering system.Initially,the binary graylag goose optimization(bGGO)algorithm is utilized for the purpose of feature selection.Subsequently,the graylag goose optimization(GGO)algorithm is utilized as a voting classifier as a decision algorithm to allocate demand to charging stations while taking into consideration the cost variable of traffic congestion.Based on the results of the analysis of variance(ANOVA),a comprehensive summary of the components that contribute to the observed variability in the dataset is provided.The results of the Wilcoxon Signed Rank Test compare the actual median accuracy values of several different algorithms,such as the voting GGO algorithm,the voting grey wolf optimization algorithm(GWO),the voting whale optimization algorithm(WOA),the voting particle swarm optimization(PSO),the voting firefly algorithm(FA),and the voting genetic algorithm(GA),to the theoretical median that would be expected that there is no difference.

A Proposed Feature Selection Particle Swarm Optimization Adaptation for Intelligent Logistics--A Supply Chain Backlog Elimination Framework

The diversity of data sources resulted in seeking effective manipulation and dissemination.The challenge that arises from the increasing dimensionality has a negative effect on the computation performance,efficiency,and stability of computing.One of the most successful optimization algorithms is Particle Swarm Optimization(PSO)which has proved its effectiveness in exploring the highest influencing features in the search space based on its fast convergence and the ability to utilize a small set of parameters in the search task.This research proposes an effective enhancement of PSO that tackles the challenge of randomness search which directly enhances PSO performance.On the other hand,this research proposes a generic intelligent framework for early prediction of orders delay and eliminate orders backlogs which could be considered as an efficient potential solution for raising the supply chain performance.The proposed adapted algorithm has been applied to a supply chain dataset which minimized the features set from twenty-one features to ten significant features.To confirm the proposed algorithm results,the updated data has been examined by eight of the well-known classification algorithms which reached a minimum accuracy percentage equal to 94.3%for random forest and a maximum of 99.0 for Naïve Bayes.Moreover,the proposed algorithm adaptation has been compared with other proposed adaptations of PSO from the literature over different datasets.The proposed PSO adaptation reached a higher accuracy compared with the literature ranging from 97.8 to 99.36 which also proved the advancement of the current research.

Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with Lévy flight

The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.

Synergistic Swarm Optimization Algorithm

This research paper presents a novel optimization method called the Synergistic Swarm Optimization Algorithm(SSOA).The SSOA combines the principles of swarmintelligence and synergistic cooperation to search for optimal solutions efficiently.A synergistic cooperation mechanism is employed,where particles exchange information and learn from each other to improve their search behaviors.This cooperation enhances the exploitation of promising regions in the search space while maintaining exploration capabilities.Furthermore,adaptive mechanisms,such as dynamic parameter adjustment and diversification strategies,are incorporated to balance exploration and exploitation.By leveraging the collaborative nature of swarm intelligence and integrating synergistic cooperation,the SSOAmethod aims to achieve superior convergence speed and solution quality performance compared to other optimization algorithms.The effectiveness of the proposed SSOA is investigated in solving the 23 benchmark functions and various engineering design problems.The experimental results highlight the effectiveness and potential of the SSOA method in addressing challenging optimization problems,making it a promising tool for a wide range of applications in engineering and beyond.Matlab codes of SSOA are available at:https://www.mathworks.com/matlabcentral/fileexchange/153466-synergistic-swarm-optimization-algorithm.