Engineering Optimization Problems Research Articles

A Multi-strategy Slime Mould Algorithm for Solving Global Optimization and Engineering Optimization Problems

A Multi-strategy Slime Mould Algorithm for Solving Global Optimization and Engineering Optimization Problems

HKTSMA: An Improved Slime Mould Algorithm Based on Multiple Adaptive Strategies for Engineering Optimization Problems

HKTSMA: An Improved Slime Mould Algorithm Based on Multiple Adaptive Strategies for Engineering Optimization Problems

Multi-strategy improved sparrow search algorithm based on first definition of ellipse and group co-evolutionary mechanism for engineering optimization problems

Multi-strategy improved sparrow search algorithm based on first definition of ellipse and group co-evolutionary mechanism for engineering optimization problems

Flavoring search algorithm with applications to engineering optimization problems and robot path planning

In this paper, a human-based meta-heuristic algorithm, the Flavoring Search Algorithm, is proposed and mathematically modeled with the aim of providing an alternative optimization method for solving practical engineering problems. Flavoring Search Algorithm is inspired by the human behavior of flavoring in everyday life, including basic flavoring, formal flavoring, and auxiliary flavoring. By introducing a unique taste factor, it not only succeeded in making the Flavoring Search Algorithm corresponds to the real flavoring process but also balanced the exploration and exploitation of the algorithm. With the help of the taste factors, Flavoring Search Algorithm performs basic flavoring (initial flavoring and random flavoring) in the exploration phase and formal flavoring and auxiliary flavoring in the exploitation phase. In addition, theoretical analysis and experiments have led to the conclusion that the taste factor can be used as an effective and practical new threshold conversion mechanism for meta-heuristic algorithms. This study also establishes a Markov model to rigorously analyze the Flavoring Search Algorithm as a globally convergent algorithm from a mathematical point of view. Through experimental and analytical comparisons with other excellent optimizers on 30 test functions, as well as on 3 real-world engineering design problems and 1 path planning problem. The results show that the Flavoring Search Algorithm generally outperforms the tested competitors in solving benchmark functions and engineering problems, validating the utility of the proposed optimizer in solving challenging real-world problems.

Serial multilevel-learned differential evolution with adaptive guidance of exploration and exploitation

Recent years have witnessed a surge in the development of multilevel variants of differential evolution (DE), significantly enhancing the performance of DE algorithms. However, systematically guiding algorithms to strike a balance between exploration and exploitation within a parallel multilevel structure remains a challenge. In response to this challenge, we propose serial multilevel-learned differential evolution (SMLDE) with adaptive guidance for exploration and exploitation. This algorithm establishes a tightly connected multilevel-learned structure and an adaptive current best level. It also incorporates a combination of strategies including single iterative adaption, Cauchy perturbation, and iterative constraint strategy into each of the adapted levels, thus enhancing inter-component connections and dynamically balancing exploration and exploitation. To validate its effectiveness, we conduct ablation experiments and visualized analyses of exploration and exploitation to demonstrate the reliable strength of the multilevel-learned structure. The experimental results comparing SMLDE with 15 state-of-the-art algorithms using the IEEE Conference on Evolutionary Computation (CEC) 2017 benchmark test sets across various dimensions showcase its superior performance. Additionally, its remarkable results on the CEC2011 benchmark test and two real-world engineering optimization problems underscore the robustness and effectiveness of SMLDE.

Adaptive crossover-based marine predators algorithm for global optimization problems

