Engineering Design Problems Research Articles

A Comprehensive Multi-Strategy Enhanced Biogeography-Based Optimization Algorithm for High-Dimensional Optimization and Engineering Design Problems

The biogeography-based optimization (BBO) algorithm is known for its simplicity and low computational overhead, but it often struggles with falling into local optima and slow convergence speed. Against this background, this work presents a multi-strategy enhanced BBO variant, named MSBBO. Firstly, the example chasing strategy is proposed to eliminate the destruction of the inferior solutions to superior solutions. Secondly, the heuristic crossover strategy is designed to enhance the search ability of the population. Finally, the prey search–attack strategy is used to balance the exploration and exploitation. To verify the performance of MSBBO, we compare it with standard BBO, seven BBO variants (PRBBO, BBOSB, HGBBO, FABBO, BLEHO, MPBBO and BBOIMAM) and seven meta-heuristic algorithms (GWO, WOA, SSA, ChOA, MPA, GJO and BWO) on multiple dimensions of 24 benchmark functions. It concludes that MSBBO significantly outperforms all competitors both on convergence accuracy, speed and stability, and MSBBO basically converges to the same results on 10,000 dimensions as on 1000 dimensions. Further, MSBBO is applied to six real-world engineering design problems. The experimental results show that our work is still more competitive than other latest optimization techniques (COA, EDO, OMA, SHO and SCSO) on constrained optimization problems.

Pufferfish Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems.

A new bio-inspired metaheuristic algorithm named the Pufferfish Optimization Algorithm (POA), that imitates the natural behavior of pufferfish in nature, is introduced in this paper. The fundamental inspiration of POA is adapted from the defense mechanism of pufferfish against predators. In this defense mechanism, by filling its elastic stomach with water, the pufferfish becomes a spherical ball with pointed spines, and as a result, the hungry predator escapes from this threat. The POA theory is stated and then mathematically modeled in two phases: (i) exploration based on the simulation of a predator's attack on a pufferfish and (ii) exploitation based on the simulation of a predator's escape from spiny spherical pufferfish. The performance of POA is evaluated in handling the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that POA has achieved an effective solution with the appropriate ability in exploration, exploitation, and the balance between them during the search process. The quality of POA in the optimization process is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that POA provides superior performance by achieving better results in most of the benchmark functions in order to solve the CEC 2017 test suite compared to competitor algorithms. Also, the effectiveness of POA to handle optimization tasks in real-world applications is evaluated on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems. Simulation results show that POA provides effective performance in handling real-world applications by achieving better solutions compared to competitor algorithms.

Multi-objective exponential distribution optimizer (MOEDO): a novel math-inspired multi-objective algorithm for global optimization and real-world engineering design problems

The exponential distribution optimizer (EDO) represents a heuristic approach, capitalizing on exponential distribution theory to identify global solutions for complex optimization challenges. This study extends the EDO's applicability by introducing its multi-objective version, the multi-objective EDO (MOEDO), enhanced with elite non-dominated sorting and crowding distance mechanisms. An information feedback mechanism (IFM) is integrated into MOEDO, aiming to balance exploration and exploitation, thus improving convergence and mitigating the stagnation in local optima, a notable limitation in traditional approaches. Our research demonstrates MOEDO's superiority over renowned algorithms such as MOMPA, NSGA-II, MOAOA, MOEA/D and MOGNDO. This is evident in 72.58% of test scenarios, utilizing performance metrics like GD, IGD, HV, SP, SD and RT across benchmark test collections (DTLZ, ZDT and various constraint problems) and five real-world engineering design challenges. The Wilcoxon Rank Sum Test (WRST) further confirms MOEDO as a competitive multi-objective optimization algorithm, particularly in scenarios where existing methods struggle with balancing diversity and convergence efficiency. MOEDO's robust performance, even in complex real-world applications, underscores its potential as an innovative solution in the optimization domain. The MOEDO source code is available at: https://github.com/kanak02/MOEDO.

Using the Grey Wolf Aquila Synergistic Algorithm for Design Problems in Structural Engineering.

