Next Article in Journal
Decarbonisation of Natural Gas Grid: A Review of GIS-Based Approaches on Spatial Biomass Assessment, Plant Siting and Biomethane Grid Injection
Next Article in Special Issue
Investigation of a Micro Two-Phase Flux-Switching Motor
Previous Article in Journal
Adaptive Robust Optimal Scheduling of Combined Heat and Power Microgrids Based on Photovoltaic Mechanism/Data Fusion-Driven Power Prediction
Previous Article in Special Issue
Overview on Permanent Magnet Motor Trends and Developments
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Induction Motor Geometric Parameter Optimization Using a Metaheuristic Optimization Method for High-Efficiency Motor Design

by
Hasbi Apaydin
1,*,
Necibe Füsun Oyman Serteller
1 and
Yüksel Oğuz
2
1
Faculty of Technology, Department of Electrical and Electronics Engineering, Marmara University, Istanbul 34843, Turkey
2
Faculty of Technology, Department of Electrical and Electronics Engineering, Afyon Kocatepe University, Afyonkarahisar 03200, Turkey
*
Author to whom correspondence should be addressed.
Energies 2025, 18(3), 733; https://doi.org/10.3390/en18030733
Submission received: 31 December 2024 / Revised: 20 January 2025 / Accepted: 30 January 2025 / Published: 5 February 2025

Abstract

:
In this study, the optimum design for an induction motor (IM) was realized by providing details of its geometric design. The IM optimization was carried out using the Artificial Ecosystem-based Optimization (AEO) algorithm, a metaheuristic method. The AEO algorithm was used for the first time in IM optimization, and the design parameters were optimized. Ten motor design parameters were used as design variables. IM efficiency was improved, as the objective function. The genetic algorithm (GA) optimization method was used for comparison with the results obtained with the AEO method. The optimized and unoptimized results of the IM design generated with codes created in the Matlab program were verified with the Ansys RMxprt EM Suite 19.2 program, and it could be seen that the results are in good agreement. As a result of these studies, it was observed that the use of AEO in determining the geometric parameters of the IM had better convergence accuracy and reached the optimum result in a shorter time compared to the GA optimization method. It was observed that IM efficiency increased from 90.34% to 91.575% on average with the AEO method.

1. Introduction

In developed and developing countries, three-phase IMs still remain the preferred type of motor for use in industry. The reasons for preferring these motors are their low power consumption, durability, low maintenance, and low cost [1,2,3]. Due to their widespread use in industry, IMs constitute a large part of the total power consumption [4,5,6]. For this reason, the smallest efficiency increase in these motors provides great energy savings worldwide. In this context, the design criteria of IMs should be reviewed, higher-quality magnetic materials should be used, and the geometric parameters of the motor (rotor, stator slots, and air gap) should be determined optimally [7,8]. Geometric parameters affect motor performance in different ways. An increase in a certain parameter may increase one parameter while decreasing another [9]. Therefore, the optimization of their design is crucial for the optimal performance of IMs.
In the literature, design optimization studies to improve the performance of IMs are available and continue to be investigated [10]. The majority of these studies have generally been carried out in the form of GA optimization or derivatives of this algorithm. In [11], a numerical optimization technique was employed to minimize the effects of IM air gap harmonics and maximize the winding factor, optimizing the number of slots per pole, slot positions, and slot sizes. In [12], IM design optimization was performed using a GA, where the torque, efficiency, and cost functions were used as objective functions, resulting in a 25% reduction in motor cost. In [13], Particle Swarm Optimization (PSO) was employed to optimize the design of an IM, and the results were then compared with those obtained using a GA. The results showed a 2% increase in efficiency and an approximate increase of 2 Nm in starting torque and pull-out torque. It was concluded that successful results could be achieved in motor design using the PSO algorithm. In [14], IM design optimization was carried out using a “hybrid GA,” leading to improvements in efficiency and torque values. In [15], for electric vehicle applications, a GA was used to create a multi-objective optimization problem involving stator and rotor slot sizes to maximize the pull-out torque, efficiency, and power factor. In [16], to determine the equivalent circuit parameters of an IM, a GA and a Differential Evolution algorithm were utilized. The Differential Evolution algorithm revealed a shorter convergence time and greater precision compared to the GA. In [17], the efficiency optimization of a 3 kW IM was performed using a GA and a hybrid GA, achieving an efficiency of 86.2034% with the hybrid GA despite all constraints, which was 0.3132% higher than the efficiency obtained with the GA. In [18], it was reported that a 7.5 kW, four-pole IM was traditionally designed and then optimized using a GA in Matlab, resulting in a 1.02% increase in efficiency and a reduction of 1.11 kg in weight. In [19], the optimization of motor slot sizes using a GA resulted in an improvement in efficiency; however, altering the motor core diameters affected efficiency more significantly, with a 0.55% increase in efficiency when the stator and rotor outer diameters were increased. In [20], the optimization of losses for a 20 kVA IM was conducted using a GA, and a reduction in losses was observed through the optimization of design parameters.
This article aims to contribute to the optimization of IM design by using a new or innovative design and to obtain a more efficient design by considering the interaction of the geometric parameters of the motor. For this purpose, the aim is to reduce the losses of the IM and accordingly to obtain maximum efficiency. In order to achieve this goal, the optimization of the geometric parameters of the motor was carried out with the AEO algorithm, one of the current optimization methods, using 10 design criteria and constraints of the IM. The GA method was used to compare the optimization results obtained from the AEO algorithm, which was used for the first time in the optimization of the geometric parameters of an IM, and to evaluate the performance of the optimization algorithms. In this study, the codes of the IM design calculations and optimization algorithms were developed in the Matlab R2024a program. This study constitutes an important step that will enable more efficient and sustainable designs for electrical machines by using the AEO algorithm, which is one of the current optimization algorithms.

2. Design Calculations for Induction Motors