Abstract The Marine Predators Algorithm (MPA) is a swarm intelligence algorithm developed based on the foraging behaviour of the ocean's predators. This algorithm has drawbacks including, insufficient population diversity, leading to trapping in local optima and poor convergence. To mitigate these drawbacks, this paper introduces an enhanced MPA based on Adaptive Sampling with Maximin Distance Criterion (AM) and the horizontal and vertical crossover operators (AC-MPA). The AM approach is used to generate diverse and well-distributed candidate solutions. Whereas the horizontal and vertical crossover operators maintain the population diversity during the search process. The performance of AC-MPA was tested using 51 benchmark functions from CEC2017, CEC2020, CEC2022, with varying degrees of dimensionality, and the findings are compared with those of its basic version, variants, and numerous well-known metaheuristics. Additionally, 11 engineering optimization problems were utilized to verify the capabilities of the AC-MPA in handling real-world optimization problems. The findings clearly show that AC-MPA performs well in terms of its solution accuracy, convergence and robustness. Furthermore, the proposed algorithm demonstrates considerable advantages in solving engineering problems, proving its effectiveness and adaptability.

Implementation of an Enhanced Crayfish Optimization Algorithm.

This paper presents an enhanced crayfish optimization algorithm (ECOA). The ECOA includes four improvement strategies. Firstly, the Halton sequence was used to improve the population initialization of the crayfish optimization algorithm. Furthermore, the quasi opposition-based learning strategy is introduced to generate the opposite solution of the population, increasing the algorithm's searching ability. Thirdly, the elite factor guides the predation stage to avoid blindness in this stage. Finally, the fish aggregation device effect is introduced to increase the ability of the algorithm to jump out of the local optimal. This paper performed tests on the widely used IEEE CEC2019 test function set to verify the validity of the proposed ECOA method. The experimental results show that the proposed ECOA has a faster convergence speed, greater performance stability, and a stronger ability to jump out of local optimal compared with other popular algorithms. Finally, the ECOA was applied to two real-world engineering optimization problems, verifying its ability to solve practical optimization problems and its superiority compared to other algorithms.

Design cost minimization of a reinforced concrete column section using overnew swarm-based optimization algorithms

AbstractIt is very tiresome for a practiser to detect the best feasible sizing design of structural members including reinforced concrete columns that is a highly nonlinear and complicated structural engineering optimization problem. This is due to such a design is practically conducted via conventional trial-and-error computing methods in which resistance to external loads, cost efficiency, and aesthetic factors, etc. have to be considered. This study focuses on minimizing the design cost of primarily proposed reinforced concrete column design problem via three overnew swarm-based optimizers such as Coati Optimization Algorithm, Fox Optimizer and Pelican Optimization Algorithm (POA) that are firstly utilized for this purpose. In this regard, the type of steel rebar distribution, the characteristic strength of the concrete, the height and width of the column section, and the number and diameter of the rebars are treated as discrete design variables of the newly proposed complex reinforced concrete column design cost optimization problem. In solution, the design requirements specified in practice code provisions should also be met. Here, Turkish Building Earthquake Code 2018 specifications are considered as practice structural design constraints. Consequently, the algorithmic performances of three overnew swarm-based metaheuristic optimization algorithms are compared and evaluated in detail. Amongst them, the POA shows most fruitful algorithmic design solution performance.

An Enhanced Beluga Whale Optimization Algorithm for Engineering Optimization Problems

An Enhanced Beluga Whale Optimization Algorithm for Engineering Optimization Problems

Multi-Strategy-Improved Growth Optimizer and Its Applications

The growth optimizer (GO) is a novel metaheuristic algorithm designed to tackle complex optimization problems. Despite its advantages of simplicity and high efficiency, GO often encounters localized stagnation when dealing with discretized, high-dimensional, and multi-constraint problems. To address these issues, this paper proposes an enhanced version of GO called CODGBGO. This algorithm incorporates three strategies to enhance its performance. Firstly, the Circle-OBL initialization strategy is employed to enhance the quality of the initial population. Secondly, an exploration strategy is implemented to improve population diversity and the algorithm’s ability to escape local optimum traps. Finally, the exploitation strategy is utilized to enhance the convergence speed and accuracy of the algorithm. To validate the performance of CODGBGO, it is applied to solve the CEC2017, CEC2020, 18 feature selection problems, and 4 real engineering optimization problems. The experiments demonstrate that the novel CODGBGO algorithm effectively addresses the challenges posed by complex optimization problems, offering a promising approach.