The Aquila Optimizer (AO) is a metaheuristic algorithm that is inspired by the hunting behavior of the Aquila bird. The AO approach has been proven to perform effectively on a range of benchmark optimization issues. However, the AO algorithm may suffer from limited exploration ability in specific situations. To increase the exploration ability of the AO algorithm, this work offers a hybrid approach that employs the alpha position of the Grey Wolf Optimizer (GWO) to drive the search process of the AO algorithm. At the same time, we applied the quasi-opposition-based learning (QOBL) strategy in each phase of the Aquila Optimizer algorithm. This strategy develops quasi-oppositional solutions to current solutions. The quasi-oppositional solutions are then utilized to direct the search phase of the AO algorithm. The GWO method is also notable for its resistance to noise. This means that it can perform effectively even when the objective function is noisy. The AO algorithm, on the other hand, may be sensitive to noise. By integrating the GWO approach into the AO algorithm, we can strengthen its robustness to noise, and hence, improve its performance in real-world issues. In order to evaluate the effectiveness of the technique, the algorithm was benchmarked on 23 well-known test functions and CEC2017 test functions and compared with other popular metaheuristic algorithms. The findings demonstrate that our proposed method has excellent efficacy. Finally, it was applied to five practical engineering issues, and the results showed that the technique is suitable for tough problems with uncertain search spaces.

Boosting aquila optimizer by marine predators algorithm for combinatorial optimization

Abstract In this study, an improved version of aquila optimizer (AO) known as EHAOMPA has been developed by using the marine predators algorithm (MPA). MPA is a recent and well-behaved optimizer with a unique memory saving and fish aggregating devices mechanism. At the same time, it suffers from various defects such as inadequate global search, sluggish convergence, and stagnation of local optima. However, AO has contented robust global exploration capability, fast convergence speed, and high search efficiency. Thus, the proposed EHAOMPA aims to complement the shortcomings of AO and MPA while bringing new features. Specifically, the representative-based hunting technique is incorporated into the exploration stage to enhance population diversity. At the same time, random opposition-based learning is introduced into the exploitation stage to prevent the optimizer from sticking to local optima. This study tests the performance of EHAOMPA’s on 23 standard mathematical benchmark functions, 29 complex test functions from the CEC2017 test suite, six constrained industrial engineering design problems, and a convolutional neural network hyperparameter (CNN-hyperparameter) optimization for Corona Virus Disease 19 (COVID-19) computed tomography-image detection problem. EHAOMPA is compared with four existing optimization algorithm types, achieving the best performance on both numerical and practical issues. Compared with other methods, the test function results demonstrate that EHAOMPA exhibits a more potent global search capability, a higher convergence rate, increased accuracy, and an improved ability to avoid local optima. The excellent experimental results in practical problems indicate that the developed EHAOMPA has great potential in solving real-world optimization problems. The combination of multiple strategies can effectively improve the performance of the algorithm. The source code of the EHAOMPA is publicly available at https://github.com/WangShuang92/EHAOMPA.

Artificial bee colony with predator effect algorithm for proportional integral derivative controller tuning

This paper proposes a novel artificial bee colony with predation effect (ABCPE) algorithm for tuning a proportional integral derivative (PID) controller. The mathematical model of ABCPE algorithm to introduce predator effect in the foraging behavior of artificial bees colony algorithm has been formulated. The proposed algorithm has been tested on tuning problems of different process models. The simulation results reveal that the closed-loop responses are relatively fast and non-oscillatory as compared to the frequency response analysis method for reference tracking. Further, the results obtained using ABCPE are also compared with other evolutionary algorithms. The exhaustive analysis shows that the ABCPE-based solution approach leads to a set of tuning parameters having smaller overshoot, less setting time, and rise time compared to other solution approaches. The stability analysis using Nichols plot reveals that the phase margin of proposed algorithm is higher as compared to other tuning methods. Finally, the convergence behavior and robustness analysis reveals the effectiveness of the proposed approach to solve engineering design problems.

A whale optimization algorithm based on atom-like structure differential evolution for solving engineering design problems

