Skip to main content

Hybrid inner-outer algorithm for solving real-world mechanical optimization problems

Abstract

In the real world, the problems mostly are complex; more precisely, the problems generally are nonlinear or large scale other than if it was mandatory to resolve it under certain constraints, and that is common in engineering design problems. Therefore, the complexity of problem plays a critical role in determining the computational time and cost. Accordingly, a novel algorithm called inner-outer array is proposed in this paper. It depends on the design of parameters and then tolerance design as one of design of experiment stages. In this work, the inner-outer algorithm is used to solve real-world optimization problems to choose the preferable feasible regions of the entire search domain. Numerical results are documented and compared based on four well-known constrained mechanical engineering issues. It can be concluded that the performance of inner-outer algorithm is good to optimize constrained engineering problems, but it still needs some enhancements in the future work.

Introduction

Computational cost and time of evolutionary algorithms are still the focus of attention of researchers and optimizer without prejudice to the aim of seeking to find the global optima. Evolutionary algorithms have computational costs due to many reasons; the most important of them is the complexity of the problem, like the engineering design problems presented here, computing a large number of fitness functions (multi-objective problems), or difficulty to formulate mathematical model. From here, researchers developed several intelligent algorithms in order to overcome these difficulties, such as genetic algorithm, particle swarm algorithms, and ant colony, as what will be detailed in this section. Tasi et al. [1] proposed a novel approach based on combining the Taguchi method and classical genetic algorithm to solve global optimization problems. The aim of this hybridization was to benefit from the powerful of ability to explore the global optima and the ability of Taguchi to screen the optimum chromosomes. The proposed approach was applied to 15 benchmark problems in order to investigate the performance of hybrid algorithm and then compare the results, in addition to the approach presented by Vaghela and Prajapati [2], when a hybrid approach of Taguchi and genetic algorithm was proposed to minimize the number of iterations using the powerful of OA to find the initial population for GA. The comparative results showed that HTGA is able to find the optimal solution or close to optimal than the traditional genetic algorithm. Karen et al. [3] proposed a hybrid approach based on the genetic algorithm and Taguchi method to solve a real-world problem in the design and manufacturing field. The hybrid algorithm was applied to vehicle component. The problems related to automotive industry are usually multi-objective problems. The proposed approach has been subjected to verification by evaluating both of fatigue damage and life of two-bar truss. It was found by results that the hybrid algorithm is more effective than classical optimization methods.

Stjepan et al. [4] examined 8 various kinds of crossover operators to comprehend their impact on the performance of the hybrid Taguchi–genetic algorithm. The aim of that investigation was to outline how to use the algorithm in continuous optimization. The different crossover operators have been tested by using 15 benchmark problems as cases study for each operator. It was found that the best crossover operator for successful hybrid Taguchi genetic algorithm performance was segmented besides roulette wheel selection. Wen-Hsien Ho et al. [5] used an intelligent hybrid approach based on the Taguchi method and genetic algorithm in order to minimize each of bearing offset and shaft alignment which occurred in the marine vessels. The hybrid approach was used to reduce the stress and shear force of shaft especially if that shaft preforms under various conditions. Wang and Guo [6] developed a hybrid algorithm to achieve the optimal structure of rotor of IMP machine that used in electric vehicles. The hybrid algorithm was a combination between genetic algorithm and Taguchi method. They concluded that the hybrid Taguchi genetic algorithm had the ability to fix the deficiency of Taguchi method and genetic algorithm for obtaining the global optimum. Zhang et al. [7] presented a comparison study for designing planar thinned arrays, which was used in antenna, based on hybrid orthogonal genetic algorithm (OGA). The results of using OGA had been compared with previous published results. The investigation results showed that OGA reached a better result than those in the previous work. Hegab et al. [8] used DOE to study the effective parameters of electrical discharge machining (EDM) which was used in machining model of AL-CNT. A fractional factorial design L27 for 3-level 5 parameters has been used to indicate which of them is a statistically significant parameter for each response. The studied parameters are machining on time, discharge current, voltage, total depth of cut, and % wt, and the primary objectives are material removal rate, wear electrode ratio, and average surface roughness.

