Solving Complex Optimization Problems Research Articles

Flood algorithm: a novel metaheuristic algorithm for optimization problems

Metaheuristic algorithms are an important area of research that provides significant advances in solving complex optimization problems within acceptable time periods. Since the performances of these algorithms vary for different types of problems, many studies have been and need to be done to propose different metaheuristic algorithms. In this article, a new metaheuristic algorithm called flood algorithm (FA) is proposed for optimization problems. It is inspired by the flow of flood water on the earth’s surface. The proposed algorithm is tested both on benchmark functions and on a real-world problem of preparing an exam seating plan, and the results are compared with different metaheuristic algorithms. The comparison results show that the proposed algorithm has competitive performance with other metaheuristic algorithms used in the comparison in terms of solution accuracy and time.

Electric Vehicle Power System in Intelligent Manufacturing Based on Soft Computing Optimization

Soft computing technology has attracted extensive attention in computer engineering and automatic control domains because it can deal with uncertainties, fuzziness, and complex practical problems. This study adopts a Genetic Algorithm (GA) in soft computing technology to realize the cooperative optimization of electric vehicle's dynamic and economic performance. The advantage of soft computing technology lies in its adaptability to uncertainty, fuzziness, and complex practical problems, making GA an effective tool for solving complex optimization problems. Firstly, the electric vehicles’ power system structure and energy management strategy are investigated and analyzed. Secondly, the improved non-dominated sorting genetic algorithm II (NSGA-II) is selected to optimize the parameters of electric vehicles because of its simple operation and high optimization accuracy. Thirdly, NSGA-II is used to construct the electric vehicles’ power and energy configuration, with power and economic performance as the main optimization objectives. Meanwhile, a fuzzy logic controller is designed to adjust the parameters of GA online, so that the optimization process is closer to the actual operating conditions. Finally, the relevant variables are selected to achieve the optimization goal, the optimization objective function and constraint conditions are established, and the model is simulated and evaluated. The results show that the optimized electric vehicle’s acceleration time is remarkably reduced, the dynamic performance is improved by more than 7%, and the power loss is reduced by 5%. In addition, compared with the current multi-objective optimization model, this model enables electric vehicles to travel longer distances under the same power. This study provides a new idea and method for the performance optimization of electric vehicles. Moreover, it offers a valuable reference for the innovation and development of electric vehicle technology in the intelligent manufacturing field. This study indicates that electric vehicles could be more efficient, energy-saving, and environmentally friendly to serve people's travel needs in the future.

A Combined Quasi-Newton-Type Method Using 4th-Order Directional Derivatives for Solving Degenerate Problems of Unconstrained Optimization

Introduction. Methods of unconstrained optimization play a significant role in machine learning [1–6]. When solving practical problems in machine learning, such as tuning nonlinear regression models, the extremum point of the chosen optimality criterion is often degenerate, which significantly complicates its search. Therefore, degenerate problems are the most challenging in optimization. Known numerical methods for solving the general unconstrained optimization problem, up to the second order, have very low convergence rates when solving degenerate problems [7, 8]. This is explained by the fact that for a significant improvement in convergence rate in this case, it is necessary to use higher-order derivatives in the method than the second order [10]. The purpose of the paper is to develop an efficient quasi-Newton method for solving degenerate unconstrained optimization problems, the idea of which (unlike regularization) involves dividing the entire space into the sum of two orthogonal subspaces. This idea was introduced in [23]. The space division at each iteration of the method is based on the spectral decomposition of the matrix approximating the Hessian of the objective function using the BFGS formula [3]. Each subspace exhibits its own behavior of the objective function, and therefore, an appropriate minimization method is applied on it. Results. A combined quasi-Newton method is presented for solving degenerate unconstrained optimization problems, based on orthogonal decomposition of the Hessian approximation matrix and division of the entire space into the sum of two orthogonal subspaces. On one subspace (the kernel of the Hessian approximation matrix), a method is applied where derivatives in the direction of the 4th order are computed, while on the orthogonal complement to it, a quasi-Newtonian method is applied. A separate one-dimensional search is applied on each of these subspaces to determine the step multiplier in the respective direction. The effectiveness of the presented combined method is confirmed by numerical experiments conducted on widely accepted test functions for unconstrained optimization problems. The proposed method allows obtaining fairly accurate solutions to test tasks in case of degeneracy of the minimum point with significantly lower computational costs for gradient calculations compared to optimization procedures of well-known mathematical packages. Conclusions. The idea of dividing the entire space into the sum of two (or possibly more) orthogonal subspaces when solving complex optimization problems is quite promising in terms of applying a combination of different numerical methods on separate subspaces. In the future, it is planned to conduct theoretical research on the convergence rate of the presented combined method in solving degenerate unconstrained optimization problems. Keywords: unconstrained optimization, quasi-Newton methods, degenerate minimum point, spectral matrix decomposition, Machine Learning.