The IM design was carried out using the design equations from Refs. [21,22,23,24,25,26] in this section. For the IM geometry in this design, the stator geometry shown in Figure 1a and the rotor geometry shown in Figure 1b were used.
To achieve maximum efficiency, it is necessary to minimize the losses in the IM. The mathematical equations for the losses and the efficiency calculations in motor design are provided below. Stator winding losses are presented in Equation (1):
P c u s = 3 · R s · I 1 n 2
In Equation (1), R s (ohm) is the stator resistance and I 1 n (A) is the rated current. Rotor cage losses P r 1 ( Ω ) are presented in Equation (2):
P r 1 = 3 · ( R r ) s n · K i 2 · I 1 n 2 K i = 0.8 · cos φ 1 + 0.2
In Equation (2), ( R r ) s n   ( Ω ) represents the rotor resistance. The mechanical ventilation losses P m v (W) and stray losses P s t r a y (W) are expressed by the following equations:
P m v = 0.012 · P n f o r 2 p = 4 P s t r a y = 0.01 · P n
The stator teeth fundamental losses P t 1 (W) and stator back iron fundamental losses P y 1 (W) can be written as the following equation:
P t 1 K t · p 10 · ( F 50 ) 1.3 · B t s 1.7 · G t 1 P y 1 K y · p 10 · ( F 50 ) 1.3 · B c s 1.7 · G y 1
In Equation (4), p 10 (W/Kg) is the specific losses at 1 Tesla and 50 Hz, the K t K y value depends on the material quality and sharpening of the tooth, F (Hz) is the frequency, G t 1 (Kg) is the stator tooth weight, G y 1 (Kg) is the stator yoke weight, B t s (T) is the stator tooth magnetic flux density, and B c s (T) is the stator yoke magnetic flux density.
G t 1 = γ i r o n e · N s · b t s · ( h s 0 + h s 1 + h s 2 ) · L · K F E G y 1 = γ i r o n e · π 4 · D o u t 2 ( D o u t 2 · h c s ) 2 · L · K F E
In Equation (5), γ i r o n e (kg/m3) is expressed as the weight of iron per unit volume, the N s value is the number of stator slots, b t s (m) is the stator slot teeth width, L (m) is stator core length, K F   E is the stacking factor, and h c s (m) is expressed as the stator yoke distance. Fundamental iron losses can be written with the following equation:
P i r o n e 1 = p y 1 + p t 1
The tooth flux pulsation core loss P i r o n e 2 (W) is the sum of the p y 1 and p t 1 , which is given by the following equation:
P i r o n e 2 = 5 × 10 5 N r · F p · 1 2.2 B t s · t s r t s r b r 0 2 5 · g b r 0 1 · B g 2 · G t 1 + N s · F p · 1 2.2 B t r · t s t s b s 0 2 5 · g b s 0 1 · B g 2 · G t 2
In Equation (7), the N r value is the number of rotor slots, t s r (m) is the rotor slot pitch, t s (m) is the stator slot pitch, B t r (T) is the rotor tooth magnetic flux density, g (m) is the air gap length, and B g (T) is the air gap flux density. G t 2 represents the rotor teeth weight and is derived as follows:
G t 2 = γ i r o n e · N r · ( h r 1 + b r 1 + b r 2 2 ) · L · K F E
Since the output power is P o u t , the efficiency of the IM can be written as follows, as in Equation (9):
η = P o u t P o u t + P l o s s e s = P o u t P o u t + ( P c u s + P r 1 + P m v + P s t r a y + P i r o n e 1 + P i r o n e 2 )

3. Optimization Methods Used for High-Performance IM Design

Many of the requirements for the design of an IM contradict each other. Therefore, it is very difficult to achieve a manual design that meets all the constraints. To solve this problem, computer software and optimization techniques must be used [27,28]. Optimization aims to consistently produce the best possible result [29,30]. Today, many optimization techniques have been formulated to solve the encountered problems and have been applied to various fields; the development of these techniques continues [31]. From a mathematical perspective, it is often difficult to find the most appropriate solution that meets all the objectives [32,33]. In this context, researchers have focused on developing general-purpose and high-performance optimization methods and have created optimization algorithms inspired by natural events. These methods, called metaheuristic algorithms, try to solve optimization problems by being inspired by behaviors, reactions, and communication mechanisms in nature [34,35,36,37]. Among these methods, the well-known GA method is the most widely used optimization method. In recent years, a variety of new optimization algorithms have been created; AEO is among these algorithms. These algorithms have been preferred recently due to their competitive performance in solving real engineering problems.

3.1. Genetic Algorithm

Regarding the GA, it is impossible to know the best solution at the outset. The goal is to reach the maximum or minimum point according to the objective function using algorithms. When using the GA, the problem must be accurately defined, and coding should be appropriately conducted according to the types of variables. The fitness function, which is one of the inputs to the problem, must be clearly defined. As genetic operators like crossover and mutation are used randomly during different stages of the evolutionary process, determining their application probability is important. Finally, the problem must be solved by determining the convergence criteria [38,39,40,41,42,43].

3.2. Artificial Ecosystem-Based Optimization

AEO was developed by Zhao and his colleagues in 2020. This algorithm is a population-based optimization algorithm inspired by the energy flow in an ecosystem, and this algorithm imitates three matchless behaviors of living organisms: manufacturers, consumers, and decomposers. Producers include plants that obtain the nutrients they need through photosynthesis and thus do not need to obtain energy from other organisms. They are used to increase the equilibrium between exploration and exploitation. Consumers are animals that have to obtain the energy they need from other consumer and producer groups. Animals are divided into groups such as herbivores, carnivores, and omnivores, which are both carnivores and herbivores. Decomposers are a group consisting of bacteria and fungi. This group uses the remains of dead organisms and converts them into nutrients such as water and minerals. They are proposed with the goal of improving the algorithm’s exploitation proficiency. Producers reuse these nutrients and restart the food chain cycle. The algorithm mimics this nutrient flow from producers to decomposers [44].

3.2.1. Manufacturers

