Skip to main content

Advertisement

Log in

Solving engineering optimization problems using an improved real-coded genetic algorithm (IRGA) with directional mutation and crossover

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Genetic algorithm (GA) is used to solve a variety of optimization problems. Mutation operator also is responsible in GA for maintaining a desired level of diversity in the population. Here, a directional mutation operator is proposed for real-coded genetic algorithm (RGA) along with a directional crossover (DX) operator to improve its performance. These evolutionary operators use directional information to guide the search process in the most promising area of the variable space. The performance of an RGA with the proposed mutation operator and directional crossover (DX) is tested on six benchmark optimization problems of different complexities, and the results are compared to that of the RGAs with five other mutation schemes. The proposed IRGA is found to outperform other RGAs in terms of accuracy in the solutions, convergence rate, and computational time, which is established firmly through statistical analysis. Furthermore, the performance of the proposed IRGA is compared to that of a few recently proposed optimization algorithms. The proposed IRGA is seen to yield the superior results compared to that of the said techniques. It is also applied to solve five constrained engineering optimization problems, where again, it has proved its supremacy. The proposed mutation scheme using directional information leads to an efficient search, and consequently, a superior performance is obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Abbreviations

\( N \) :

Population size

\( p_{\text{c}} \) :

Crossover probability

\( d \) :

Dimensions of an optimization problem

\( \alpha \) :

Multiplying factor

\( {\text{fe}} \) :

Number of function evaluation

\( t_{\text{avg}} \) :

Average CPU time

\( Q_{ \hbox{min} } \) :

Minimum frequency

\( D \) :

Mean diameter

\( \tau \) :

Shear stress

\( P_{\text{c}} \) :

Buckling load on the beam

\( T_{\text{s}} \) :

Shell thickness

\( r_{\text{i}} \) :

Inner radius

\( b \) :

Face width

\( z \) :

Number of teeth on the pinion

\( d_{1} \), \( d_{2} \) :

Diameters of the first and second shafts, respectively

\( r_{\text{m}} \) :

Mean radius of particles

\( {\text{MRR}} \) :

Material removal rate

\( \rho_{\text{w}} \) :

Density of work material

\( H_{\text{dw}} \) :

Dynamic hardness of ductile work material

\( (R_{\text{a}} )_{\hbox{max} } \) :

Permissible surface roughness

\( p_{\text{m}} \) :

Mutation probability

\( p_{\text{cv}} \) :

Variablewise crossover probability

\( p_{\text{best}} \) :

Current best solution

\( p_{\text{mean}} \) :

Average of two parents \( p_{1} \) and \( p_{2} \)

\( \hbox{max} \_{\text{gen}} \) :

Maximum number of generations

\( {\text{fe}}_{\text{avg}} \) :

Average number of function evaluations

\( d_{\text{w}} \) :

Wire diameter

\( n \) :

Number of active coils

\( \theta \) :

Bending stress

\( \delta \) :

End deflection of a bar

\( T_{\text{h}} \) :

Thickness of head

\( l \) :

Length of the cylindrical vessel

\( m \) :

Module of teeth

\( L_{1} \), \( L_{2} \) :

Lengths of the first and second shafts between bearings, respectively

\( \dot{M}_{\text{a}} \) :

Mass flow rate of abrasives

\( v_{\text{a}} \) :

Velocity of abrasives

\( \rho_{\text{a}} \) :

Density of abrasives

\( \delta_{\text{cw}} \) :

Critical plastic strain of ductile work material

\( \zeta \) :

Amount of plastically deformed indentation volume

\( \alpha^{\prime} \) :

Significance level in statistical tests

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dilip Kumar Pratihar.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Das, A.K., Pratihar, D.K. Solving engineering optimization problems using an improved real-coded genetic algorithm (IRGA) with directional mutation and crossover. Soft Comput 25, 5455–5481 (2021). https://doi.org/10.1007/s00500-020-05545-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05545-9

Keywords

Navigation