Parameter tuning for active disturbance rejection control of fixed-wing UAV based on improved bald eagle search algorithm

PurposeThis paper aims to develop a method for tuning the parameters of the active disturbance rejection controller (ADRC) for fixed-wing unmanned aerial vehicles (UAVs). The bald eagle search (BES) algorithm has been improved, and a cost function has been designed to enhance the optimization efficiency of ADRC parameters.Design/methodology/approachA six-degree-of-freedom nonlinear model for a fixed-wing UAV has been developed, and its attitude controller has been formulated using the active disturbance rejection control method. The parameters of the disturbance rejection controller have been fine-tuned using the collaborative mutual promotion bald eagle search (CMP-BES) algorithm. The pitch and roll controllers for the UAV have been individually optimized to obtain the most effective controller parameters.FindingsInspired by the salp swarm algorithm (SSA), the interaction among individual eagles has been incorporated into the CMP-BES algorithm, thereby enhancing the algorithm's exploration capability. The efficient and accurate optimization ability of the proposed algorithm has been demonstrated through comparative experiments with genetic algorithm, particle swarm optimization, Harris hawks optimization HHO, BES and modified bald eagle search algorithms. The algorithm's capability to solve complex optimization problems has been further proven by testing on the CEC2017 test function suite. A transitional function for fitness calculation has been introduced to accelerate the ability of the algorithm to find the optimal parameters for the ADRC controller. The tuned ADRC controller has been compared with the classical proportional-integral-derivative (PID) controller, with gust disturbances introduced to the UAV body axis. The results have shown that the tuned ADRC controller has faster response times and stronger disturbance rejection capabilities than the PID controller.Practical implicationsThe proposed CMP-BES algorithm, combined with a fitness function composed of transition functions, can be used to optimize the ADRC controller parameters for fixed-wing UAVs more quickly and effectively. The tuned ADRC controller has exhibited excellent robustness and disturbance rejection capabilities.Originality/valueThe CMP-BES algorithm and transitional function have been proposed for the parameter optimization of the active disturbance rejection controller for fixed-wing UAVs.

Urban Drainage Network Structure Optimization Using Emperor Penguin Optimization Algorithm

Urban drainage systems are an essential component of urban infrastructure that plays a critical role in managing stormwater and preventing flooding in urban areas. With the changing climate and urbanization, the challenges faced by urban drainage systems are becoming increasingly complex. Additionally, aging infrastructure further exacerbates the problem, creating anurban sewage line that must be made more resilient. Redundancy is just a fundamental characteristic of such a robust urban drainage network. Redundancy in urban drainage systems can help to ensure that the system continues to function during extreme weather events or emergencies, reducing the likelihood of flooding and damage. However, the exact locations where redundancy should be increased and its contribution to resilience are not well understood. In recent years, several studies have focused on developing frameworks for optimising urban drainage structures which account pipeline redundancy.One similar research presented a paradigm for constructing the ideal network layout for urban drainage infrastructure, which considers pipeline redundancy under consideration. The original architecture and structure of the urban drainage network was developed using emperor penguin optimizer algorithms and graph theory in the research. Complicated system modelling was done to find extra water pathways or redundancy which might well be implemented to boost resistance. The suggested approach has been utilised to the test region in Dongying City, Shandong Province, China, and its findings revealed even under rainfall above the design specification, the entire overflow capacity of such urban drainage network including pipeline redundancy significantly decreased about 20-30%, compared to the network without pipeline redundancies. The interest in creating optimization algorithms had also increased recently that can be used to design and manage urban infrastructure systems. One such algorithm is the Emperor Penguin Optimization (EPO) algorithm. EPO was a recently developed swarm-based optimization An algorithm which simulates Emperor penguins behaviour in their search for food in Antarctica. The algorithm has shown promising results in solving complex optimization problems in different fields, including engineering, computer science, and management. The EPO algorithm's key features include an emperor search strategy, local search, and randomization, enabling that to efficiently and successfully examine the search process. The algorithm's emperor penguin search strategy enables it to dynamically adjust the search parameters based on the problem's characteristics and progress. The local search feature allows it to escape local optima and explore the search space further. Finally, the randomization feature adds stochasticity to the search process, helping to ensure that the algorithm can avoid getting stuck in a sub-optimal solution. In this article, we aim to explore the potential of EPO as a tool for optimizing Urban drainage solutions which take into account pipeline redundancy. We will start by reviewing the existing Literature upon that optimization in urban drainage facilities, particularly the application of particle swarm optimization, genetic algorithms, and ant colony enhancement. The EPO algorithm will next be described in full including its working principle, key features, and the steps involved in applying it to an optimization problem. Finally, we will present a case study that applies the EPO technique was developed to optimise the network model of such an urban drainage infrastructure taking into account pipeline redundancies, and compare the results with other optimization algorithms. Through this, we aim to demonstrate the potential of EPO as a powerful tool for designing and managing urban infrastructure systems, particularly for enhancing the resilience of urban drainage systems. The study will provide valuable insights into the optimal design of urban drainage technologies which take into account pipeline redundancy, helping policymakers and urban planners make informed decisions about improvingthe adaptability of urban drainage networks. The findings can contribute to the development of sustainable and resilient urban infrastructure systems, which are essential for ensuring the well-being and prosperity of urban residents.