The generator operator is modeled mathematically by the equation below:
x 1 ( t + 1 ) = ( 1 α ) · x n ( t ) + α · x r a n d o m ( t ) α = ( 1 t / t max ) h 1 x r a n d o m = h ( U bound L bound ) + L bound
where α is the linear weight coefficient, n is the population size, x r a n d o m is the location of a randomly generated individual in the search space, t max is the maximum number of iterations, h 1 is a random number in the range [0, 1], h is a random vector in the range [0, 1], and L bound and U bound are the lower and upper bounds, respectively.

3.2.2. Consumers

Levy is given as a consumption parameter with flight characteristics:
D = 1 2 · f 1 f 2 , f 1 N n o r m ( 0 , 1 ) , f 2 N n o r m ( 0 , 1 )
where N n o r m 0 , 1   is a normal distribution. The following equations describe three types of consumers, each randomly selected and dependent on how they interact with producers and other consumers:
  • Herbivores are mathematically expressed as follows:
x i ( t + 1 ) = x i ( t ) + D · ( x i ( t ) x 1 ( t ) ) , i [ 2 , , n ]
  • Carnivores are mathematically formulated as follows:
x i ( t + 1 ) = x i ( t ) + D · ( x i ( t ) x j ( t ) ) i 2 , , n j = r a n d i ( 2 i 1 )
  • Omnivores are mathematically modeled as follows:
x i ( t + 1 ) = x i ( t ) + D · ( x i ( t ) x 1 ( t ) ) + ( 1 h 2 ) · ( x i ( t ) x j ( t ) ) i = 3 , , n j = r a n d i ( 2 i 1 )
where h 2 is a random number in the range [0, 1].

3.2.3. Decomposition

The position of the i-th individual in the population x i can be improved to a better position depending on the discriminant x n , discriminant factor E, and weight coefficients e and h, as described by the following equation:
x i ( t + 1 ) = x n ( t ) + E · ( a 1 · x n ( t ) a 2 · x n ( t ) ) , i = 1 , n E = 3 · c , c N ( 0 , 1 ) a 1 = h 3 · r a n d i ( 1 2 ) 1 a 2 = 2 · h 3 1
The AEO algorithm performs operations using Equations (10)–(15). The flow diagram of AEO is given in Figure 2.

4. Comparison of AEO and GA

There are many benchmark test functions in the literature to evaluate the performance of heuristic optimization algorithms. A comprehensive analysis was performed on 13 popular benchmark test functions to evaluate the efficiency and performance of AEO and GA. The seven unimodal test functions in Table 1 have a single local minimum, while the multimodal test functions in Table 2 have multiple local minimums [45]. The chosen test functions are effective in assessing the convergence behavior of the algorithms.
Two optimization algorithms were applied to 13 test functions, 7 of which were unimodal and 6 of which were multimodal. Each algorithm was run 10 times for each function. To ensure a fair comparison, the population size for each algorithm was set to 50, and the maximum number of iterations was set to 200. The statistical results for these 13 test functions are presented in Table 3.
It is seen that the AEO algorithm has the best average solution, minimum convergence, and standard deviation value in the unimodal and multimodal test functions. The performance curves of the GA and AEO optimization algorithms in the 13 quality test functions are given in more detail in Figure 3.
When the performance curves of the two algorithms given in Figure 3 are examined, it is seen that the AEO algorithm converges better than the GAs. Especially for the functions f5, f6, and f11, the AEO algorithm converges in small iterations at the 20th iteration. In general, the AEO algorithm shows excellent convergence ability and superior performance in most of the comparison functions.

5. Design Procedure for an Induction Motor

In the IM optimization study, it is very important to determine the objective function and the relevant motor parameters, to determine the limits of the determined motor parameters, and to determine the constraints. The IM parameters used in this study are presented in Table 4.
Table 4. IM specifications used in this study [21].
Table 4. IM specifications used in this study [21].
Description/SymbolsUnitsValuesDescription/SymbolsUnitsValues
( P o u t ) kW5.5 ( b s 0 ) mm2.2
Applied   voltage ( V i n ) Volt460 ( h s 0 ) mm1
( F ) Hz60 ( h s 1 ) mm1.5
Number   of   phases ( m ) 3 ( N r ) 28
Number   of   poles ( 2 p ) 4 Rotor   bars   per   slot ( Z s r ) 1
( η ) 0.895 Rotor   current   density ( J b ) A / m m 2 3.42
Targeted   power   factor ( cos φ ) 0.83 Flux   density   of   rotor   tooth ( B t r ) T1.60
( N s ) 36 Flux   density   of   rotor   backcore ( B c r ) T1.60
Stator   current   density ( J s t a t o r ) A / m m 2 4.50 Current   density   of   endrings ( J e r ) A / m m 2 0.75 × J b
( B g ) T0.70 ( b r 0 ) mm1.5
( B t s ) T1.55 ( h r 0 ) mm1
( K F E ) 0.95 Copper   resistivity   at   2 0 ° C ( ( ρ c o ) 20 ο   C ) Ω m 1.78 × 10−8
( γ i r o n e ) kg / m 3 7800 Copper   resistivity   at   8 0   ° C ( ( ρ c o ) 80 ο   C ) Ω m 2.17 × 10−8
Resistivity   of   aluminum   at   2 0   ° C ( ( ρ A L ) 20 ο   C ) Ω m 3.1 × 10−8
The IM analytical calculations are explained in detail in Section II. Analytical calculations of the motor were performed with codes created in the Matlab program. Geometric dimensions of the pre-designed motor were obtained. The geometric dimensions of the motor obtained as a result of analytical calculations are presented in Table 5.
Using the motor’s geometric dimensions obtained from Table 5, the analysis of the IM was recalculated with a program that performs analytical calculations based on the motor’s geometric dimensions, which were created in the Matlab program. The results of the IM’s analytical calculations are presented in Table 6. To assess the accuracy of the results, the IM analysis was also conducted using the Ansys RMxprt program, employing the same geometric measurements. The motor analysis results obtained from the Ansys RMxprt program are also provided in the table for comparison.
For the design optimization of the IM, 10 of the geometric dimensions of the motor were selected as design parameters. The selected parameters, along with their initial values and upper and lower bounds are presented in Table 7. During the optimization study, a constraint of two decimal places was applied to determine the motor parameters, and the number of conductors per slot n s was treated as an integer in the code.
Constraints play an essential role in the manufacturing of a motor, and a motor should be manufactured by paying attention to the specified constraints. These constraints can directly affect the performance and reliability of the motor. In addition, the constraints shape the success of the optimization process by affecting the change in the objective function. Therefore, all constraints used in the design process should be carefully selected and applied. The constraints considered during the design are presented in Table 8.