One of the essential features of real-life optimization issues is that they are nonlinear; therefore, it is time-consuming to obtain acceptable solutions for these nonlinear issues. Heuristic methods are hence typically used to speed up the search for the solution. In this light, Alfarisy et al. [9] chose the genetic algorithm (GA) and simulated annealing (SA) among most popular heuristic approaches because of their ability to get a nearly optimal solution in the narrow searching area. They compared the results of the three types of hybridization of GA and SA applied on nonlinear benchmark functions. They concluded that combining GA with SA enhances the performance of both techniques to solve nonlinear issues. There is a combination between traditional hybrid genetic algorithm (HGA) and local search (LS) method [10] in order to get a simple and economic method. The LS method is based on two methods, which are three-directional search (TD) and Neld-Mead simplex. This hybridization method was proposed to gather between finding global solution with lower cost. This work [11] underlines the importance of hybrid evolutionary algorithms and also presented the several of potentials for hybridization evolutionary algorithms. Considering the preservation of critical features of evolutionary algorithm is the population-based collective learning process, self-adaptation, and robustness. Although the integration between GA and gravitational search algorithm (GSA) [12] has an ability to find the optimal regions of complex search spaces through the interaction of individuals in a population of particles, it suffers from premature convergence particularly when solving complex problems. Therefore, it was hybridized with genetic algorithm to take advantage of its ability to enhance search and avoid premature convergence. One of the newest approaches are proposed under that topic; in the research of Zhange et al. [13], a novel proposal approach integrates a genetic algorithm (GA), an artificial neural network (ANN), multivariate regression analysis (MRA), and a fuzzy logic controller (FLC) to improve the inside environment and energy consumption of building design. One of the critical engineering applications which benefited from hybridization in optimization field is aerospace and automobile manufacturing. As it is known, aluminum is the main element in industrialization of aerospace and automobile due to its lightweight and high resistance to corrosion. Despite its benefits, it is complicated to cut by laser process because its thermal conductivity and reflection are high. A hybrid approach was presented [14] to overcome this problem; this approach depends on combining artificial neural network (ANN)–particle swarm optimization (PSO) algorithm and artificial neural network (ANN)–genetic algorithm (GA). The results had a good indicator of optimizing the parameters for minimum roughness, notch width, and notch taper. Another used algorithm for solving commonly constrained optimization problems is the Tree-Seed algorithm, with several modifications [15,16,17] added and then compared to other algorithms after implementing them on the same benchmark problems which are often real-life problems like a transmission compressor design, electrical motor, and others.

In the real world, the problems mostly are complex; more precisely, the problems generally are nonlinear or large scale other than if it was mandatory to resolve it under certain constraints, and that is common in engineering design problems. Therefore, the complexity of the problem still plays a critical role in determining the computational time and cost. Consequently, the inner-outer array is presented as a promising algorithm as a guide in achieving that goal.

Methods

Design of experiments

Design of experiments (DOE) is a body of knowledge that helps an investigator to perform better experiments, efficiently analyze data, and establish ties between research findings and original study objectives. Experimental design is defined as a statistical method used to study the effects of various parameters at the same time. Thus, it can be widely used to define the best input combination and reach good conditions for improving product or process quality and solve manufacturing issues. Based on DOE definition, it can be concluded that the parameters play an effective role in influencing the outcome according to their nature.

Hybrid inner-outer approach

As mentioned previously, the proposed hybrid inner-outer algorithm for solving nonlinear bound-constrained optimization problems depends on principles of orthogonal arrays and design of experiments approaches. The aim of this algorithm is to narrow down the search domain of the objective functions and accordingly reducing computational time and cost.

Inner-outer array formula

The developed algorithm is called inner-outer array which depends on two stages of design of experiments viz design of parameters and then tolerance design. The layout of this algorithm consists of two or more arrays depending on the number of factors to be studied in the experiment. The algorithm consists of one inner array and one or more outer arrays which depend on the factor number; each array differs from the other in the number of runs that are determined based on the number of factors assigned in this array and the number of levels for each factor. If there are k factors with n-level for each factor, they can be separated to inner and outer arrays. The proposed inner-outer algorithm can be expressed by this formula:

$$ \boldsymbol{Inner}-\boldsymbol{Outer}\ \boldsymbol{Array}\ \boldsymbol{size}={\boldsymbol{I}}^{\boldsymbol{n}}-{\boldsymbol{O}}^{\boldsymbol{m}} $$

I: refers to inner arrays.

O: refers to outer arrays.

n: refers to number of inner arrays.

m: refers to number of outer arrays.

Inner-outer array algorithm

Following the algorithm, it illustrates the step sequence of evaluating fitness functions using the inner-outer algorithm. The steps involved in I − O approach are shown in the inner-outer array algorithm:

Step 1: Identify the problem.

Step 2: State ObjectivesF(x) = F1(x), F2(x)…, Fn(x).