The whale optimization algorithm has received much attention since its introduction due to its outstanding performance. However, like other algorithms, the whale optimization algorithm still suffers from some classical problems. To address the issues of slow convergence, low optimization precision, and susceptibility to local convergence in the whale optimization algorithm (WOA). Defining the optimization behavior of whale individuals as quantum mechanical behavior, a whale optimization algorithm based on atom-like structure differential evolution (WOAAD) is proposed. Enhancing the spiral update mechanism by introducing a sine strategy guided by the electron orbital center. Improving the random-walk foraging mechanism by applying mutation operations to both the electron orbital center and random individuals. Performing crossover operations between the newly generated individuals from the improved mechanisms and random dimensions, followed by a selection process to retain superior individuals. This accelerates algorithm convergence, enhances optimization precision, and prevents the algorithm from falling into local convergence. Finally, implementing a scouting bee strategy, where whale individuals progressively increase the number of optimization failures within a limited parameter L. When a threshold is reached, random initialization is carried out to enhance population diversity. Conducting simulation experiments to compare the improved algorithm with the whale optimization algorithm, other optimization algorithms, and other enhanced whale optimization algorithms. The experimental results indicate that the improved algorithm significantly accelerates convergence, enhances optimization precision, and prevents the algorithm from falling into local convergence. Applying the improved algorithm to five engineering design problems, the experimental results demonstrate that the improved algorithm exhibits good applicability.

EABOA: Enhanced adaptive butterfly optimization algorithm for numerical optimization and engineering design problems

The butterfly optimization algorithm (BOA) is a meta-heuristic algorithm that mimics foraging and mating behavior of butterflies. In order to alleviate the problems of slow convergence, local optimum and lack of population diversity of BOA, an enhanced adaptive butterfly optimization algorithm (EABOA) is proposed in this paper. First, a new adaptive fragrance model is designed, which provided a finer fragrance perception way and effectively enhanced the convergence speed and accuracy. Second, Lévy flight with high-frequency short-step jumping and low-frequency long-step walking is adopted to help the algorithm jump out of the local optimum. Third, the dimension learning-based hunting is employed to enhance information exchange by creating neighbors for each butterfly, thus improving the balance between local and global search and maintaining population diversity. In addition, the Fitness-Distance-Constraint (FDC) method is introduced to enhance constraint handling in EABOA (named FDC-EABOA). The proposed EABOA is compared with 8 well-known algorithms and 8 BOA variants in CEC 2022 test suite and the results were statistically analyzed using Friedman, Friedman aligned rank, Wilcoxon signed rank, Quade rank and multiple comparisons, analysis of variance (ANOVA) and range analysis. Finally, EABOA and FDC-EABOA are applied to seven engineering problems (parameter identification of photovoltaic module model, speed reducer design, tension/compression spring design, pressure vessel design, gear train design, welded beam design, SOPWM for 3-level inverters), and metrics such as Improvement Index (IF) and Mean Constraint Violation (MV) confirm that the proposed algorithms are satisfactory. Experimental results and statistical analysis show that the proposed algorithms outperform the comparison algorithms and demonstrate the strong potential for solving numerical optimization and engineering design problems.

A novel reinforcement learning-inspired tunicate swarm algorithm for solving global optimization and engineering design problems

A novel reinforcement learning-inspired tunicate swarm algorithm for solving global optimization and engineering design problems

IOOA: A multi-strategy fusion improved Osprey Optimization Algorithm for global optimization

<abstract><p>With the widespread application of metaheuristic algorithms in engineering and scientific research, finding algorithms with efficient global search capabilities and precise local search performance has become a hot topic in research. The osprey optimization algorithm (OOA) was first proposed in 2023, characterized by its simple structure and strong optimization capability. However, practical tests have revealed that the OOA algorithm inevitably encounters common issues faced by metaheuristic algorithms, such as the tendency to fall into local optima and reduced population diversity in the later stages of the algorithm's iterations. To address these issues, a multi-strategy fusion improved osprey optimization algorithm is proposed (IOOA). First, the characteristics of various chaotic mappings were thoroughly explored, and the adoption of Circle chaotic mapping to replace pseudo-random numbers for population initialization improvement was proposed, increasing initial population diversity and improving the quality of initial solutions. Second, a dynamically adjustable elite guidance mechanism was proposed to dynamically adjust the position updating method according to different stages of the algorithm's iteration, ensuring the algorithm maintains good global search capabilities while significantly increasing the convergence speed of the algorithm. Lastly, a dynamic chaotic weight factor was designed and applied in the development stage of the original algorithm to enhance the algorithm's local search capability and improve the convergence accuracy of the algorithm. To fully verify the effectiveness and practical engineering applicability of the IOOA algorithm, simulation experiments were conducted using 21 benchmark test functions and the CEC-2022 benchmark functions, and the IOOA algorithm was applied to the LSTM power load forecasting problem as well as two engineering design problems. The experimental results show that the IOOA algorithm possesses outstanding global optimization performance in handling complex optimization problems and broad applicability in practical engineering applications.</p></abstract>

An improved vibrating particles system method for many-criteria engineering design applications

Optimization is getting more and more important due to its application in real engineering problems. Recently, the vibrating particles system algorithm has been developed as an efficient method for mono-objective optimization. However, in multi- and many-objective design problems, the vibrating particles system method is unable to handle simultaneously the conflicting objectives. The second drawback of the vibrating particles system algorithm is the~variability of the obtained results at each independent test, due to its inability to balance exploitation and exploration capabilities. To address these issues, this paper proposes an enhanced vibrating particles system algorithm called the many-objective vibrating particles system algorithm. The proposed many-objective vibrating particles system algorithm uses the Pareto principle to store the non-dominated solutions of multiple conflicting functions. Moreover, the implementation of the particle position enhancement mechanism to boost this algorithm's exploitation and exploration capabilities is another distinctive aspect of the suggested method. A variety of high-dimensional test functions and engineering design problems are used to evaluate the efficiency of the many-objective vibrating particles system algorithm. The obtained results show that the proposed algorithm outperforms other popular methods in terms of convergence characteristics and global search ability.

Analysis and Countermeasures of Several Problems in Urban Road Engineering Design

Analysis and Countermeasures of Several Problems in Urban Road Engineering Design

A Comparative Study of Metaheuristic Optimization Algorithms for Solving Real-World Engineering Design Problems

A Comparative Study of Metaheuristic Optimization Algorithms for Solving Real-World Engineering Design Problems

A Modified Bonobo Optimizer With Its Application in Solving Engineering Design Problems

A Modified Bonobo Optimizer With Its Application in Solving Engineering Design Problems

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

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

Investigating the interplay of epistemological and positional framing during collaborative uncertainty management

ABSTRACT Background Dealing with uncertainties is inherent in the engineering design process and often poses challenges for young learners. This necessitates providing learners with adequate support to navigate their uncertainties effectively. However, achieving this requires a deeper understanding of the factors influencing learners’ uncertainty management processes. Method In this paper, we analyze learners’ framing of uncertain situations in collaborative engineering design tasks. Using the case study method, we explore two framing dimensions—epistemological and positional—to understand their impact on collaborative uncertainty management processes. Specifically, we examine how learners’ framing dynamically shifts during uncertainty management activities by analyzing two contrasting cases from a sixth-grade classroom where groups tackled an engineering design problem, employing interaction analysis. Findings Learners’ epistemological and positional framings are intertwined, collectively influencing their own and their team members’ uncertainty management actions. Additionally, contextual factors such as mentor intervention, early success, affect induced by prolonged failure, and time constraints can prompt shifts in learners’ framing, both in productive and unproductive manners. Contribution The paper provides nuanced insights into how learners’ evolving epistemological orientations and positioning influence uncertainty management, offering practical insights into supporting learners’ uncertainty management processes in problem-solving contexts such as engineering design.

Multi-Objective Bayesian Optimization Design of Elliptical Double Serpentine Nozzle

The use of traditional optimization methods in engineering design problems, specifically in aerodynamic and infrared stealth optimization for engine nozzles, requires a large number of objective function evaluations, therefore introducing a considerable challenge in terms of time constraints. In this paper, this limitation is addressed by using a sample-efficient multi-objective Bayesian optimization that takes Kriging as a surrogate model and Expected Hypervolume Improvement as the infill criterion. Using this approach, the probabilistic model is continuously established and updated, and the approximate Pareto front is obtained at a relatively small computational budget. The objective of this work is to evaluate the applicability of employing a multi-objective Bayesian optimization framework for the aerodynamic-infrared shape optimization of an elliptical double serpentine nozzle at 6 km flight condition, where the objective functions are evaluated by means of high-fidelity computational fluid dynamics and reversed Monte Carlo ray tracing simulations. We achieve good results in both infrared radiation signature reduction and aerodynamic performance improvement with a reasonable number of evaluations, indicating that the proposed method is effective and efficient for tackling the computationally intensive optimization challenges in the aircraft design.

Improved Tuna Swarm Optimization Algorithm for Engineering Design Problems

Tuna Swarm Optimization (TSO) which is developed by being inspired by the hunting strategies of the tuna fish is a metaheuristic optimization algorithm (MHA). TSO is able to solve some optimization problems successfully. However, TSO has the handicap of having premature convergence and being caught by local minimum trap. This study proposes a mathematical model aiming to eliminate these disadvantages and to increase the performance of TSO. The basic philosophy of the proposed method is not to focus on the best solution but on the best ones. The Proposed algorithm has been compared to six current and popular MHAs in the literature. Using classical test functions to have a preliminary evaluation is a frequently preferred method in the field of optimization. Therefore, first, all the algorithms were applied to ten classical test functions and the results were interpreted through the Wilcoxon statistical test. The results indicate that the proposed algorithm is successful. Following that, all the algorithms were applied to three engineering design problems, which is the main purpose of this article. The original TSO has a weak performance on design problems. With optimal costs like 1.74 in welded beam design problem, 1581.47 in speed reducer design problem, and 38.455 in I-beam design problem, the proposed algorithm has been the most successful one. Such a case leads us to the idea that the proposed method of this article is successful for improving the performance of TSO.

Performance Evaluation of Capuchin Search Algorithm Through Non-linear Problems, and Optimization of Gear Train Design Problem

The purpose of this paper is to demonstrate the superiority of the Capuchin Search Algorithm (CapSA), a metaheuristic, in competitive environments and its advantages in optimizing engineering design problems. To achieve this, the CEC 2019 function set was used. Due to the challenging characteristics of the CEC 2019 function set in reaching a global solution, it effectively showcases the algorithm's quality. For this comparison, sea-horse optimizer (SHO), grey wolf optimizer (GWO), sine-cosine algorithm (SCA), and smell agent optimization (SAO) were chosen as current and effective alternatives to the CapSA algorithm. Furthermore, the gear train design problem (GTD) was selected as an engineering design problem. In addition to the CapSA algorithm, a hybrid of SCA and GWO algorithm (SC-GWO) and genetic algorithm (GA) were chosen as alternatives for optimizing this problem. The performance superiority and optimization power of the CapSA algorithm were assessed using statistical metrics and convergence curves, then compared with alternative algorithms. Experimental results conclusively demonstrate the significant effectiveness and advantages of the CapSA algorithm.

Giant Armadillo Optimization: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems.

In this paper, a new bio-inspired metaheuristic algorithm called Giant Armadillo Optimization (GAO) is introduced, which imitates the natural behavior of giant armadillo in the wild. The fundamental inspiration in the design of GAO is derived from the hunting strategy of giant armadillos in moving towards prey positions and digging termite mounds. The theory of GAO is expressed and mathematically modeled in two phases: (i) exploration based on simulating the movement of giant armadillos towards termite mounds, and (ii) exploitation based on simulating giant armadillos' digging skills in order to prey on and rip open termite mounds. The performance of GAO in handling optimization tasks is evaluated in order to solve the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that GAO is able to achieve effective solutions for optimization problems by benefiting from its high abilities in exploration, exploitation, and balancing them during the search process. The quality of the results obtained from GAO is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that GAO presents superior performance compared to competitor algorithms by providing better results for most of the benchmark functions. The statistical analysis of the Wilcoxon rank sum test confirms that GAO has a significant statistical superiority over competitor algorithms. The implementation of GAO on the CEC 2011 test suite and four engineering design problems show that the proposed approach has effective performance in dealing with real-world applications.