6. Results and Discussion

In developing the proposed algorithms, a computer with an Intel Core i3-1115G4 CPU running at 3 GHz with 8 GB of RAM and a 256 GB SSD was used to ensure efficient and fast algorithm performance. The algorithms and calculations were performed in the Matlab program. The GA and AEO optimization algorithms were run based on the 10 design parameters given in Table 7 and the 9 constraints given in Table 8. As the objective function, the IM efficiency value expressed in Equation (9) was improved. The two optimization algorithms were set to 50 iterations and run twenty times. The objective function values and solution times of the algorithms were examined by taking the average of the objective function values and solution times obtained as a result of both optimizations. These values are listed in Table 9.
When the average values presented in Table 9 are examined, it is seen that the algorithm that reaches the solution the fastest is the AEO algorithm. Both algorithms provide a significant improvement in terms of optimum solutions compared to the motor efficiency of the initial motor design. The design parameters of the IM and the solution times of the algorithms for results close to the average efficiency values obtained by running the optimization methods twenty times are presented in Table 10. In Table 10, the motor designed with the design parameters obtained as a result of the first design is expressed as M1, the motor designed with the design parameters obtained with the GA is expressed as M2, and the motor designed with the design parameters obtained with the AEO algorithm is expressed as M3. In addition, the efficiency values obtained as a result of the analytical calculations performed in the Ansys RMxprt program according to the optimum design parameters are given in Table 10.
The average efficiency values obtained by running the GA and AEO optimization algorithms twenty times on the IM design increased to 91.382% and 91.575%, respectively, while the initial efficiency value was 90.34%. Table 10 presents the IM design parameters for results close to the average efficiency values of the algorithms. When Table 10 is examined, the M3 motor design has better results than the M2 motor design. This shows that the IM design obtained with the AEO algorithm has an advantage over the design obtained with the GA. In addition, the AEO algorithm showed the best performance in terms of solution time. This advantage in solution time will provide great advantages in terms of saving time and obtaining faster results in applications with a large number of variables.
The motors designed and the motor models obtained from the optimization results were examined using Finite Element Analysis (FEA) for electromagnetic field analysis in the Ansys RMXprt program. The motor models were created in two dimensions, as shown in Figure 4a, and the mesh pattern for a quarter part of the IM was created, as shown in Figure 4b.
In the 2D analysis, in order to reduce the simulation time, the analysis was performed on a quarter of the IM. The analysis was carried out for the entire motor, and the magnetic flux density was shown on the quarter section of the motor.
When Figure 4b is examined, the analysis is more precise in areas with a dense mesh pattern. In the 2D analysis, the simulation results were obtained with an analysis performed over a 0.2 s interval, at a precision of 0.0005 s. Figure 5 shows the distribution of magnetic flux density for all three motor designs.
When the distributions obtained as a result of the solution are examined, it is seen that the average flux density values are within the limits. The results obtained from the Ansys program at this stage show that the models were created correctly. The correct magnetic flux densities also ensured that the performance characteristics of the IM were obtained correctly.
The efficiency of the designed motor has been significantly increased by optimizing the design of geometric dimensions such as the stator slot, inner diameter, outer diameter, and core length. This is an effective method to improve the overall performance and energy efficiency of the motor. However, the limitations in the physical structure of the motor, especially the limited space in the motor body, can make it difficult to apply such optimizations to every motor. In other words, it may not be possible to implement such improvements in every design because certain motor designs may not be able to accept these changes due to space constraints and other structural factors. On the other hand, iron core losses are an important factor that negatively affects the efficiency of motors. These losses are usually caused by heat generation caused by magnetic flux changes inside the motor. When core losses increase, the operating temperature of the motor increases, which can limit the load carrying capacity of the motor. To overcome this problem, a suitable higher-quality magnetic material selection improves the performance of the motor, both increasing efficiency and helping to keep the temperature levels of the motor under control. Reducing rotor copper losses is another important factor that increases the efficiency of the motor. Although traditionally cast aluminum material is widely used in rotor manufacturing, the electrical conductivity of aluminum is lower than copper. Therefore, the use of copper material significantly reduces the electrical losses on the rotor, increasing the motor efficiency.
As a result, motor efficiency can be increased by a combination of factors such as stator–rotor material and design optimizations. However, it should be noted that these optimizations must be performed carefully, considering the physical limitations of the motor and the design requirements.

7. Conclusions

In this study, motor design optimization is explored using the current optimization algorithm, AEO, to idealize the parameters of an IM. The optimal design parameters are determined by maximizing motor efficiency as the objective function. The design optimization considers all relevant motor parameters and constraints. In order to highlight the potential of the AEO method, which was used for the first time in IM design optimization, this method is compared with the GA, which has been extensively utilized in this field. The results, based on the average values from running the optimization algorithms twenty times, show a 1.36% increase in motor efficiency using AEO and a 1.15% increase using the GA compared to the initial efficiency. Additionally, the average solution times for the methods are 52.84 s for AEO and 111.21 s for the GA, demonstrating that AEO provides faster solution times than the GA. Overall, the AEO algorithm proves to be more effective than the GA in optimizing the design to maximize efficiency in IMs. It is anticipated that this study will contribute to future research. Optimization studies will be conducted using different stator slot geometries, and the most optimal slot structure will be determined.

Author Contributions

Conceptualization, H.A.; methodology, H.A., N.F.O.S. and Y.O.; software, H.A.; formal analysis and investigation, H.A., N.F.O.S. and Y.O.; resources, H.A.; data curation, H.A.; writing—original draft preparation, H.A., N.F.O.S. and Y.O.; writing—review and editing, H.A., N.F.O.S. and Y.O.; supervision, N.F.O.S. and Y.O. All authors have read and agreed to the published version of this manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in this article. Further inquiries can be directed to the corresponding author.