Step 3: Define Output Response(s) Fi(x) and the goal forFi(x).

$$ \underset{x}{\min }{F}_i(x) $$
$$ \underset{x}{\max }{F}_i(x) $$

Step 4: Identify input Variables x = x1,x2,xn

  1. (i)

    State sensitive variables (S. Var.)

  2. (ii)

    State low sensitive or insensitive variables (Ins. Var.)

Step 5: Define Variable Levels

Step 6: Design Experiments

  1. (i)

    Select a proper Inner Array (I-A) for Ins. Var.

  2. (ii)

    Select a proper Outer Array(s) (O-A) for S. Var.

Step 7: Conduct experiment and collect data.

Step 8: Interpret results.

Step 9: Do the following until the termination condition is met:

  1. (i)

    Increase variable levels by unity.

  2. (ii)

    Increase size or number of O-A

$$ {\boldsymbol{F}}_{\boldsymbol{i}}\left(\boldsymbol{x}\right) $$
(Evaluate)
  1. (iii)

    Find the best condition of the trials and compare with earlier best condition. Sort the best one as the best condition.

Step-10: Print the best condition.

Step-11: Stop.

Procedure of inner-outer algorithm

For more clarification, Fig. 1 shows how to arrange 5 variables (x1, x2…, and x5); each variable has 2 levels, with each other in two arrays and then the procedure of evaluating the objective function F(x).

Fig. 1
figure1

Inner- outer array for 5 var-2level

The size of the inner-outer array depends on the number of variables, whose effect on the response will be studied, whereas the number of variables, no matter how many, do not represent an obstacle for this algorithm; as it shown in Fig. 2, there are 7 variables, and 9 variables can be arranged on inner-outer tables according to the importance of these variables.

Fig. 2
figure2

L128 inner-outer arrays

The inner-outer array is designed to treat simply with the significant variables and try to control them and their critical influence on the design by assigning them in outer arrays, as if focusing on them more than others without using of large-scale arrays at the same time.

Application of the proposed in-out algorithm to real-life engineering problems

Optimization engineering design issues are usually subjected to certain constraints. The main objective of constrained optimization problem is to find the best value of x that satisfies the objective function.

$$ \mathit{\operatorname{minimize}}\ f\left(\boldsymbol{x}\right),\boldsymbol{x}=\left({x}_1,{x}_2,\dots, {x}_i,\dots, {x}_n\right) $$

Subject to:

$$ {g}_j\left(\boldsymbol{x}\right)\le 0, for\ j=1,\dots, q\ \left( inequality\ constraint\right) $$
$$ {h}_j\left(\boldsymbol{x}\right)=0, for\ j=q+1,\dots, m\ \left( equality\ constraint\right) $$

xi represents the design parameter, and x is the problem solution, while f(x) is the fitness function which needs to be minimized, and m is the number of problem constraints. To demonstrate the competence and robustness of the proposed algorithm, four well-known constrained optimization engineering problems, pressure vessel, speed reducer, gear train, and disc brake, are exhibited in this section.

Pressure vessel design problem

In this work, pressure vessel is one of the applications that are used to investigate the proposed algorithms and also used in several works before [18, 19]. Pressure vessel issue is studied to reduce the material cost of each shell, forming, and welding. The objective function of pressure vessel is a nonlinear and is subject to one nonlinear inequality constraint, and the three others are linear. To be precise, there are four design variables, as shown in Fig. 3, associated with it. Structure parameters of pressure vessel problem, thickness of the pressure vessel (Ts), thickness of the head (Th), inner radius of the vessel (R), and length of the vessel without heads (L) correspond to x1, x2, x3, and x4 respectively.

Fig. 3
figure3

Pressure vessel design

This issue can be mathematically modeled as follows:

$$ \boldsymbol{\operatorname{Min}}\ \boldsymbol{f}\left(\boldsymbol{x}\right)=\mathbf{0.6224}\ {\boldsymbol{x}}_{\mathbf{1}}{\boldsymbol{x}}_{\mathbf{3}}{\boldsymbol{x}}_{\mathbf{4}}+\mathbf{1.7781}\ {\boldsymbol{x}}_{\mathbf{2}}{\boldsymbol{x}}_{\mathbf{3}}^{\mathbf{2}}+\mathbf{3.1661}\ {\boldsymbol{x}}_{\mathbf{1}}^{\mathbf{2}}{\boldsymbol{x}}_{\mathbf{4}}+\mathbf{19.84}\ {\boldsymbol{x}}_{\mathbf{1}}^{\mathbf{2}}{\boldsymbol{x}}_{\mathbf{3}} $$