Hybrid Artificial Protozoa-Based JADE for Attack Detection

This paper presents a novel hybrid optimization algorithm that combines JADE Adaptive Differential Evolution with Artificial Protozoa Optimizer (APO) to solve complex optimization problems and detect attacks. The proposed Hybrid APO-JADE Algorithm leverages JADE’s adaptive exploration capabilities and APO’s intensive exploitation strategies, ensuring a robust search process that balances global and local optimization. Initially, the algorithm employs JADE’s mutation and crossover operations, guided by adaptive control parameters, to explore the search space and prevent premature convergence. As the optimization progresses, a dynamic transition to the APO mechanism is implemented, where Levy flights and adaptive change factors are utilized to refine the best solutions identified during the exploration phase. This integration of exploration and exploitation phases enhances the algorithm’s ability to converge to high-quality solutions efficiently. The performance of the APO-JADE was verified via experimental simulations and compared with state-of-the-art algorithms using the 2022 IEEE Congress on Evolutionary Computation benchmark (CEC) 2022 and 2021. Results indicate that APO-JADE achieved outperforming results compared with the other algorithms. Considering practicality, the proposed APO-JADE was used to solve a real-world application in attack detection and tested on DS2OS, UNSW-NB15, and ToNIoT datasets, demonstrating its robust performance.

A Self-Adaptive Neighborhood Search Differential Evolution Algorithm for Planning Sustainable Sequential Cyber–Physical Production Systems

Although Cyber–Physical Systems (CPSs) provide a flexible architecture for enterprises to deal with changing demand, an effective method to organize and allocate resources while considering sustainability factors is required to meet customers’ order requirements and mitigate negative impacts on the environment. The planning of processes to achieve sustainable CPSs becomes an important issue to meet demand timely in a dynamic environment. The problem with planning processes in sustainable CPSs is the determination of the configuration of workflows/resources to compose processes with desirable properties, taking into account time and energy consumption factors. The planning problem in sustainable CPSs can be formulated as an integer programming problem with constraints, and this poses a challenge due to computational complexity. Furthermore, the ever-shrinking life cycle of technologies leads to frequent changes in processes and makes the planning of processes a challenging task. To plan processes in a changing environment, an effective planning method must be developed to automate the planning task. To tackle computational complexity, evolutionary computation approaches such as bio-inspired computing and metaheuristics have been adopted extensively in solving complex optimization problems. This paper aims to propose a solution methodology and an effective evolutionary algorithm with a local search mechanism to support the planning of processes in sustainable CPSs based on an auction mechanism. To achieve this goal, we focus on developing a self-adaptive neighborhood search-based Differential Evolution method. An effective planning method should be robust in terms of performance with respect to algorithmic parameters. We assess the performance and robustness of this approach by performing experiments for several cases. By comparing the results of these experiments, it shows that the proposed method outperforms several other algorithms in the literature. To illustrate the robustness of the proposed self-adaptive algorithm, experiments with different settings of algorithmic parameters were conducted. The results show that the proposed self-adaptive algorithm is robust with respect to algorithmic parameters.

The moss growth optimization (MGO): concepts and performance

Abstract Metaheuristic algorithms are increasingly utilized to solve complex optimization problems because they can efficiently explore large solution spaces. The moss growth optimization (MGO), introduced in this paper, is an algorithm inspired by the moss growth in the natural environment. The MGO algorithm initially determines the evolutionary direction of the population through a mechanism called the determination of wind direction, which employs a method of partitioning the population. Meanwhile, drawing inspiration from the asexual reproduction, sexual reproduction, and vegetative reproduction of moss, two novel search strategies, namely spore dispersal search and dual propagation search, are proposed for exploration and exploitation, respectively. Finally, the cryptobiosis mechanism alters the traditional metaheuristic algorithm’s approach of directly modifying individuals’ solutions, preventing the algorithm from getting trapped in local optima. In experiments, a thorough investigation is undertaken on the characteristics, parameters, and time cost of the MGO algorithm to enhance the understanding of MGO. Subsequently, MGO is compared with 10 original and advanced CEC 2017 and CEC 2022 algorithms to verify its performance advantages. Lastly, this paper applies MGO to four real-world engineering problems to validate its effectiveness and superiority in practical scenarios. The results demonstrate that MGO is a promising algorithm for tackling real challenges. The source codes of the MGO are available at https://aliasgharheidari.com/MGO.html and other websites.

PSAO: An enhanced Aquila Optimizer with particle swarm mechanism for engineering design and UAV path planning problems

Metaheuristic algorithms have become increasingly significant in solving complex optimization problems. To address the limitations of the original Aquila Optimizer (AO), such as insufficient local exploitation ability, low optimization precision, and slow convergence rate, an enhanced Aquila Optimizer (PSAO) for global optimization has been proposed. PSAO uses a better ergodic good point set to initialize the Aquila population and modifies the search method by employing the golden sine operator and the mechanism of self-learning and social learning based on particle swarm, followed by designing a nonlinear balance factor γ as the switching condition of the algorithm. The simulation experiments on benchmark functions and CEC2017 functions have verified that the PSAO has better global optimization ability and stronger robustness compared with other intelligent algorithms. Meanwhile, the contribution of each component that belongs to PSAO has been validated by ablation experiments for the CEC2022 test functions. To further illustrate the practical application potential of PSAO, PSAO is successfully applied to four typical engineering design problems, three of which reach the best fitness values. In addition, utilizing PSAO to solve the UAV trajectory planning problem by considering the objectives of trajectory length, altitude and corner of the flight process, the total flight cost is reduced by 60.22 %, 27.94 %, and 22.41 % compared with AO, PSO and Gold-SA, respectively, which proves its applicability and superiority in solving the real optimization problems.

Advancements in Q‐learning meta‐heuristic optimization algorithms: A survey

AbstractThis paper reviews the integration of Q‐learning with meta‐heuristic algorithms (QLMA) over the last 20 years, highlighting its success in solving complex optimization problems. We focus on key aspects of QLMA, including parameter adaptation, operator selection, and balancing global exploration with local exploitation. QLMA has become a leading solution in industries like energy, power systems, and engineering, addressing a range of mathematical challenges. Looking forward, we suggest further exploration of meta‐heuristic integration, transfer learning strategies, and techniques to reduce state space.This article is categorized under: Technologies > Computational Intelligence Technologies > Artificial Intelligence

Hybrid optimization algorithm based on chaos game and differential evolution for constrained optimization of structures

ABSTRACT A novel hybrid optimization algorithm, chaos game optimization–differential evolution (CGO-DE), is developed in this study for the size optimization of structures. The key contribution lies in the synergistic combination of chaos game optimization (CGO) and differential evolution (DE), using their respective strengths in exploration and exploitation to effectively identify global optima. The innovative approach independently applies CGO and DE to subpopulations, preventing premature convergence and enhancing overall performance while ensuring accuracy, accounting for design factors and respecting constraints. Comprehensive numerical evaluations on established structural benchmarks (three-bar truss, welded beam and cantilever beam) and large-scale structures (272-bar and 942-bar truss tower) demonstrate the versatility and efficiency of CGO-DE in solving complex optimization problems across various engineering applications. The results underscore the ability of the algorithm to achieve optimal solutions and improve designs compared to other optimization techniques, highlighting its potential as a powerful tool for engineering optimization.

Comparative Analysis of Nature-Inspired Metaheuristic Techniques for Optimizing Phishing Website Detection

The increasing number, frequency, and sophistication of phishing website-based attacks necessitate the development of robust solutions for detecting phishing websites to enhance the overall security of cyberspace. Drawing inspiration from natural processes, nature-inspired metaheuristic techniques have been proven to be efficient in solving complex optimization problems in diverse domains. Following these successes, this research paper aims to investigate the effectiveness of metaheuristic techniques, particularly Genetic Algorithms (GAs), Differential Evolution (DE), and Particle Swarm Optimization (PSO), in optimizing the hyperparameters of machine learning (ML) algorithms for detecting phishing websites. Using multiple datasets, six ensemble classifiers were trained on each dataset and their hyperparameters were optimized using each metaheuristic technique. As a baseline for assessing performance improvement, the classifiers were also trained with the default hyperparameters. To validate the genuine impact of the techniques over the use of default hyperparameters, we conducted statistical tests on the accuracy scores of all the optimized classifiers. The results show that the GA is the most effective technique, by improving the accuracy scores of all the classifiers, followed by DE, which improved four of the six classifiers. PSO was the least effective, improving only one classifier. It was also found that GA-optimized Gradient Boosting, LGBM and XGBoost were the best classifiers across all the metrics in predicting phishing websites, achieving peak accuracy scores of 98.98%, 99.24%, and 99.47%, respectively.

Artificial bee colony optimization algorithm with full dimensional updating strategy and its application

For the low accuracy and slow convergence speed of artificial bee colony(ABC) algorithm in solving complex optimization problems, an improved artificial bee colony(ABC) algorithm based on the new full dimensional updating ABC/best /1 strategy, namely FNABC was proposed in this paper. In the FNABC, for the low efficiency of one-dimensional search, the full dimensional updating search strategy and ABC/best /1 strategy were combined to design a new full dimensional updating ABC/best/1 strategy, which expanded the search space, improved the mining ability and search efficiency. Then, a new evolutionary phase is designed to balance the global search ability and local mining ability to avoid falling into local optimum and improve the convergence accuracy. Finally, the FNABC is compared with eight state-of-the-art ABC variants such as AABC, iqABC, MEABC, ABCVSS, GBABC, DFSABC, MABC-NS, MGABC in solving 12 complex functions. All functions have obtained the best optimal values among 9 algorithms. Additionally, FNABC is applied to solve a real-world train operation adjustment problem. The experiment results indicate that the FNABC has better optimization ability, scalability and robustness. It obtains the ideal train operation adjustment results.

Solving Complex Optimisation Problems by Machine Learning

Solving Complex Optimisation Problems by Machine Learning

Adaptive multi-stage evolutionary search for constrained multi-objective optimization

AbstractIn this paper, we propose a multi-stage evolutionary framework with adaptive selection (MSEFAS) for efficiently handling constrained multi-objective optimization problems (CMOPs). MSEFAS has two stages of optimization in its early phase of evolutionary search: one stage that encourages promising infeasible solutions to approach the feasible region and increases diversity, and the other stage that enables the population to span large infeasible regions and accelerates convergence. To adaptively determine the execution order of these two stages in the early process, MSEFAS treats the optimization stage with higher validity of selected solutions as the first stage and the other as the second one. In addition, at the late phase of evolutionary search, MSEFAS introduces a third stage to efficiently handle the various characteristics of CMOPs by considering the relationship between the constrained Pareto fronts (CPF) and unconstrained Pareto fronts. We compare the proposed framework with eleven state-of-the-art constrained multi-objective evolutionary algorithms on 56 benchmark CMOPs. Our results demonstrate the effectiveness of the proposed framework in handling a wide range of CMOPs, showcasing its potential for solving complex optimization problems.

A Survey on Manta Ray Foraging Optimization Algorithm of Variants and Applications

This review paper delves into the original MRFO and its variants, focusing on single-objective algorithms including but not limited to hybrid algorithms, learning strategies, multiple populations and dynamic parameter adjustment, highlighting the improvements made to enhance the algorithm's efficiency in global optimization, accelerate convergence rates, and improve its capacity to evade local optima. MRFO has emerged as an effective tool for solving complex optimization problems across various domains, including energy optimization, biomedical field, engineering problems, and others. A comprehensive analysis of applications of MRFO in different fields is provided, emphasizing its adaptability and efficacy. The paper concludes with a discussion on the challenges faced by MRFO and potential future research directions, aiming to consolidate the current research status and guide future investigations.

Development of an Information System for Wood Harvesting Planning

The article presents the results of developing a software system for production planning in the field of wood harvesting. The objects of research are the planning of harvesting operations, forest transport, construction, repair and maintenance of forest roads, as well as solving various related problems. The purpose of the work is to develop a native specialized software system for production planning in the field of wood harvesting, which is integrated with existing accounting and monitoring systems and is based on solving complex optimization problems of large dimensions using original specially developed methods and algorithms that take into account all the features of wood harvesting production in the Russian Federation. As a result of this work, an approach to creating such а system was developed, which includes a set of requirements for the software product, as well as formulations of the main tasks to be solved, listing the necessary initial data and information obtained as an output. The proposed approach was implemented by Russian IT-company Opti-Soft in the form of software product Opti-Wood — a multipurpose Decision Support System (DSS) designed for the use at forestry enterprises as a tool for optimizing production planning, management and control. The Opti-Wood system was developed in close contact with a large wood harvesting enterprise in the Republic of Karelia. The system is based on original algorithms for solving several optimization problems of increased complexity. Using the system allows one to increase the efficiency of logging processes by reducing costs in supply chains, the volume of warehouse stocks, the number of required vehicles; by mutual agreement of plans for harvesting operations, forest transport, road construction, etc., as well as by significantly reducing the time for taking management decisions. Increased profitability occurs due to the identification of additional options for the sale of products.

Incorporating machine learning and optimization techniques for assigning patients to operating rooms by considering fairness policies

Operating rooms (ORs) are key to a hospital's profitability, and increasing their benefits helps decrease surgical costs, minimize patient waiting times, and boost the number of patients admitted for surgery. This study presents a mixed-integer linear programming (MILP) model to address the issue of treating inpatients in operating rooms waiting for admission to the referral department. Moreover, it proposes a practical algorithm that minimizes overtime costs in operating rooms and increases patient satisfaction. Our model uses an integrated machine learning - tabu search (ML-TS) method. The proposed model uses differential ML and heuristic rules to achieve enhanced performance and scalability in solving complex optimization problems. A fairness policy is implemented, combined with an optimization method, to guide patient prioritization. This approach considers factors like urgency, waiting times, or specific patient needs and helps determine the order in which patients are scheduled for surgery. The outcomes imply that patient adaptability has led to savings ranging from 50% to 65% per surgery. Additionally, the Machine Learning-Tabu Search (ML-TS) algorithm has increased performance by about 35%. These algorithms also let the OR manager define the size of the uncertainty set and regulate overtime costs while accommodating surgeons' preferences as managerial implications insight. It adeptly navigates the solution space, identifies feasible solutions, and accelerates convergence.

Novel Hybrid Crayfish Optimization Algorithm and Self-Adaptive Differential Evolution for Solving Complex Optimization Problems

This study presents the Hybrid COASaDE Optimizer, a novel combination of the Crayfish Optimization Algorithm (COA) and Self-adaptive Differential Evolution (SaDE), designed to address complex optimization challenges and solve engineering design problems. The hybrid approach leverages COA’s efficient exploration mechanisms, inspired by crayfish behaviour, with the symmetry of SaDE’s adaptive exploitation capabilities, characterized by its dynamic parameter adjustment. The balance between these two phases represents a symmetrical relationship wherein both components contribute equally and complementary to the algorithm’s overall performance. This symmetry in design enables the Hybrid COASaDE to maintain consistent and robust performance across a diverse range of optimization problems. Experimental evaluations were conducted using CEC2022 and CEC2017 benchmark functions, demonstrating COASaDE’s superior performance compared to state-of-the-art optimization algorithms. The results and statistical analyses confirm the robustness and efficiency of the Hybrid COASaDE in finding optimal solutions. Furthermore, the applicability of the Hybrid COASaDE was validated through several engineering design problems, where COASaDE outperformed other optimizers in achieving the optimal solution.

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.