Acknowledgments

This paper was utilized in certain parts of a study conducted under the scope of Project No. 10224. We would like to thank Marmara University’s BAPKO for their support.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Renier, B.; Hameyer, K.; Belmans, R. Comparison of standards for determining efficiency of three phase induction motors. IEEE Trans. Energy Convers. 1999, 14, 512–517. [Google Scholar] [CrossRef]
  2. Zhou, P.; Xu, Y.; Zhang, W. Design Consideration on a Low-Cost Permanent Magnetization Remanufacturing Method for Low-Efficiency Induction Motors. Energies 2023, 16, 6142. [Google Scholar] [CrossRef]
  3. Mahmouditabar, F.; Baker, N.J. Design Optimization of Induction Motors with Different Stator Slot Rotor Bar Combinations Considering Drive Cycle. Energies 2024, 17, 154. [Google Scholar] [CrossRef]
  4. Gangsar, P.; Tiwari, R. Signal based condition monitoring techniques for fault detection and diagnosis of induction motors: A state-of-the-art review. Mech. Syst. Signal Process. 2020, 144, 106908. [Google Scholar] [CrossRef]
  5. Saidur, R. A review on electrical motors energy use and energy savings. Renew. Sustain. Energy Rev. 2010, 14, 877–898. [Google Scholar] [CrossRef]
  6. Ghosh, P.K.; Sadhu, P.K.; Basak, R.; Sanyal, A. Energy efficient design of three phase induction motor by water cycle algorithm. Ain Shams Eng. J. 2020, 11, 1139–1147. [Google Scholar] [CrossRef]
  7. Verucchi, C.; Ruschetti, C.; Giraldo, E.; Bossio, G.; Bossio, J. Efficiency optimization in small induction motors using magnetic slot wedges. Electr. Power Syst. Res. 2017, 152, 1–8. [Google Scholar] [CrossRef]
  8. Danin, Z.; Sharma, A.; Averbukh, M.; Meher, A. Improved Moth Flame Optimization Approach for Parameter Estimation of Induction Motor. Energies 2022, 15, 8834. [Google Scholar] [CrossRef]
  9. Sun, Z.; Hu, J.; Xin, Y.; Guo, Q.; Yao, Z. Multi-objective structure optimization for interior permanent magnet synchronous motors under complex operating conditions. Struct. Multidiscip. Optim. 2024, 67, 120. [Google Scholar] [CrossRef]
  10. Mallik, S.; Mallik, K.; Barman, A.; Maiti, D.; Biswas, S.K.; Deb, N.K.; Basu, S. Efficiency and cost optimized design of an induction motor using genetic algorithm. IEEE Trans. Ind. Electron. 2017, 64, 9854–9863. [Google Scholar] [CrossRef]
  11. Gulbahce, M.O.; Kocabas, D.A. High-speed solid rotor induction motor design with improved efficiency and decreased harmonic effect. IET Electr. Power Appl. 2018, 12, 1126–1133. [Google Scholar] [CrossRef]
  12. Çunkaş, M.; Akkaya, R. Design optimization of induction motor by genetic algorithm and comparison with existing motor. Math. Comput. Appl. 2006, 11, 193–203. [Google Scholar] [CrossRef]
  13. Chekroun, S.; Abdelhadi, B.; Benoudjit, A. A New approach design optimizer of induction motor using particle swarm algorithm. AMSE J. Ser. Model. A 2014, 87, 89–108. [Google Scholar]
  14. Chekroun, S.; Abdelhadi, B.; Benoudjit, A. Design optimization of induction motor using hybrid genetic algorithm «a critical analyze». AMSE J. Ser. Adv. C 2015, 71, 1–23. [Google Scholar]
  15. Akhtar, M.J.; Behera, R.K. Optimal design of stator and rotor slot of induction motor for electric vehicle applications. IET Electr. Syst. Transp. 2019, 9, 35–43. [Google Scholar] [CrossRef]
  16. Arslan, M.; Çunkaş, M.; Sağ, T. Determination of induction motor parameters with differential evolution algorithm. Neural Comput. Appl. 2012, 21, 1995–2004. [Google Scholar] [CrossRef]
  17. Tai, Y.; Liu, Z.; Yu, H.; Liu, J. Efficiency optimization of induction motors using genetic algorithm and Hybrid Genetic Algorithm. In Proceedings of the 2011 International Conference on Electrical Machines and Systems, Beijing, China, 20–23 August 2011; pp. 1–4. [Google Scholar] [CrossRef]
  18. Gupta, A.; Machavaram, R.; Kshatriya, T.; Ranjan, S. Multi-objective design optimization of a three phase squirrel cage induction motor for electric propulsion system using genetic algorithm. In Proceedings of the 2020 IEEE First International Conference on Smart Technologies for Power, Energy and Control (STPEC), Nagpur, India, 25–26 September 2020; pp. 1–6. [Google Scholar]
  19. Nakhaei, M.R.; Roshanfekr, R. Optimal Design of 3-phase Squirrel Cage Induction Motors Using Genetic Algorithm Based on the Motor Efficiency and Economic Evaluation of the optimal Model. Balk. J. Electr. Comput. Eng. 2021, 9, 59–68. [Google Scholar] [CrossRef]
  20. Abdulraheem, T.; Asaolu, G.O.; Oladele, T.A.; Bamiduro, H.A.; Ezeah, J.U. Optimization of 20kVA, 3-Phase Induction Motor using Genetic Algorithm. IJSRSET 2017, 3, 151–155. [Google Scholar]
  21. Boldea, I.; Nasar, S.A. The Induction Machines Design Handbook, 2nd ed.; CRC Press, Taylor & Francis Group: Boca Raton, FL, USA, 2010. [Google Scholar] [CrossRef]
  22. Upadhyay, K.G. Design of Electrical Machines; New Age International: New Delhi, India, 2011. [Google Scholar]
  23. Gulbahce, M.O.; Lordoglu, A.; Kocabas, D.A. Increasing the Performance of High-Speed Solid Rotor Induction Motor by Plunge Type Electrical Discharge Machining. Adv. Electr. Comput. Eng. 2023, 23, 79–86. [Google Scholar] [CrossRef]
  24. Rajini, V.; Nagarajan, V.S. Electrical Machine Design; Pearson Education: Bangalore, India, 2018. [Google Scholar]
  25. Murthy, K.V. Computer-Aided Design of Electrical Machines; BS Publications: Hyderabad, India, 2008. [Google Scholar]
  26. Apaydın, H.; Serteller, F.; Oğuz, Y. Implementation of Three Phase Induction Motor Pre-Design Program on Electronic Circuit. Politek. Dergisi. 2023, 27, 1281–1292. [Google Scholar] [CrossRef]
  27. Ban, B.; Stipetic, S. Robust feasibility verification and region inner-point detection algorithms for geometric shape objects applied to electric machine optimization workflow. Struct. Multidiscip. Optim. 2022, 65, 175. [Google Scholar] [CrossRef]
  28. Ocak, C. A FEM-Based Comparative Study of the Effect of Rotor Bar Designs on the Performance of Squirrel Cage Induction Motors. Energies 2023, 16, 6047. [Google Scholar] [CrossRef]
  29. Murty, K.G. Optimization Models for Decision Making: Volume; University of Michigan: Ann Arbor, MI, USA, 2003. [Google Scholar]
  30. Wang, D.; Tan, D.; Liu, L. Particle swarm optimization algorithm: An overview. Soft Comput. 2018, 22, 387–408. [Google Scholar] [CrossRef]
  31. Pereira, J.L.J.; Oliver, G.A.; Francisco, M.B.; Cunha, S.S., Jr.; Gomes, G.F. A review of multi-objective optimization: Methods and algorithms in mechanical engineering problems. Arch. Comput. Methods Eng. 2022, 29, 2285–2308. [Google Scholar] [CrossRef]
  32. Subramani, R.; Vijayalakshmi, C. Multi-Objectıve Optımization Algorithms And Performance Test Functions For Energy Effıcıency: Review. Int. J. Eng. Sci. Res. Technol. 2017, 6, 39–52. [Google Scholar]
  33. Mirjalili, S.; Lewis, A. The whale optimization algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  34. Ahmadi, S.A. Human behavior-based optimization: A novel metaheuristic approach to solve complex optimization problems. Neural Comput. Appl. 2017, 28 (Suppl. 1), 233–244. [Google Scholar] [CrossRef]
  35. Valdez, F.; Melin, P.; Castillo, O. A survey on nature-inspired optimization algorithms with fuzzy logic for dynamic parameter adaptation. Expert Syst. Appl. 2014, 41, 6459–6466. [Google Scholar] [CrossRef]
  36. Abdel-Basset, M.; Abdel-Fatah, L.; Sangaiah, A.K. Metaheuristic algorithms: A comprehensive review. In Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications; Academic Press: Cambridge, MA, USA, 2018; pp. 185–231. [Google Scholar] [CrossRef]
  37. Bektaş, Y. Real-time control of Selective Harmonic Elimination in a Reduced Switch Multilevel Inverter with unequal DC sources. Ain Shams Eng. J. 2024, 15, 102719. [Google Scholar] [CrossRef]
  38. Pandey, H.M.; Chaudhary, A.; Mehrotra, D. A comparative review of approaches to prevent premature convergence in GA. Appl. Soft Comput. 2014, 24, 1047–1077. [Google Scholar] [CrossRef]
  39. Man, K.F.; Tang, K.S.; Kwong, S. Genetic algorithms: Concepts and applications [in engineering design]. IEEE Trans. Ind. Electron. 1996, 43, 519–534. [Google Scholar] [CrossRef]
  40. Mitchell, M. Genetic algorithms: An overview. Complex 1995, 1, 31–39. [Google Scholar] [CrossRef]
  41. Hassanat, A.; Almohammadi, K.; Alkafaween, E.A.; Abunawas, E.; Hammouri, A.; Prasath, V.S. Choosing mutation and crossover ratios for genetic algorithms—A review with a new dynamic approach. Information 2019, 10, 390. [Google Scholar] [CrossRef]
  42. Patil, V.P.; Pawar, D.D. The optimal crossover or mutation rates in genetic algorithm: A review. Int. J. Appl. Eng. Technol. 2015, 5, 38–41. [Google Scholar]
  43. Bi, H.; Lu, F.; Duan, S.; Huang, M.; Zhu, J.; Liu, M. Two-level principal–agent model for schedule risk control of IT outsourcing project based on genetic algorithm. Eng. Appl. Artif. Intell. 2020, 91, 103584. [Google Scholar] [CrossRef]
  44. Zhao, W.; Wang, L.; Zhang, Z. Artificial ecosystem-based optimization: A novel nature-inspired meta-heuristic algorithm. Neural Comput. Appl. 2020, 32, 9383–9425. [Google Scholar] [CrossRef]
  45. Jamil, M.; Yang, X.S. A literature survey of benchmark functions for global optimization problems. Int. J. Math. Model. Numer. Optim. 2013, 4, 150–194. [Google Scholar] [CrossRef]