Subject to

$$ {g}_1(x)=-{x}_1+0.0193\ {x}_3\le 0 $$
$$ {g}_2(x)=-{x}_2+0.0095\ {x}_3\le 0 $$
$$ {g}_3(x)=-\pi\ {x}_3^2{x}_4-\frac{4}{3}\ \pi\ {x}_3^3+1296000\le 0 $$
$$ {g}_4(x)={x}_4-240\le 0 $$

where

$$ 1\times 0.0625\le {x}_1,{x}_2\le 99\times 0.0625 $$
$$ 10\le {x}_3,{x}_4\le 200 $$

Speed reducer design problem

The presented speed gear reducer design seeks to minimize its weight according to some constraints related to bending stress of the gear teeth, surface stress, transverse deflections of the shafts, and stresses in the shafts. This is used as an investigate optimization model in several research [18, 20]. There are four linear and seven nonlinear inequality constraints for this issue. There are seven design parameters related with gear reducer to be specific the face width x1 = b, module of teeth m = x2, number of teeth in the pinion z1 = x3, length of input shaft between bearings l1 = x4, length of output shaft between bearings l2 = x5, diameter of input shaft d1 = x6, and diameter of output shaft d2 = x7. They are illustrated in the next schematic diagram, Fig. 4.

Fig. 4
figure4

Schematic diagram of gear reducer

This optimization problem can be stated as follows:

$$ \boldsymbol{\operatorname{Min}}\ \boldsymbol{f}\left(\boldsymbol{x}\right)=\mathbf{0.7854}\ {\boldsymbol{x}}_{\mathbf{1}}\ {\boldsymbol{x}}_{\mathbf{2}}^{\mathbf{2}}\left(\mathbf{3.3333}\ {\boldsymbol{x}}_{\mathbf{3}}^{\mathbf{2}}+\mathbf{14.9334}\ {\boldsymbol{x}}_{\mathbf{3}}-\mathbf{43.0934}\right)-\mathbf{1.508}\ {\boldsymbol{x}}_{\mathbf{1}}\left({\boldsymbol{x}}_{\mathbf{6}}^{\mathbf{2}}+{\boldsymbol{x}}_{\mathbf{7}}^{\mathbf{2}}\right)+\mathbf{7.4777}\ \left({\boldsymbol{x}}_{\mathbf{6}}^{\mathbf{3}}+{\boldsymbol{x}}_{\mathbf{7}}^{\mathbf{3}}\right)+\mathbf{0.7854}\ \left({\boldsymbol{x}}_{\mathbf{4}}{\boldsymbol{x}}_{\mathbf{6}}^{\mathbf{2}}+{\boldsymbol{x}}_{\mathbf{5}}{\boldsymbol{x}}_{\mathbf{7}}^{\mathbf{2}}\right) $$

Subject to

$$ {g}_1(x)=\frac{27}{x_1{x}_2^2{x}_3}-1\le 0 $$
$$ {g}_2(x)=\frac{397.5}{x_1{x}_2^2{x}_3^2}-1\le 0 $$
$$ {g}_3(x)=\frac{1.93{x}_4^3}{x_2{x}_3{x}_6^4}-1\le 0 $$
$$ {g}_4(x)=\frac{1.93{x}_5^3}{x_2{x}_3{x}_7^4}-1\le 0 $$
$$ {g}_5(x)=\frac{{\left({\left(\frac{745\ {x}_4}{x_2{x}_3}\right)}^2+16.9\times {10}^6\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$2$}\right.}}{110\ {x}_6^3}-1\le 0 $$
$$ {g}_6(x)=\frac{{\left({\left(\frac{745\ {x}_4}{x_2{x}_3}\right)}^2+157.5\times {10}^6\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$2$}\right.}}{85\ {x}_7^3}-1\le 0 $$
$$ {g}_7(x)=\frac{x_2{x}_3}{40}-1\le 0 $$
$$ {g}_8(x)=\frac{5\ {x}_2}{x_1}-1\le 0 $$
$$ {g}_9(x)=\frac{x_1}{12\ {x}_2}-1\le 0 $$
$$ {g}_{10}(x)=\frac{1.5\ {x}_6+1.9}{x_4}-1\le 0 $$
$$ {g}_{11}(x)=\frac{1.1\ {x}_7+1.9}{x_5}-1\le 0 $$

where

$$ 2.6\le {x}_1\le 3.6;0.7\le {x}_2\le 0.8;17\le {x}_3\le 28;7.3\le {x}_4\le 8.3;7.8\le {x}_5\le 8.3;2.9\le {x}_6\le 3.9;5\le {x}_7\le 5.5 $$

Gear train problem

Let us consider a gear train design problem here [15, 19], which consists of four gears A, B, C, and D as shown in Fig. 5. The cost of the gear ratio is the aim of this problem as seeks to minimize it.

Fig. 5
figure5

Gear train design

The gear ratio is modeled as follows:

$$ gear\ ratio=\frac{n_B{n}_D}{n_C{n}_A} $$

This problem is linear without any constraints and has four design variables nA, nB, nC, and nD are denoted as x1, x2, x3, and x4 respectively, with boundary condition. These variables have to be integral number of teeth, and also, they are in discrete form. The problem can be mathematically defined as:

$$ \boldsymbol{\operatorname{Min}}\ \boldsymbol{f}\left(\boldsymbol{x}\right)={\left(\frac{\mathbf{1}}{\mathbf{6.931}}-\frac{{\boldsymbol{x}}_{\mathbf{3}}{\boldsymbol{x}}_{\mathbf{2}}}{{\boldsymbol{x}}_{\mathbf{1}}{\boldsymbol{x}}_{\mathbf{4}}}\right)}^{\mathbf{2}} $$

where

$$ 12\le {x}_1,{x}_2,{x}_3,{x}_4\le 60 $$

Disc brake problem

The goal in this problem is to reduce both the brake mass and the stopping time in the design of a multiple-disc brake [19]. There are six inequality constraints the design of disc brake is subjected to; they are the minimum distance between the radii, the maximum length of the brake, the pressure, the temperature, and the torque limitations. There are four design variables for disc brake design; they are the inner radius of the discs, the outer radius of the discs, the engaging force, and the number of friction surfaces. The formulation of this design can be expressed as follows:

$$ \mathbf{\operatorname{Min}}\ \boldsymbol{f}\left(\boldsymbol{x}\right)=\frac{\left(\mathbf{4.9}\left({\boldsymbol{x}}_{\mathbf{2}}^{\mathbf{2}}-{\boldsymbol{x}}_{\mathbf{1}}^{\mathbf{2}}\right)\left({\boldsymbol{x}}_{\mathbf{4}}-\mathbf{1}\right)\right)}{\mathbf{1}\mathbf{00000}} $$

Subject to

$$ {g}_1(x)=\frac{98\times {10}^4\left({x}_2^2-{x}_1^2\right)}{x_3{x}_4\left({x}_2^3-{x}_1^3\right)}-32\le 0 $$
$$ {g}_2(x)=20-\left({x}_2-{x}_1\right)\le 0 $$
$$ {g}_3(x)=2.5\left({x}_4+1\right)-30\le 0 $$
$$ {g}_4(x)=\frac{x_3}{3.14\left({x}_2^2-{x}_1^2\right)}-0.4\le 0 $$
$$ {g}_5(x)=\frac{22.2\times {10}^{-4}\ {x}_3\ \left({x}_2^3-{x}_1^3\right)}{{\left({x}_2^2-{x}_1^2\right)}^2}-1\le 0 $$
$$ {g}_6(x)=900-\frac{266\times {10}^{-4}\ {x}_3\ {x}_4\ \left({x}_2^3-{x}_1^3\right)}{\left({x}_2^2-{x}_1^2\right)}\le 0 $$

where

$$ 55\le {x}_1\le 80;75\le {x}_2\le 110; $$
$$ 1000\le {x}_3\le 3000;2\le {x}_4\le 20 $$

Verification of proposed algorithm

There are four viewpoints have been used to validate the performance of the proposed algorithm through them. Each one of them has been discussed separately and then displays the results that have been accessed.

Studying a local optimum solution

After applying the orthogonal arrays to the case of the study and obtaining the results, the first result following the global optimum value was studied by focusing on it so that a larger size of the matrix was used. In other words, the tolerance design procedure was applied to it and the number of levels increased and then the extent of its impact on the results was studied.

For example, if L4 OA is used to express 2-level, then the number of levels can be increased to 4 and hence L8 OA is used. Table 1 shows the original inner-outer array to pressure vessel design problem, where the optimal value 86236.7 was achieved when values of x1, x2, x3, and x4 are 6.1875, 0.0625, 105, and 10, respectively.

Table 1 Inner-outer arrays of pressure vessel design

The first result after that optimal was 136166.7735 at variables; values are x1…,5 = {6.1875, 0.0625, 105, 105}, and Table 2 illustrates the implementation of tolerance design (upsize levels) at this condition.

Table 2 Inner-outer array of next local optimum condition

It is clear that the result is improved by studying the next local value of the optimal and applying the tolerance design to it.

Inner and outer arrays swapping

The results of the inner-outer array are investigated by swapping between both the inner matrix and the outer matrix. To clarify, if the inner array is L4 OA, where it expresses two variables with 2-level, and the outer array is L9 OA for 3-level of two variables, here both the number of levels and experiments are swapped between the inner and outer arrays, so that the size of the inner array will equal 9 runs for 3-level and the outer array will be L4 for 2-level, as shown in Tables 3 and 4.

Table 3 Before swapping
Table 4 After swapping

When the inner-outer array is constructed as L4 OA for inner and L9 OA for outer, the best value for the objective function that satisfies all constraints is 86236.660 (before swapping). The value of best solution became 165275.1 after swapping the size of arrays, as it became L9 OA for inner array and L4 OA for the outer.

Mixed inner-outer array

In inner-outer algorithm is possible to increase the number of outer arrays based on the number of variables, and here, this algorithm overcomes the problem of using mixed arrays that cannot be subjected to fractionation, especially in the case of many variables with different levels, for example, if there are six variables with three levels and four others with two levels, in this case, the size of the array is 36 × 24 = 11664, and this is very huge size.

Speed reducer design problem has seven variables at different levels; there are five variables with 2-level and two factors with 3-level in normal; it is represented by mixed array which its size is 25 × 32 equal 288 runs. This size has been reduced by almost half by using the inner-outer array to be only 144 runs, as illustrated in Table 5.

Table 5 Inner-outer array of speed reducer design

Convergence of results

First, the relationship between the objective function and the number of iterations to study convergence is represented; secondly is applying ANOVA to find out which of the problem variables are the most and least significant. Subsequently, the least significant variable is fixed at a certain level and then the relationship between the objective function and the number of iterations is plotted again on the same curve to find out whether the convergence started from the same point or not.

Figures 6 and 7 show the relation between the number of iterations and objective function values before and after ANOVA implementation for both issues speed reducer design and disc brake design. Unfortunately, the convergence is not clear on these curves that may be occurred because the selective levels are unsuitable to represent these problems.

Fig. 6
figure6

Relation between iterations and F(x) for speed reducer

Fig. 7
figure7

Relation between iterations and F(x) for disc brake

Figure 8 shows the relation between objective function and iterations before and after applying tolerance design stage on gear train design problem. The result shows the convergence is beginning from the first iteration.

Fig. 8
figure8

Relation between iterations and F(x) for gear train

Result

The inner-outer algorithm and ANOVA for the stated optimization engineering problems was implemented by using Minitab 19. The suitability of the in-out array was reconfirmed by applying it to solve mechanical optimization engineering problems. A comparison of our results is provided in Table 6 with those obtained by TSA [15], GA-PSO-SQP [20], CI [18], GAMS [21], and ABC [21] algorithms. It is clearly shown that the suggested algorithm leads to acceptable results.

Table 6 Comparison of the best solution obtained from various studies for optimization problems

Discussion

The result of the inner-outer algorithm in designing speed reducer is better with 0.11% than that previously published using hybrid genetic algorithm- particle swarm optimization-sequential quadratic programming (GA-PSO-SQP). In both designs of gear train and disc brake, the results are almost equal to the previously reported results using optimization techniques like artificial bee colony algorithm (ABC) and general algebraic modeling system (GAMS). The outcome of the pressure vessel issue did not achieve the optimum result by using the inner-outer array, but it is clear that the result improved after applying the tolerance design by 5%, indicating that raising the tolerance design percentage improves the result, which will be investigated further.

Levels of the variables in the condition that achieved the optimum result from inner-outer array are as follows: second level for x1 = 6.1875, first level for x2 = 0.0625, second level for x3 = 105, and first level for x4 = 10. By studying the local optimum, as a first verification of proposed algorithm, the first condition, after the optimal condition, its variables levels are second level for x1 = 6.1875, first level for x2 = 0.0625, second level for x3 = 105, and third level for x4 = 105. It is clear that the difference between the levels of the fourth variable x4 is responsible for the lack of access to optimal value of the objective function.

A worse result for pressure vessel design is obtained, in the second verification, when the size of outer array that includes the ×3 and ×4 is reduced from L9 OA to L4 OA. Accordingly, those variables are more sensitive variables and affected this problem than others.

The problem of using orthogonal arrays for representing large-scale problems is the huge size of these arrays like speed reducer design problem. As its size is too large to be implemented using orthogonal arrays, the proposed method has ability to overcome this obstacle by reducing the number of experiments by almost half as what was shown in the third verification.

The fourth verification, its result, shows that the convergence has not yet appeared even after applying ANOVA on both speed reducer and disc brake problems. It was formed when the tolerance design phase was applied to the gear train problem. This is due to the fact that, in general, the levels are treated as discrete, unlike the tolerance design stage, which deals with them as if they are continuous, because they are very narrow.

Conclusion

In this work, an effective optimization approach is developed based on the fundamentals of design of experiments (DOE). This proposed approach was compared to other optimization techniques in order to evaluate its performance and robustness, using four real-life engineering design problems. These problems are nonlinear and constrained optimization problems. In addition, the performance of this algorithm was also verified by four different methods, as was explained before. In light of the above result, it can be concluded that inner-outer algorithm is a promising tool in solving constrained optimization problems than traditional orthogonal arrays. However, more enhancements are needed in the future; the power of this approach lies in its ability to compare to global optimization strategies such as the genetic algorithm and others, and in some cases, it also outperformed them with fewer iterations, as shown by the results. Hence, the strength of the in-out array is notable in the possibility of combining it with any optimizer techniques.

Availability of data and materials

The data of hybrid optimization algorithms that support the findings of this study are available in “Springer,” https://link.springer.com/chapter/10.1007/978-981-13-1610-4_1

Abbreviations

I-O:

Inner-outer array

TD:

Tolerance design

ABC:

Artificial bee colony algorithm

PSO:

Particle swarm optimization algorithm

CI:

Cohort intelligence

GA-PSO-SQP:

Hybrid genetic algorithm- particle swarm optimization- sequential quadratic programming

TSA:

Tree-Seed algorithm

GAMS:

General algebraic modeling system

References

  1. 1.

    Tsai JT, Liu TK, Chou JH (2004) Hybrid Taguchi-genetic algorithm for global numerical optimization. IEEE Transactions on evolutionary computation 8(4):365–377. https://doi.org/10.1109/TEVC.2004.826895

    Article  Google Scholar 

  2. 2.

    Vaghela PA, Prajapati JM (2019) Hybridization of Taguchi and genetic algorithm to minimize iteration for optimization of solution. MethodsX 6:230–238. https://doi.org/10.1016/j.mex.2019.01.002

    Article  Google Scholar 

  3. 3.

    Karen I, Yildiz AR, Kaya N, Öztürk NURSEL, Oeztuerk FERRUH (2006) Hybrid approach for genetic algorithm and Taguchi’s method based design optimization in the automotive industry. Int J Prod Res 44(22):4897–4914. https://doi.org/10.1080/00207540600619932

    Article  MATH  Google Scholar 

  4. 4.

    Picek S, Golub M, Jakobovic D (2012) Influence of the crossover operator in the performance of the hybrid Taguchi GA. In: 2012 IEEE Congress on Evolutionary Computation (pp. 1-8). IEEE

    Google Scholar 

  5. 5.

    Ho WH, Tsai JT, Chou JH, Yue JB (2016) Intelligent hybrid Taguchi-genetic algorithm for multi-criteria optimization of shaft alignment in marine vessels. IEEE Access 4:2304–2313. https://doi.org/10.1109/ACCESS.2016.2569537

    Article  Google Scholar 

  6. 6.

    Wang A, Guo J (2017) A novel hybrid genetic algorithm for optimal design of IPM machines for electric vehicle. Open Physics 15(1):984–991

    MathSciNet  Article  Google Scholar 

  7. 7.

    Zhang L, Jiao YC, Chen B, Li H (2012) Orthogonal genetic algorithm for planar thinned array designs. Int J Antennas Propagation. 2012. https://www.hindawi.com/journals/ijap/2012/319037/.

  8. 8.

    Hegab HA, Gadallah MH, Esawi AK (2015) Modeling and optimization of Electrical Discharge Machining (EDM) using statistical design. Manufacturing Review 2:21. https://doi.org/10.1051/mfreview/2015023

    Article  Google Scholar 

  9. 9.

    Fatyanosa TN, Sihananto AN, Alfarisy GAF, Burhan MS, Mahmudy WF (2017) Hybrid genetic algorithm and simulated annealing for function optimization. Journal of Information Technology and Computer Science 1(2):82–97. https://doi.org/10.25126/jitecs.20161215

    Article  Google Scholar 

  10. 10.

    Wan W, Birch JB (2013) An improved hybrid genetic algorithm with a new local search procedure. J Appl Math. 2013. https://www.hindawi.com/journals/jam/2013/103591/.

  11. 11.

    Grosan C, Abraham A (2007) Hybrid evolutionary algorithms: methodologies, architectures, and reviews. In: Hybrid evolutionary algorithms (pp. 1-17). Springer, Berlin

    Google Scholar 

  12. 12.

    Zhang A, Sun G, Wang Z, Yao Y (2015) A hybrid genetic algorithm and gravitational search algorithm for global optimization. Neural Network World 25(1):53

    Article  Google Scholar 

  13. 13.

    Zhang T, Liu Y, Rao Y, Li X, Zhao Q (2020) Optimal design of building environment with hybrid genetic algorithm, artificial neural network, multivariate regression analysis and fuzzy logic controller. Building and Environment 175:106810. https://doi.org/10.1016/j.buildenv.2020.106810

    Article  Google Scholar 

  14. 14.

    Hamdi M, Zaied M (2019) Resource allocation based on hybrid genetic algorithm and particle swarm optimization for D2D multicast communications. Applied Soft Computing 83:105605. https://doi.org/10.1016/j.asoc.2019.105605

    Article  Google Scholar 

  15. 15.

    Sahman MA, Cinar AC, Saritas I, Yasar A (2019) Tree-seed algorithm in solving real-life optimization problems. In: IOP conference series: materials science and engineering (Vol. 675, No. 1, p. 012030). IOP Publishing

    Google Scholar 

  16. 16.

    Babalik A, Cinar AC, Kiran MS (2018) A modification of tree-seed algorithm using Deb’s rules for constrained optimization. Applied Soft Computing 63:289–305. https://doi.org/10.1016/j.asoc.2017.10.013

    Article  Google Scholar 

  17. 17.

    Mutluer M, Şahman MA, Çunkaş M (2020) Heuristic optimization based on penalty approach for surface permanent magnet synchronous machines. Arabian Journal for Science and Engineering 45(8):6751–6767. https://doi.org/10.1007/s13369-020-04689-y

    Article  Google Scholar 

  18. 18.

    Shastri AS, Thorat EV, Kulkarni AJ, Jadhav PS (2019) Optimization of constrained engineering design problems using cohort intelligence method. In: Proceedings of the 2nd International Conference on Data Engineering and Communication Technology (pp. 1-11). Springer, Singapore

    Google Scholar 

  19. 19.

    Akay B, Karaboga D (2012) Artificial bee colony algorithm for large-scale problems and engineering design optimization. Journal of intelligent manufacturing 23(4):1001–1014. https://doi.org/10.1007/s10845-010-0393-4

    Article  Google Scholar 

  20. 20.

    Belkourchia Y, Azrar L, Zeriab ESM (2019) A hybrid optimization algorithm for solving constrained engineering design problems. In: 2019 5th International Conference on Optimization and Applications (ICOA) (pp. 1-7). IEEE

    Google Scholar 

  21. 21.

    Andrei N, Andrei N (2013) Nonlinear optimization applications using the GAMS technology (pp. 178-181). Springer, New York. https://doi.org/10.1007/978-1-4614-6797-7

    Book  MATH  Google Scholar 

Download references

Acknowledgements

This article is made possible with the assistance and encouragement of both the Faculty of Engineering at Port Said University and Cairo University. The authors would like to thank the reviewers for their suggestions that have enhanced the article presentation.

Funding

No specific funding has to be declared for this work.

Author information

Affiliations

Authors

Contributions

MG performed the conceptualization of the research idea, participated in the interpretation of the results, reviewed the edited manuscript, and supervised the whole project. OA carried out the research methodology, developed the computational technique and performed the investigation and validation of the analytical work, and wrote the manuscript draft. HK and MZ took part in the interpretation of the results and revised the manuscript draft. All authors contributed to the discussion of the results and visualization of the final manuscript.

Corresponding author

Correspondence to Omnia Osman Fadel Abouhabaga.

Ethics declarations

Competing interests

The authors declare that they have no competing interests.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Abouhabaga, O.O.F., Gadallah, M.H., Kouta, H.K. et al. Hybrid inner-outer algorithm for solving real-world mechanical optimization problems. J. Eng. Appl. Sci. 68, 2 (2021). https://doi.org/10.1186/s44147-021-00004-0

Download citation

Keywords

  • Inner-outer array
  • Constrained optimization
  • engineering design problems
  • Hybrid algorithms