Hunger games search algorithm based on stochastic individual information for engineering design optimization problems

Abstract The hunger games search algorithm (HGS) is a newly proposed meta-heuristic algorithm that emulates hunger-driven foraging behaviors in a population. It combines fitness values to determine individual weights and updates them based on fitness value size, resulting in high adaptability and effective optimization. However, HGS faces issues like low convergence accuracy and susceptibility to local optima in complex optimization problems. To address these problems, an improved version called BDFXHGS is introduced. BDFXHGS incorporates a collaborative feeding strategy based on HGS's design advantages. Individuals approach others based on hunger degree, facilitating information exchange and resolving convergence and accuracy issues. BDFXHGS combines a disperse foraging strategy and a directional crossover strategy to enhance exploration and convergence speed. The paper conducts qualitative analysis and ablation experiments to examine the effectiveness of the strategies. Comparative experiments are performed using IEEE CEC 2017 benchmark functions to compare BDFXHGS with competitive algorithms, including previous champion algorithms in different dimensions. Additionally, BDFXHGS is evaluated on 25 constrained optimization problems from the IEEE CEC 2020 competition and 5 real engineering optimization problems. Experimental results show that BDFXHGS performs well on benchmarks and outperforms other algorithms in real-world applications.

Solving Engineering Optimization Problems Based on Multi-Strategy Particle Swarm Optimization Hybrid Dandelion Optimization Algorithm.

In recent years, swarm intelligence optimization methods have been increasingly applied in many fields such as mechanical design, microgrid scheduling, drone technology, neural network training, and multi-objective optimization. In this paper, a multi-strategy particle swarm optimization hybrid dandelion optimization algorithm (PSODO) is proposed, which is based on the problems of slow optimization speed and being easily susceptible to falling into local extremum in the optimization ability of the dandelion optimization algorithm. This hybrid algorithm makes the whole algorithm more diverse by introducing the strong global search ability of particle swarm optimization and the unique individual update rules of the dandelion algorithm (i.e., rising, falling and landing). The ascending and descending stages of dandelion also help to introduce more changes and explorations into the search space, thus better balancing the global and local search. The experimental results show that compared with other algorithms, the proposed PSODO algorithm greatly improves the global optimal value search ability, convergence speed and optimization speed. The effectiveness and feasibility of the PSODO algorithm are verified by solving 22 benchmark functions and three engineering design problems with different complexities in CEC 2005 and comparing it with other optimization algorithms.

Election Optimizer Algorithm: A New Meta-Heuristic Optimization Algorithm for Solving Industrial Engineering Design Problems

This paper introduces the election optimization algorithm (EOA), a meta-heuristic approach for engineering optimization problems. Inspired by the democratic electoral system, focusing on the presidential election, EOA emulates the complete election process to optimize solutions. By simulating the presidential election, EOA introduces a novel position-tracking strategy that expands the scope of effectively solvable problems, surpassing conventional human-based algorithms, specifically, the political optimizer. EOA incorporates explicit behaviors observed during elections, including the party nomination and presidential election. During the party nomination, the search space is broadened to avoid local optima by integrating diverse strategies and suggestions from within the party. In the presidential election, adequate population diversity is maintained in later stages through further campaigning between elite candidates elected within the party. To establish a benchmark for comparison, EOA is rigorously assessed against several renowned and widely recognized algorithms in the field of optimization. EOA demonstrates superior performance in terms of average values and standard deviations across the twenty-three standard test functions and CEC2019. Through rigorous statistical analysis using the Wilcoxon rank-sum test at a significance level of 0.05, experimental results indicate that EOA consistently delivers high-quality solutions compared to the other benchmark algorithms. Moreover, the practical applicability of EOA is assessed by solving six complex engineering design problems, demonstrating its effectiveness in real-world scenarios.

Data-driven hierarchical collaborative optimization method with multi-fidelity modeling for aerodynamic optimization

The aerodynamic optimization of aircraft based on evolutionary algorithms generally requires thousands or even tens of thousands of iterations. Moreover, it faces challenges such as high-dimensional design variables and high computational costs, leading to low efficiency in algorithm search and poor optimization results. In order to enhance the efficiency of aerodynamic optimization, a data-driven collaborative optimization and multi-fidelity hierarchical modeling method is proposed. Firstly, a Clustering-Enhanced Teaching-Learning-Based Optimization (CETLBO) algorithm is introduced to improve its exploration and exploitation capabilities. By employing a collaborative optimization strategy, a divide-and-conquer paradigm is utilized to efficiently solve high-dimensional, nonlinear, and complex engineering optimization problems. Secondly, a two-stage hierarchical aerodynamic optimization framework is designed to reduce computational costs by integrating data from different fidelity levels. Stage 1 adopts a data-driven approximate optimization method to provide prior knowledge for the high-fidelity optimization of stage 2. Finally, the proposed method is applied to the optimization design of supersonic wing shapes. Compared to traditional optimization design systems, it demonstrates high efficiency in high-dimensional aerodynamic optimization problems, yielding better optimization results.

Improved stochastic fractal search algorithm involving design operators for solving parameter extraction problems in real-world engineering optimization problems

The characteristic parameters of renewable energy sources (RESs) are changes over time under changing operating conditions. Therefore, the accuracy of the model is important in order to establish appropriate control and operating plans for the stable operation of such systems. Determining the parameters of RESs and creating an accurate model of them is an inevitable reality and plays an important role in the success of system modeling. Many methods have been used to determine these parameters in the literature. Furthermore, optimization algorithms are now considered to be among the most significant approaches for resolving problems pertaining to system parameter extraction in many scientific areas. In the study, this parameter extraction is done by a new optimization method called stochastic fractal search algorithm (FDB-NSM-SFS-OBLs), which includes natural survivor updating (NSM) and fitness distance balance (FDB) guiding mechanisms, and opposite based learning (OBL) methods. The performance of the proposed FDB-NSM-SFS-OBL algorithm has been tested in two different experimental studies. In the first experimental study, the proposed approach is tested on CEC2020 benchmark test functions and the algorithm structure containing the best OBL approach is determined using nonparametric Wilcoxon and Friedman statistical analysis methods. The second experimental study is carried out with the proposed optimization algorithm to estimate the parameters of the photovoltaic cell used in the modeling, which is the building block of photovoltaic panels used in renewable energy systems, proton-exchange membrane fuel cell (PEMFC) that is another renewable energy source, and Li-Ion battery used as a backup power unit. The FDB-NSM-SFS-OBL algorithm, which is used both in the CEC2020 benchmark test functions and in determining the parameters of photovoltaic (PV) cells, PEMFC and Li-Ion batteries, performed better in searching and finding the global solution point during the optimization process.

Optimal coordinated energy management in active distribution networks considering battery energy storage and price‐responsive demand

AbstractContemporary distribution networks can be seen with diverse dispatchable and non‐dispatchable energy resources. The coordinated scheduling of these dispatchable resources with non‐dispatchable resources can provide several techno‐economic and social benefits. Since battery energy storage systems (BESSs) and microturbine units are capital intensive. A thorough investigation of their coordinated scheduling on a purely economic basis will be an interesting and challenging task while considering dynamic electricity price and uncertainty of renewable power generation and load demand. This paper proposes a new methodology for optimal coordinated scheduling of BESSs and microturbine units considering existing renewable energy resources and dynamic electricity price to maximize daily profit function of the utility. In this study, a recently explored modified African buffalo optimization algorithm is employed. The key attributes of the proposed methodology are comprised of mean price‐based adaptive scheduling embedded within a decision mechanism system to maximize arbitrage benefits. Decision mechanism system keeps a track of system states as a‐priori thus guides the artificial intelligence‐based solution technique for sequential optimization. This may also reduce the computational burden of complex real‐life engineering optimization problems. Further, a novel concept of fictitious charges in coordination with BESS management algorithm is proposed to restrict the counterproductive operational management of BESSs. The application results investigated and compared on a benchmark 33‐bus test distribution system highlights the importance of the proposed methodology.

Optimization based on the smart behavior of plants with its engineering applications: Ivy algorithm

This study presents a powerful and new modeling variant of bio-inspired algorithms, namely, the Ivy algorithm (IVYA), drawn from the growth patterns of Ivy plants. The algorithm simulates the coordinated and ordered population growth and the spreading and evolution of Ivy plants. The growth rate of Ivy plants is modeled using a differential equation and a data-intensive experimental process. The algorithm utilizes the knowledge of nearby Ivy plants to determine the direction of growth. Additionally, the algorithm mimics the behavior of Ivy plants in nature by choosing the closest and most vital neighbor for self-improvement. The IVYA's unique characteristics of preserving population diversity and its simplicity and flexibility allow for easy modification and extension, thus enabling researchers and practitioners to explore various modifications and techniques to enhance its performance and capabilities. These are the basic needs in optimizing engineering problems. The IVYA is compared with ten other algorithms on 26 classical test functions, demonstrating superior performance. Furthermore, the effectiveness of IVYA is shown by solving 12 engineering optimization problems and comparing the results with various optimization algorithms. The experimental results highlight the efficacy and competitiveness of the IVYA in solving optimization problems. Consider that the source code of the IVYA is publicly available at https://www.optim-app.com/projects/ivya.

Imitation-based Cognitive Learning Optimizer for solving numerical and engineering optimization problems

A novel human cognitive and social interaction-based metaheuristic called Imitation-based Cognitive Learning Optimizer (CLO) is proposed and developed to solve engineering optimization problems effectively. CLO is inspired by humans’ imitation and social learning behavior during the life cycle. The human life cycle consists of various stages. Social and imitating human behavior during the life cycle is incorporated into this algorithm to improve cognitive abilities. The three real-world mechanical engineering optimization problems (Welded beam problem, Tension–Compression String Design Problem, and Speed reducer problem) and 100 challenging benchmark functions including uni-modal, multi-modal and CEC-BC-2017 functions are used for the real-time validation. CLO is compared with 12 state-of-art algorithms from the literature. The experiments along with convergence analysis and Friedman’s Mean Rank (FMR) statistical test show the superiority of CLO over the other chosen algorithms.

An efficient improved exponential distribution optimizer: application to the global, engineering and combinatorial optimization problems

An efficient improved exponential distribution optimizer: application to the global, engineering and combinatorial optimization problems

Multi-Strategy Improved Particle Swarm Optimization Algorithm and Gazelle Optimization Algorithm and Application

In addressing the challenges associated with low convergence accuracy and unstable optimization results in the original gazelle optimization algorithm (GOA), this paper proposes a novel approach incorporating chaos mapping termed multi-strategy particle swarm optimization with gazelle optimization algorithm (MPSOGOA). In the population initialization stage, segmented mapping is integrated to generate a uniformly distributed high-quality population which enhances diversity, and global perturbation of the population is added to improve the convergence speed in the early iteration and the convergence accuracy in the late iteration. By combining particle swarm optimization (PSO) and GOA, the algorithm leverages individual experiences of gazelles, which improves convergence accuracy and stability. Tested on 35 benchmark functions, MPSOGOA demonstrates superior performance in convergence accuracy and stability through Friedman tests and Wilcoxon signed-rank tests, surpassing other metaheuristic algorithms. Applied to engineering optimization problems, including constrained implementations, MPSOGOA exhibits excellent optimization performance.