Figure 1. IM geometry: (a) stator geometry and (b) rotor geometry.
Figure 1. IM geometry: (a) stator geometry and (b) rotor geometry.
Energies 18 00733 g001
Figure 2. Flow diagram of the basic AEO algorithm.
Figure 2. Flow diagram of the basic AEO algorithm.
Energies 18 00733 g002
Figure 3. Performance curves of optimization algorithms for 13 selected quality test functions: (a) f1; (b) f2; (c) f3; (d) f4; (e) f5; (f) f6; (g) f7; (h) f8; (i) f9; (j) f10; (k) f11; (l) f12; (m) f13.
Figure 3. Performance curves of optimization algorithms for 13 selected quality test functions: (a) f1; (b) f2; (c) f3; (d) f4; (e) f5; (f) f6; (g) f7; (h) f8; (i) f9; (j) f10; (k) f11; (l) f12; (m) f13.
Energies 18 00733 g003
Figure 4. The IM’s 2D and mesh model created in the Ansys RMXprt program: (a) 2D model of the IM; (b) 2D mesh model created for a quarter of the IM.
Figure 4. The IM’s 2D and mesh model created in the Ansys RMXprt program: (a) 2D model of the IM; (b) 2D mesh model created for a quarter of the IM.
Energies 18 00733 g004
Figure 5. Magnetic flux densities obtained from the Ansys RMxprt program for the M1, M2, and M3 motor designs: (a) M1; (b) M2; (c) M3.
Figure 5. Magnetic flux densities obtained from the Ansys RMxprt program for the M1, M2, and M3 motor designs: (a) M1; (b) M2; (c) M3.
Energies 18 00733 g005
Table 1. Unimodal test functions.
Table 1. Unimodal test functions.
Function NameDescription of the FunctionDimensionRange of ValuesOptimum Value
Sphere f 1 ( x ) = i = 1 n x i 2 30[−100, 100]0
Schwefel 2.22 f 2 ( x ) = i = 1 n x i + i = 1 n x i 30[−10, 10]0
Schwefel 1.2 f 3 ( x ) = i = 1 n j 1 i x j 2 30[−100, 100]0
Schwefel 2.21 f 4 ( x ) = max i x i , 1 i n 30[−100, 100]0
Rosenbrock f 5 ( x ) = i = 1 n 1 [ 100 ( x i + 1 x i 2 ) 2 + ( x i + 1 ) 2 ] 30[−30, 30]0
Step f 6 ( x ) = i = 1 n ( [ x i + 0.5 ] ) 2 30[−100, 100]0
Quartic f 7 ( x ) = i = 1 n i x i 4 + r a n d o m 0 , 1 30[−1.28, 1.28]0
Table 2. Multimodal test functions.
Table 2. Multimodal test functions.
Function NameDescription of the FunctionDimensionRange of ValuesOptimum Value
Schwefel f 8 ( x ) = i = 1 n x i sin x i 30[−500, 500] 418.9829 · n
Rastrigin f 9 ( x ) = i = 1 n [ x i 2 10 cos 2 π x i + 10 ] 30[−5.12, 5.12]0
Ackley f 10 ( x ) = 20 exp ( 0.2 1 n i = 1 n x i 2 ) exp ( 1 n i = 1 n cos ( 2 π x i ) ) + 20 + e 30[−32, 32]0
Griewank f 11 ( x ) = 1 400 i = 1 n x i 2 i = 1 n cos ( x i i ) + 1 30[−600, 600]0
Penalized f 12 ( x ) = π n 10 sin ( π y 1 ) + i = 1 n 1 y 1 1 2 1 + 10 sin 2 ( π y i + 1 ) + y n 1 2 + π i = 1 n u ( x 1 , 10 , 100.4 ) y i = 1 + x i + 1 4 u x i , a , k , m = k ( x i a ) x i > a 0 a < x i < a k ( x i a ) m x i < a 30[−50, 50]0
Penalized
2
f 13 ( x ) = 0.1 sin 2 ( 3 π x 1 ) + i = 1 n x i 1 2 1 + sin 2 ( 3 π x i + 1 ) + ( x n 1 ) 2 1 + sin 2 ( 2 π x n ) + i = 1 n u ( x i , 5 , 100 , 4 ) 30[−50, 50]0
Table 3. Comparison of optimization results for various test functions.
Table 3. Comparison of optimization results for various test functions.
Function NumberIndexOptimization Techniques
GAAEO
f 1 ( x ) Average22.45454.5414 × 10−66
Standard Deviation5.70001.0185 × 10−65
Best Value12.99986.7211 × 10−78
f 2 ( x ) Average0.84881.8175 × 10−32
Standard Deviation0.17965.0184 × 10−32
Best Value0.55782.5352 × 10−38
f 3 ( x ) Average2.895 × 1032.8105 × 10−68
Standard Deviation8.131 × 1026.9181 × 10−68
Best Value1.926 × 1032.1721 × 10−78
f 4 ( x ) Average6.1764.1896 × 10−32
Standard Deviation1.1821.0889 × 10−31
Best Value4.9412.6871 × 10−35
f 5 ( x ) Average3.905 × 1022.5105 × 101
Standard Deviation1.602 × 1027.2142 × 101
Best Value2.146 × 1022.4201 × 101
f 6 ( x ) Average10.160
Standard Deviation1.5320
Best Value8.5260
f 7 ( x ) Average4.714 × 10−21.3587 × 10−3
Standard Deviation1.124 × 10−21.4657 × 10−3
Best Value3.173 × 10−21.4071 × 10−4
f 8 ( x ) Average−9.462 × 103−9.7426 × 103
Standard Deviation3.380 × 1025.3122 × 102
Best Value−9.918 × 103−1.0820 × 104
f 9 ( x ) Average18.9500
Standard Deviation4.5400
Best Value11.690
f 10 ( x ) Average1.4628.8818 × 10−12
Standard Deviation5.466 × 10−11.7030 × 10−27
Best Value7.713 × 10−38.8818 × 10−12
f 11 ( x ) Average1.0650
Standard Deviation3.147 × 10−20
Best Value1.0110
f 12 ( x ) Average2.060 × 10−13.7326 × 10−5
Standard Deviation2.078 × 10−12.1774 × 10−5
Best Value1.680 × 10−21.3847 × 10−5
f 13 ( x ) Average7.227 × 10−10.1069
Standard Deviation1.705 × 10−10.1300
Best Value4.549 × 10−16.6828 × 10−3
Table 5. Geometric dimensions of the IM obtained as a result of the preliminary design in the Matlab program.
Table 5. Geometric dimensions of the IM obtained as a result of the preliminary design in the Matlab program.
Description/SymbolsUnitsValuesDescription/SymbolsUnitsValues
D o u t mm182.9 b r 0 mm 1.5
D i n mm112.9 b r 1 mm 6.2
L mm133 b r 2 mm 3.3
g mm0.31 h r 0 mm 1
b s 0 mm2.2 h r 1 mm 12.6
b s 1 mm6 D s h a f t mm 48.6
b s 2 mm9.4
h s 0 mm1
h s 1 mm1.5
h s 2 mm19.5
Table 6. Motor analysis results calculated in the Matlab program and analysis results obtained in the Ansys RMxprt program.
Table 6. Motor analysis results calculated in the Matlab program and analysis results obtained in the Ansys RMxprt program.
Motor Parameter Name—UnitsMatlab Program Calculation
Results
Ansys-RMxprt Calculation
Results
Specific Electric Loading—Am26,78926,776
Rated Current—A9.10599.097
Magnetization Current—A4.25784.250
Rotor Current—A8.04917.663
Air Gap Flux Density—T0.69150.6918
Stator Teeth Flux Density—T1.67141.6675
Rotor Teeth Flux Density—T1.67401.6542
Stator Yoke Flux Density—T1.78411.8178
Rotor Yoke Flux Density—T1.71941.6379
Air Gap mmf—Aturns104.6079120.903
Stator Tooth mmf—Aturns88.432580.875
Rotor Tooth mmf—Aturns40.2358.6951
Stator Yoke mmf—Aturns246.2024168.834
Rotor Yoke mmf—Aturns69.670220.0847
Stator Phase Resistance—ohm0.82730.9111
Rotor Resistance—ohm0.89900.7915
Stator Phase Leakage Reactance—ohm2.29662.009
Rotor Leakage Reactance—ohm3.17942.1362
Magnetization Reactance—ohm58.732658.52
Stator Core Steel Weigh—kg10.187310.3368
Rotor Core Steel Weight—kg5.21555.7586
Stator Ohmic Loss—W205.5864226.205
Rotor Ohmic Loss—W173.5334139.481
Iron Core Losses—W86.815580.930
Frictional and Windage Loss—W6666.336
Stray Loss—W5555
Output Power—W5491.15500.33
Efficiency—%90.3490.64
Power Factor0.85170.8296
Rated Torque—Nm30.08729.9113
Rated Slip0.03020.0244
Table 7. Design parameters and boundary values used in IM design.
Table 7. Design parameters and boundary values used in IM design.
DescriptionUnitsLowerReal ValuesUpper
n s ( x 1 ) 252935
D i n ( x 2 ) mm100112.9120
L ( x 3 ) mm120133150
h s 0 ( x 4 ) mm0.311.2
h s 1 ( x 5 ) mm11.52
h s 2 ( x 6 ) mm1919.522
b s 0 ( x 7 ) mm22.23
b s 1 ( x 8 ) mm567
b s 2 ( x 9 ) mm89.412
D o u t ( x 10 ) mm1751829210
Table 8. Constraints used in the IM design procedure.
Table 8. Constraints used in the IM design procedure.
DescriptionUnitsDesign Parameter NameLimit
B g ( Y 1 ) T 0.75
K f i l l ( Y 2 ) 0.6
B c s ( Y 3 ) T 1.7
B c r ( Y 4 ) T 1.7
B t s ( Y 5 ) T 1.7
cos φ ( Y 6 ) 0.80
t L R ( Y 7 ) Starting   torque   /   Rated   torque   1.2
t b k ( Y 8 ) Breakdown   torque   /   Rated   torque 1.75
i L R ( Y 9 ) Locked   rotor   current   /   Rated   current   7
Table 9. Average of the objective function and solution time values of the GA and AEO optimization algorithms for IM design optimization.
Table 9. Average of the objective function and solution time values of the GA and AEO optimization algorithms for IM design optimization.
DescriptionGAAEO
CPU Time (s) (η)%CPU Time (s)(η)%
Average 111.21191.38252.8491.575
Standard Deviation 0.1192 0.08720
Table 10. The design parameters of the IM that give the result closest to the average efficiency values obtained by running the optimization algorithms twenty times.
Table 10. The design parameters of the IM that give the result closest to the average efficiency values obtained by running the optimization algorithms twenty times.
DescriptionUnitsM1Design Parameter Values
M2M3
n s ( x 1 ) 292726
D i n ( x 2 ) mm112.9115.75118.69
L ( x 3 ) mm133138.84142.59
h s 0 ( x 4 ) mm10.610.51
h s 1 ( x 5 ) mm1.51.31.46
h s 2 ( x 6 ) mm 19.520.8219.97
b s 0 ( x 7 ) mm2.22.22.3
b s 1 ( x 8 ) mm65.516.36
b s 2 ( x 9 ) mm9.49.668.23
D o u t ( x 10 ) mm182.9204.63198.42
η (Ansys RMxprt)%90.6491.8791.97
η (Matlab)%90.3491.4591.61
Optimization running time in the Matlab programsec 106.548552.1754
Change in efficiency of the M2 and M3 motor designs compared to the M1 motor design% 1.221.4
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Apaydin, H.; Oyman Serteller, N.F.; Oğuz, Y. Induction Motor Geometric Parameter Optimization Using a Metaheuristic Optimization Method for High-Efficiency Motor Design. Energies 2025, 18, 733. https://doi.org/10.3390/en18030733

AMA Style

Apaydin H, Oyman Serteller NF, Oğuz Y. Induction Motor Geometric Parameter Optimization Using a Metaheuristic Optimization Method for High-Efficiency Motor Design. Energies. 2025; 18(3):733. https://doi.org/10.3390/en18030733

Chicago/Turabian Style

Apaydin, Hasbi, Necibe Füsun Oyman Serteller, and Yüksel Oğuz. 2025. "Induction Motor Geometric Parameter Optimization Using a Metaheuristic Optimization Method for High-Efficiency Motor Design" Energies 18, no. 3: 733. https://doi.org/10.3390/en18030733

APA Style

Apaydin, H., Oyman Serteller, N. F., & Oğuz, Y. (2025). Induction Motor Geometric Parameter Optimization Using a Metaheuristic Optimization Method for High-Efficiency Motor Design. Energies, 18(3), 733. https://doi.org/10.3390/en18030733

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop