
The semiconductor manufacturing industry relies heavily on wafer surface defect detection for yield enhancement. Machine learning and digital image processing technologies have been used in the development of various detection algorithms. However, most wafer surface inspection algorithms are not be applied in industrial environments due to the difficulty in obtaining training samples, high computational requirements, and poor generalization. In order to overcome these difficulties, this paper introduces a full-flow inspection method based on machine vision to detect wafer surface defects. Starting with the die image segmentation stage, where a die segmentation algorithm based on candidate frame fitting and coordinate interpolation is proposed for die sample missing matching segmentation. The method can segment all the dies in the wafer, avoiding the problem of missing dies splitting. After that, in the defect detection stage, we propose a die defect anomaly detection method based on defect feature clustering by region, which can reduce the impact of noise in other regions when extracting defect features in a single region. The experiments show that the proposed inspection method can precisely position and segment die images, and find defective dies with an accuracy of more than 97%. The defect detection method proposed in this paper can be applied to inspect wafer manufacturing.
Citation: Naigong Yu, Hongzheng Li, Qiao Xu. A full-flow inspection method based on machine vision to detect wafer surface defects[J]. Mathematical Biosciences and Engineering, 2023, 20(7): 11821-11846. doi: 10.3934/mbe.2023526
[1] | Yong Xiong, Lin Pan, Min Xiao, Han Xiao . Motion control and path optimization of intelligent AUV using fuzzy adaptive PID and improved genetic algorithm. Mathematical Biosciences and Engineering, 2023, 20(5): 9208-9245. doi: 10.3934/mbe.2023404 |
[2] | Yongqiang Yao, Nan Ma, Cheng Wang, Zhixuan Wu, Cheng Xu, Jin Zhang . Research and implementation of variable-domain fuzzy PID intelligent control method based on Q-Learning for self-driving in complex scenarios. Mathematical Biosciences and Engineering, 2023, 20(3): 6016-6029. doi: 10.3934/mbe.2023260 |
[3] | Jiahao Zhang, Zhengming Gao, Suruo Li, Juan Zhao, Wenguang Song . Improved intelligent clonal optimizer based on adaptive parameter strategy. Mathematical Biosciences and Engineering, 2022, 19(10): 10275-10315. doi: 10.3934/mbe.2022481 |
[4] | Dongning Chen, Jianchang Liu, Chengyu Yao, Ziwei Zhang, Xinwei Du . Multi-strategy improved salp swarm algorithm and its application in reliability optimization. Mathematical Biosciences and Engineering, 2022, 19(5): 5269-5292. doi: 10.3934/mbe.2022247 |
[5] | Hong Lu, Hongxiang Zhan, Tinghua Wang . A multi-strategy improved snake optimizer and its application to SVM parameter selection. Mathematical Biosciences and Engineering, 2024, 21(10): 7297-7336. doi: 10.3934/mbe.2024322 |
[6] | Dashe Li, Xueying Wang, Jiajun Sun, Huanhai Yang . AI-HydSu: An advanced hybrid approach using support vector regression and particle swarm optimization for dissolved oxygen forecasting. Mathematical Biosciences and Engineering, 2021, 18(4): 3646-3666. doi: 10.3934/mbe.2021182 |
[7] | Sijie Wang, Shihua Zhou, Weiqi Yan . An enhanced whale optimization algorithm for DNA storage encoding. Mathematical Biosciences and Engineering, 2022, 19(12): 14142-14172. doi: 10.3934/mbe.2022659 |
[8] | Zijiao Zhang, Chong Wu, Shiyou Qu, Jiaming Liu . A hierarchical chain-based Archimedes optimization algorithm. Mathematical Biosciences and Engineering, 2023, 20(12): 20881-20913. doi: 10.3934/mbe.2023924 |
[9] | Huangjing Yu, Yuhao Wang, Heming Jia, Laith Abualigah . Modified prairie dog optimization algorithm for global optimization and constrained engineering problems. Mathematical Biosciences and Engineering, 2023, 20(11): 19086-19132. doi: 10.3934/mbe.2023844 |
[10] | Chengjun Wang, Xingyu Yao, Fan Ding, Zhipeng Yu . A trajectory planning method for a casting sorting robotic arm based on a nature-inspired Genghis Khan shark optimized algorithm. Mathematical Biosciences and Engineering, 2024, 21(2): 3364-3390. doi: 10.3934/mbe.2024149 |
The semiconductor manufacturing industry relies heavily on wafer surface defect detection for yield enhancement. Machine learning and digital image processing technologies have been used in the development of various detection algorithms. However, most wafer surface inspection algorithms are not be applied in industrial environments due to the difficulty in obtaining training samples, high computational requirements, and poor generalization. In order to overcome these difficulties, this paper introduces a full-flow inspection method based on machine vision to detect wafer surface defects. Starting with the die image segmentation stage, where a die segmentation algorithm based on candidate frame fitting and coordinate interpolation is proposed for die sample missing matching segmentation. The method can segment all the dies in the wafer, avoiding the problem of missing dies splitting. After that, in the defect detection stage, we propose a die defect anomaly detection method based on defect feature clustering by region, which can reduce the impact of noise in other regions when extracting defect features in a single region. The experiments show that the proposed inspection method can precisely position and segment die images, and find defective dies with an accuracy of more than 97%. The defect detection method proposed in this paper can be applied to inspect wafer manufacturing.
A metaheuristic optimization algorithm is a novel population-based global search algorithm, and is more suitable for solving complex problems [1,2]. Rao et al. proposed a teaching-learning-based optimization (TLBO) algorithm to solve large-scale optimization problems. The simulation results of the standard test function showed that the TLBO algorithm effectively solves complex optimization problems [3]. To solve a complex constrained optimization problem, Sayed E et al. proposed a decomposition evolutionary algorithm [4]. Mohapatra et al. proposed a competitive swarm optimizer algorithm [5]. To overcome the shortcoming of particle swarm optimization (PSO) falling easily into a local optimum, an improved quantum PSO algorithm with the cultural gene algorithm and memory mechanism was proposed to solve continuous nonlinear problems [6,7]. Ali et al. presented a multi-population differential evolution global optimization algorithm [1]. Ant colony optimization, proposed by Ismkhan, has been applied to solving complex problems [8]. Using the symbiotic organism search algorithm for fractional fuzzy controllers [9] and so on.
In an industrial control system, the proportional integral derivative (PID) controller has been widely applied. It accounts for more than 90% of the actual control system [10]. The PID parameter tuning problem proposed by Ziegler and Nichols has caused extensive concern. However, the traditional PID parameter tuning method has the following problems: The control performance index is not ideal and, typically, the method has a large overshoot and long adjustment time. The control effect of an intelligent optimization algorithm in PID parameter tuning is better than that of the traditional tuning method, and it can avoid some shortcomings of traditional methods [11]. Jiang et al. proposed a PID tuning premature with a genetic algorithm (GA) to enhance the search and convergence speed, but there were problems of premature convergence and parameter dependence [12]. Yu et al. proposed seeker search algorithm optimization PID controller parameters; improved the control precision of the system; accelerated the response speed and robustness of the system; and optimized the optimal parameters for the control system PID, but the optimization formula complex, need to set more parameters [13]. P. B. de Moura Oliveira, et al. designed Posicast PID control systems using a gravitational search algorithm (GSA) [14]. Guo-qiang Zeng et al. designed multivariable PID controllers using real-coded population-based extremal optimization [15]. A. Belkadi et al. proposed a PSO-based approach on the robust PID adaptive controller for exoskeletons [16]. M. Gheisarnejad proposed an effective hybrid harmony search (HS) and cuckoo optimization algorithm-based fuzzy PID controller for load frequency control [17]. Amal Moharam, et al. designed an optimal PID controller using hybrid differential evolution and PSO with an aging leader and challengers [18].
The spotted hyena optimizer (SHO) [19] is a novel intelligence algorithm proposed by Dhiman and Kumar in 2017. It was inspired by the social and collaborative behavior of spotted hyenas, which exist in nature. Spotted hyenas typically perform four processes: Search, encirclement, hunt, and attack prey. The SHO has the characteristics of simple, easy to implement programming and adjust the parameters set less features. Since the SHO was proposed, there have been various improved versions of the SHO algorithm. For example, N. Panda, et al. used an improved SHO (ISHO) with space transformational search to train a pi-sigma higher-order neural network [20]. H. Moayedi et al. proposed using the SHO and ant lion optimization to predict the shear strength of soil [21]. Q. Luo, et al. proposed using the SHO with lateral inhibition for image matching [22]. G. Dhiman et al. proposed a multi-objective optimization algorithm for engineering problems [23] and used the SHO to solve the nonlinear economic load power dispatch problem [24]. Xu Y, et al. proposed an enhanced moth-flame optimizer with a mutation strategy for global optimization [25].
In function optimization and engineering optimization, it has been proved that the performance of the SHO is superior to that of the grey wolf optimizer (GWO), binary GWO [26], PSO, moth-flame optimization (MFO), multi-verse optimizer, sine cosine algorithm (SCA), GSA, GA, HS, Harris hawks optimization [27], bacterial foraging optimization [28], and flower pollination algorithm [29] in terms of precision and the convergence speed [22]. In this paper, an ISHO algorithm is applied to solve PID parameter problems in an automatic voltage regulator (AVR).
The remainder of the paper is organized as follows: The basic SHO algorithm is presented in Section 2. In Section 3, the ISHO is introduced. In Section 4, the ISHO is proposed to optimize PID parameters and compared with well-known algorithms. Finally, conclusions are provided in Section 5.
The social relationships and habits of animals are the source of inspiration for our work. This social behavior is also present in the spotted hyena, whose scientific name is Crocuta. According to llany et al. [30], spotted hyenas typically live in groups, with as many as 100 group members, and they have mutual trust and interdependence. The communication between spotted hyenas is typically posed, and given a special signal, they track prey using sight, hearing, and smell. There are four main steps for a spotted hyena to attack prey: Search for prey, encircle prey, hunt prey, and attack prey. To generate a mathematical model for encircling, the equations are as follows [31]:
→D=|→B⋅→Xp(t)−→X(t)| | (2.1) |
→X(t+1)=→Xp(t)−→E⋅→D, | (2.2) |
where t is the current iteration, →B and →E are the coefficient vectors, →Xp is the position vector of the prey, →X is the position vector, →D is the distance between the prey and spotted hyena, and ||∙|| represents the absolute value.
The coefficient vectors →B and →E are calculated as follows:
→B=2⋅r→d1 | (2.3) |
→E=2→h⋅r→d2−→h | (2.4) |
→h=5−(t∗(5/T)), | (2.5) |
where t=1,2,3,⋯,T to balance exploration and exploitation, →h linearly decreases from 5 to 0, and r→d1 and r→d2 are random vectors in [0, 1].
To define the spotted hyena behavior mathematically, the best search agent represents the location of the prey. The other search agents move toward the best search agent and save the best solutions obtained thus far to update their positions. The mathematical model can be formulated as follows:
→Dh=|→B⋅→Xh−→Xk| | (2.6) |
→Xk=→Xh−→E⋅→Dh | (2.7) |
→Ch=→Xk+→Xk+1+⋯+→Xk+N | (2.8) |
N=countnos(→Xh,→Xh+1,→Xh+2,⋯,(→Xh+→M)), | (2.9) |
where →Xh is the position of the best spotted hyena, →Xk is the position of other spotted hyena, N is the number of spotted hyenas, →M is a random vector in [0.5, 1], nos is the number of solutions, countnos is the count of all candidate solutions, and →Ch is a cluster of N optimal solutions.
For spotted hyenas in the attack prey stage, to determine the optimal solution, it is necessary to continuously reduce the value of →h, where →h is the step size that the spotted hyena takes to attack prey, and it is clear that, when looking for prey, the spotted hyena continues to increase the number of steps gain steps. The formulation for attacking prey is
→X(t+1)=→ChN, | (2.10) |
where →X(t+1) is the position of the current solution and t is the number of iterations. The SHO allows its agents to update their positions in the direction of the prey.
Algorithm 1 Pseudocode of the SHO |
1. Initialize the spotted hyena population Xi (i=1,2,⋯,n) 2. Initialize h, B, E, and N 3. Calculate the fitness of each search agent 4. →Xh= best search agent 5. →Ch= group or cluster of all far optimal solutions 6. while (t < max number of iterations) 7. for each search agent do 8. Update the position of the current search agent by Eq (2.10) 9. end for 10. Update h, B, E and N 11. Check if any search agent goes beyond the search space and revamp it 12 Calculate the fitness of each search agent 13. Update Ph if there is a better solution by Eqs (2.6) and (2.7) 14. t = t + 1 15. end while 16. Return →Xh |
The parameters →B and →E oblige the SHO algorithm to explore and exploit the search space. As →B decreases, half the iterations are dedicated to exploration (when |→E|>1) and the remainder are dedicated to exploitation (when |→E|<1) [32]. From the above, the →B vector contains random values in [0, 2]. This component provides random weights for prey to stochastically emphasize (→B>1) or deemphasize (→B<1) the effect of prey in defining the distance in Eq (2.3). This helps the random behavior of the SHO to increase during the course of optimization, and favors exploration and local optima avoidance. The pseudocode of the SHO algorithm is as above.
Haupt et al. found that the initial population affects the algorithm’s accuracy and convergence speed [32]. The better than initial population can lay the foundation for the global search of the SHO algorithm [21]. However, without any prior knowledge of the global optimal solution of the problem, the SHO algorithm typically adopts a random method when generating the initial search agent, which thus affects the search efficiency. The opposition learning strategy is a new technology that has emerged in the field of intelligent computing. So far, the opposite learning strategy has been successfully applied to swarm intelligent algorithms, such as PSO, HS, and DE algorithms [33,34]. In this paper, the opposite learning strategy is embedded into the SHO for initialization.
Algorithm 2 Initialization method based on opposite learning |
Set the population size to N 1. for i=1 to N do 2. for j=1 to d do 3. Xji=lji+rand(0,1)⋅(uji−lji) 4. end for 5. end for 6. for i=1 to N do 7. for j=1 to d do 8. ⌣Xji=lji+uji−Xji 9. end for 10. end for 11. Output {X(N)∪⌣X(N)}, where N denotes the individuals with the best fitness selected as the initial population. |
Definition: Opposition-based [35]. SupposeXexists in [l,u]. The opposite point is ⌣X=l+u−X. Let X=(X1,X2,⋯,Xd) be a point in d-dimensional space, where X1,X2,⋯,Xd∈R and Xi∈[li,ui] ∀i∈{1,2,⋯,d}. The opposition-based ⌣X=(⌣X1,⌣X2,⋯,⌣Xd) is completely defined by its components:
⌣Xi=li+ui−Xi. | (3.1) |
According to the above definition, the specific steps for using the opposite learning strategy to generate the initial population are as above.
Similar to other group intelligent optimization algorithms based on population iteration, it is crucial for the SHO to coordinate its exploration and exploitation capabilities. During exploration, groups need to detect a wider search area and avoid the SHO algorithm becoming stuck in a local optimum. The exploitation capacity mainly uses the group’s existing information to search some local solution’s areas of the solution. The convergence rate of the SHO algorithm has a decisive influence. Clearly, robustness and fast convergence are achieved only when the SHO algorithm improves the coordination of the exploration and exploitation capabilities.
According to [21], the SHO algorithm’s exploration and exploitation abilities depend on the change of the convergence factor →h. The larger the convergence factor →h, the better the global search ability and the more likely the SHO algorithm avoids falling into a local optimum. The smaller the convergence factor →h, the stronger the local search ability, which speeds up the convergence of the SHO algorithm. However, in the basic SHO algorithm, the convergence factor →h decreases linearly from 5 to 0 as the number of iterations increases. The linear decreasing strategy of the convergence factor →h has a good global search ability in the early stages of the algorithm, but the convergence speed is slow. In the latter part of the algorithm to speed up the convergence rate, but easy to fall into a local optimum, particularly in multimode functions problems. Therefore, in the evolutionary search process, the convergence factor →h with the number of iterations linearly decreasing strategy cannot fully reflect the actual optimization of the search process in the SHO algorithm [36]. In fact, the SHO is expected to have a strong global search ability in the pre-search period while maintaining a fast convergence rate. Additionally, Enns, et al. and Zeng, et al. found that performance improved if the control parameter was chosen as a nonlinearly decreasing quantity rather than using a linearly decreasing strategy [30,32]. Thus, the control parameter →h is modified as follows:
→h=→hinitial−(→hinitial−→hfinal)×(Max_iteration−tMax_iteration)u, | (3.2) |
where t is the current iteration, Max_iteration is the maximum number of iterations, u is the nonlinear modulation index, and →hinitial and hfinal are the initial value and final value of control parameter →h, respectively. According to [32], when →hinitial is set to 5, hfinal becomes 0.
Figure 1 shows typical control parameter →h variations with iterations for different values of u. We conducted several SHO experiments with a nonlinear modulation index u in the interval (0, 2.0). On average, the results are better than those of existing algorithms: The larger the value of u (u > 2.0), the greater the failed convergence rate.
Similar to other population-based intelligent optimization algorithms, in the late iteration of the SHO, all the spotted hyenas move closer to the optimal individual region, which results in a reduction of population diversity. In this case, if the current optimal individual is the local optimal, then the SHO algorithm falls into a local optimum. This is also an inherent characteristic of other group intelligent optimization algorithms. To reduce the probability of premature convergence for the SHO algorithm, in this paper, a diversity mutation operation is performed on the current optimal spotted hyena individuals. The steps are as follows:
Assume that an individual Xi=(xi1,xi2,⋯,xid) of the spotted hyena species selects one element xk(k=1,2,⋯,d) randomly from the individual with a probability of and randomly generates a real number in the range [li,ui] instead of the element from the individual Xi, thus producing a new individual. X_i^' = (x_{i1}^',x_{i2}^', \cdots ,x_{id}^' The variation mutation operation is
X′i={li+λ⋅(ui−li)i=kXiotherwise, | (3.3) |
where li and u are the upper and lower bounds of the variable x, respectively, and λ∈[0,1] is a random. The ISHO optimizer steps are presented in Algorithm 3.
Algorithm 3 Pseudocode of the ISHO |
1. Set the population size N using the opposite learning strategy described in Algorithm 2 to generate an initialized spotted hyena population Xi(i=1,2,⋯,n) 2. Initialize the parameters h, B, E, and N 3. Calculate the fitness of each agent 4. Ph = best search agent 5. Ch = group or cluster of all far optimal solutions 6. while (t<tmax) do 7. for i =1 to N do 8. Using Eq (3.2), calculate the value of the convergence factor h Update the other parameters B and E using Eqs (2.3) and (2.4), respectively 9. if (|E|≥1) do 10. According to Eq (2.7), update the spotted hyena individual’s position 11. end if 12. if (|E|≥1) do 13. According to Eq (2.10), update the spotted hyena individual’s position 14. end if 15. end for 16. Perform diversity mutation on the current spotted hyena individual using Eq (3.3) 17. Calculate the fitness of each agent 18. Update Xi if there is a better solution 19. t = t+1 20. end while 21.end |
Providing constancy and stability at rated voltage levels in electricity, the network is also one of the main problems in power system control. If the rated voltage level deviates from this value, then the performance degrades and the life expectancy reduces. Another important reason for this control is true line loss, which depends on the real and reactive power flow. The reactive power flow is largely dependent on the terminal voltage of the power system. However, it is necessary to reduce the loss caused by the solid line by controlling the rated voltage level. To solve these control problems, an AVR system is applied to power generation units [36]. The role of the AVR is to maintain the terminal voltage of the synchronous alternator at the rated voltage value.
Using the PID controller to improve the dynamic response while reducing or eliminating the steady-state error, the derivative controller adds a finite zero to the open-loop plant, which enables the improvement of the transient response. The PID controller transfer function is
C(s)=Kp+KiS+KdS. | (4.1) |
A simple AVR system has four parts: Amplifier, exciter, generator, and sensor. The mathematical transfer function of the above four components is considered as linear and time constant. To analyze the dynamic performance of an AVR, the transfer functions of these components are in [37,38].
The amplifier model is represented by a gain KA and time constant τA. The transfer function is given by
Vr(s)Ve(s)=KA1+τAs, | (4.2) |
where the range of KA is [10,400] and the amplifier time constant ranges from 0.02–0.1 s.
The transfer function of an exciter is modeled by a gain KE and time constant τE, and given by
Vf(s)Vr(s)=KE1+τEs, | (4.3) |
where KE is typically in the range [10,400] and the time constant τE is in the range 0.5–1.0 s.
The generator model is represented by a gain KG and time constant τG. The transfer function is given by
Vt(s)Vf(s)=KG1+τGs, | (4.4) |
where KR is in the range [0.7, 1.0] and τR is in the range 1.0–2.0 s. The generator gain KR and time constant τR are load dependent.
The sensor is modeled by a gain KR and time constant τR. The transfer function is given by
Vs(s)Vt(s)=KR1+τRs, | (4.5) |
where KR is in the range [10,400] and τR is in the range 0.001–0.06 s.
The complete transfer function model of the AVR system is given in Figure 2. In the work of Gozde and Taplanmacioglu [37], the parameters of the AVR system were KA=10.0, τA=0.1, KE=1.0, τE=0.4, KG=1.0, τG=1.0, KR=1.0, and τR=0.01.
The transformer function of the AVR system with the above parameters is
ΔVt(s)ΔVref(s)=0.1s+100.0004s4+0.045s3+0.555s2+1.51s2+1.51s+11. | (4.6) |
To improve the dynamic response of the AVR system and maintain the terminal voltage at 1.0 pu, a PID controller is included, as shown in Figure 2.
With the PID controller, the transfer function of the AVR system of Figure 2 becomes
ΔVt(s)ΔVref(s)=0.1Kds2+(0.1Kp+10Kd)s2+(0.1Ki+10Kp)s+10Ki0.0004s5+0.045s4+0.555s3+(1.51+10Kd)s2+(1+10Kp)s+10Ki. | (4.7) |
An AVR system with a PID controller tuned by the ISHO algorithm is shown in Figure 2. The gains of the PID controller are regulated by the ISHO algorithm. If the proportional gain is too high, then the system becomes unstable and the proportional gain becomes too low, which results in a larger error and lower sensitivity. For an AVR system, the ranges commonly used in the literature are [0.0, 1.5] and [0.2, 2.0] in [38,39]. To increase the search space for better optimization gains, the resulting lower and upper bounds are chosen to be 0.01 and 2, respectively.
To improve the performance control, the optimal PID parameters use the ISHO. The maximum overshoot, rise time, steady state error as a typical time domain analysis method index, and integral time multiplied by the absolute error (ITAE) are considered as control performance indicators in the design. The ITAE is the objective function with time value:
ITAE=∫t0t|Vt−Vref|dt. | (4.8) |
An ISHO-PID controller is presented for searching the optimal or near optimal controller parameters Kp, Ki, and Kd using the ISHO algorithm. Each individual K contains three members: Kp, Ki, and Kd. The searching procedures of the proposed ISHO-PID controller are presented in Algorithm 4. The three controller parameters set in the algorithm are shown in Table 1.
Algorithm 4 ISHO solution for the PID control system algorithm |
1. Determine the parameters of the PID, proportional gain Kp, integral gain Ki, and differential gain Kd. 2. Randomly initialize population X of N individuals (solutions), iter=0, and set the parameters of the ISHO, h, B, and E, and maximum number of iterations itermax. 3. Set the lower and upper bounds of the three controller parameters for each individual, apply the PID controller with gains specified by that individual to the PID controller, run all the system steps, and calculate the fitness value of each individual using Eq (4.8). 4. Determine the optimal spotted hyena individual. while stop if the termination criterion is not satisfied do 5. for each individual x∈X do 5.1. Propagate each spotted hyena individual x to a new individual x′ using Eq (2.7). 5.2. if f(x′)>f(x) then 6. Update the position of all individuals using Eq (2.10). 7. Calculate each individual fitness function using Eq (4.8). 8. iter=iter+1. 9. if iter<itermax, then go to step 5. 10. Output the best solution and the optimal controller parameters. |
Controller parameters | Min. value | Max. value |
Kp | 0 | 1.5 |
Ki | 0 | 1.0 |
Kd | 0 | 1.0 |
The ISHO algorithm was applied to optimize the PID controller for an AVR system and determine a set of optimal gains that minimize the value of the objective function. To prove the superiority of the ISHO algorithm, we compared the ISHO with other algorithms that contain the SHO [19], GWO [40], PSOGSA [41], FPA [42], and SCA [43]. The results showed that the ISHO performed better than the other algorithms. All the parameters set in the algorithms are given in Table 2.
Algorithms | Parameter values |
SCA | r2∈[0,2π], a=2, r4∈[0,1]. The population size is 50. |
FPA | The proximity probability p = 0.8, the population size is 50. |
PSOGSA | c1=c2=2, ωmax=0.3,ωmin=0.1, G0=1, α=5 the population size is 50. |
GWO | Components →α∈[0,2] over the course of iterations. The population size is 50. |
SHO | The parameter is →h∈[0,5] over the course of iterations, the population size is 50. |
ISHO | →hinitial=5, hfinal=0, u∈[0,2.0]. The population size is 50. |
Setting the six algorithms’ parameters, we obtained the best parameter values for each algorithm to optimize the PID parameters using the population size of 50, 20 iterations, and 20 runs independently. "Best" is the optimal fitness value, "Worst" is the worst fitness value, "Mean" is the mean fitness value, and "Std." is the standard deviation. Table 3 shows that the best fitness value of ISHO was significantly better than those of the other algorithms, and the standard error of the ISHO was the smallest. It is thus proved that the ISHO is better than the standard SHO and other algorithms (SCA, FPA, PSOGSA, and GWO) in terms of obtaining the optimal PID parameters.
Algorithms | SCA | FPA | PSOGSA | GWO | SHO | ISHO |
Kp | 1.4155 | 1.4230 | 1.4012 | 1.3168 | 1.3079 | 1.0263 |
Ki | 0.9721 | 0.9974 | 0.9602 | 0.9051 | 0.9234 | 0.7115 |
Kd | 0.4546 | 0.4302 | 0.4601 | 0.4219 | 0.3985 | 0.3154 |
Best | 0.0328 | 0.0329 | 0.0328 | 0.0329 | 0.0334 | 0.0327 |
Worst | 0.0382 | 0.0380 | 0.0333 | 0.0369 | 0.0370 | 0.0331 |
Ave | 0.0344 | 0.0341 | 0.0330 | 0.0344 | 0.0347 | 0.0328 |
Std | 0.0015 | 0.0012 | 1.5427 × 10−4 | 0.0012 | 9.8111 × 10−4 | 8.4078 × 10−5 |
In Table 2, we label the optimal PID parameters with the optimal fitness values, and the minimum standard error is indicated by the black bold line. The table shows that, although the PSOGSA algorithm is also a hybrid of the PSO and GSA algorithms, the effect of optimally searching for PID parameters was still not as good as that of the ISHO algorithm.
Algorithms | SCA | FPA | PSOGSA | GWO | SHO | ISHO |
Maximum overshoots | 1.1751 | 1.1601 | 1.1383 | 1.1767 | 1.2017 | 1.120 |
Peak time (s) | 0.3821 | 0.3923 | 0.3883 | 0.3924 | 0.3951 | 0.4160 |
Settling time (s) | 0.6930 | 1.003 | 0.9723 | 0.9494 | 0.9288 | 0.8481 |
Rise time (s) | 0.2382 | 0.2207 | 0.2883 | 0.2274 | 0.2010 | 0.3021 |
The transient and steady-state behavior of the system can be analyzed from the transient analysis of the ISHO optimized PID controller in the AVR system, as shown in Figure 4. For comparison, responses for the SCA, FPA, PSOGSA, GWO, and SHO algorithms are shown in Table 8. The figure shows that the maximum overshoot for the ISHO algorithm is 5% less than that of the SCA algorithm, 3.5% less than that of the FPA algorithm, 4.82% less than that of the GWO algorithm, and 6.8% less than that of the SHO algorithm. The peak time for the ISHO algorithm is more than that of the SHO, GWO, PSOGSA, FPA, and SCA algorithms. The maximum overshoot and settling time for the ISHO algorithm are better than those of the SHO, GWO, PSOGSA, FPA, and SCA algorithms, and are major factors for comparing the stability analysis of systems.
The convergence characteristics are shown in Figure 4. The figure shows that the ISHO algorithm’s fitness value decreases the fastest compared with those of the other algorithms. This shows that the ISHO algorithm has a strong global search capability and higher precision. The ISHO algorithm is considered as an optimization of the PID controller parameters in the AVR system, which has promising potential applications.
The SHO was inspired by the social behavior of a spotted hyena swarm. Its mathematical model is relatively simple, but the control parameter directly affects the balance between the global search ability and local search ability in the SHO algorithm. Based on the analysis of the above characteristics of the SHO, in this paper, a nonlinear adjustment strategy was adopted for the control parameters and the mutation strategy was used to deal with the update of the intelligent individual position. The performance of the improved algorithm was verified by a simulation. The ISHO quickly approached the theoretical value and significantly improved the convergence speed and optimization efficiency. The ISHO algorithm was used to determine the parameters of the PID controller for an AVR system. It is clear from the results that the proposed ISHO algorithm avoided the shortcoming of the premature convergence of the SHO, GWO, PSOGSA, FPA, and SCA algorithms and obtained global solutions with better computation efficiency.
This work was supported by the Project of China University of Political Science and Law Research Innovation under Grant No. 10818441 and the Young Scholar Fund of China University of Political Science and Law under Grant No. 10819144. We thank Maxine Garcia, PhD, from Liwen Bianji, Edanz Group China (www.liwenbianji.cn/ac) for editing the English text of a draft of this manuscript.
The authors declare no conflict of interest.
[1] |
N. Yu, Q. Xu, H. Wang, J. Lin, Wafer bin map inspection based on densenet, J. Cent. South Univ., 28 (2021), 2436–2450. https://doi.org/10.1007/s11771-021-4778-7 doi: 10.1007/s11771-021-4778-7
![]() |
[2] |
L. Alam, N. Kehtarnavaz, A survey of detection methods for die attachment and wire bonding defects in integrated circuit manufacturing, IEEE Access, 10 (2022), 83826–83840. https://doi.org/10.1109/ACCESS.2022.3197624 doi: 10.1109/ACCESS.2022.3197624
![]() |
[3] |
Y. Fu, X. Ma, H. Zhou, Automatic detection of multi-crossing crack defects in multi-crystalline solar cells based on machine vision, Mach. Vision Appl., 32 (2021), 1–14. https://doi.org/10.1007/s00138-021-01183-9 doi: 10.1007/s00138-021-01183-9
![]() |
[4] |
Q. Hu, K. Hao, B. Wei, H. Li, An efficient solder joint defects method for 3d point clouds with double-flow region attention network, Adv. Eng. Inform., 52 (2022), 101608. https://doi.org/10.1016/j.aei.2022.101608 doi: 10.1016/j.aei.2022.101608
![]() |
[5] |
W. Dai, A. Mujeeb, M. Erdt, A. Sourin, Soldering defect detection in automatic optical inspection, Adv. Eng. Inform., 43 (2022), 101004. https://doi.org/10.1016/j.aei.2019.101004 doi: 10.1016/j.aei.2019.101004
![]() |
[6] |
T. Kim, K. Behdinan, Advances in machine learning and deep learning applications towards wafer map defect recognition and classification: a review, J. Intell. Manuf., (2022), 1–33. https://doi.org/10.1007/s10845-022-01994-1 doi: 10.1007/s10845-022-01994-1
![]() |
[7] |
K. C. Cheng, L. L. Chen, J. Li, K. S. Li, N. C. Tsai, S. Wang, et al., Machine learning-based detection method for wafer test induced defects, IEEE Trans. Semicond. Manuf., 34 (2021), 161–167. https://doi.org/10.1109/TSM.2021.3065405 doi: 10.1109/TSM.2021.3065405
![]() |
[8] |
J. Wang, Z. Yu, Z. Duan, G. Lu, A sub-region one-to-one mapping (som) detection algorithm for glass passivation parts wafer surface low-contrast texture defects, Multimedia Tools Appl., 80 (2021), 28879–28896. https://doi.org/10.1007/s11042-021-11084-8 doi: 10.1007/s11042-021-11084-8
![]() |
[9] |
K. S. Li, P. Y. Liao, K. C. Cheng, L. L. Chen, S. Wang, A. Y. Huang, et al., Hidden wafer scratch defects projection for diagnosis and quality enhancement, IEEE Trans. Semicond. Manuf., 34 (2020), 9–16. https://doi.org/10.1109/TSM.2020.3040998 doi: 10.1109/TSM.2020.3040998
![]() |
[10] |
N. Shankar, Z. Zhong, Defect detection on semiconductor wafer surfaces, Microelectron. Eng., 77 (2005), 337–346. https://doi.org/10.1016/j.mee.2004.12.003 doi: 10.1016/j.mee.2004.12.003
![]() |
[11] |
C. Yeh, F. Wu, W. Ji, C. Huang, A wavelet-based approach in detecting visual defects on semiconductor wafer dies, IEEE Trans. Semicond. Manuf., 23 (2010), 284–292. https://doi.org/10.1109/TSM.2010.2046108 doi: 10.1109/TSM.2010.2046108
![]() |
[12] |
Y. Chiou, J. Liu, Y. Liang, Micro crack detection of multi-crystalline silicon solar wafer using machine vision techniques, Sensor Rev., 31 (2011), 154–165. https://doi.org/10.1108/02602281111110013 doi: 10.1108/02602281111110013
![]() |
[13] |
M. Yao, J. Li, X. Wang, Solar cells surface defects detection using rpca method, Chin. J. Comput., 36 (2013), 1943–1952. https://doi.org/10.3724/SP.J.1016.2013.01943 doi: 10.3724/SP.J.1016.2013.01943
![]() |
[14] |
H. Lin, S. Chiu, Flaw detection of domed surfaces in led packages by machine vision system, Expert Syst. Appl., 38 (2011), 15208–15216. https://doi.org/10.1016/j.eswa.2011.05.080 doi: 10.1016/j.eswa.2011.05.080
![]() |
[15] |
Z. Zhang, Y. Liu, X. Wu, S. Kan, Integrated color defect detection method for polysilicon wafers using machine vision, Adv. Manuf., 2 (2014), 318–326. https://doi.org/10.1007/S40436-014-0095-9 doi: 10.1007/S40436-014-0095-9
![]() |
[16] | N. Saad, A. Ahmad, H. Saleh, A. Hasan, Automatic semiconductor wafer image segmentation for defect detection using multilevel thresholding, in MATEC Web of Conferences, EDP Sciences, 2016. https://doi.org/10.1051/matecconf/20167801103 |
[17] |
J. Ko, J. Rheem, Defect detection of polycrystalline solar wafers using local binary mean, Int. J. Adv. Manuf. Technol., 82 (2016), 1753–1764. https://doi.org/10.1007/s00170-015-7498-z doi: 10.1007/s00170-015-7498-z
![]() |
[18] |
Z. Wang, X. Liu, Z. He, L. Su, X. Lu, Intelligent detection of flip chip with the scanning acoustic microscopy and the general regression neural network, Microelectron. Eng., 217 (2019), 111127. https://doi.org/10.1016/j.mee.2019.111127 doi: 10.1016/j.mee.2019.111127
![]() |
[19] | X. Chen, C. Zhao, J. Chen, D. Zhang, K. Zhu, Y. Su, K-means clustering with morphological filtering for silicon wafer grain defect detection, in 2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference (ITNEC), 1 (2020), 1251–1255. https://doi.org/10.1109/ITNEC48623.2020.9084726 |
[20] |
B. M. Haddad, S. F. Dodge, L. J. Karam, N. S. Patel, M. W. Braun, Locally adaptive statistical background modeling with deep learning-based false positive rejection for defect detection in semiconductor units, IEEE Trans. Semicond. Manuf., 33 (2020), 357–372. https://doi.org/10.1109/TSM.2020.2998441 doi: 10.1109/TSM.2020.2998441
![]() |
[21] | Y. Yang, M. Sun, Semiconductor defect detection by hybrid classical-quantum deep learning, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2022), 2323–2332. https://doi.org/10.1109/CVPR52688.2022.00236 |
[22] |
H. Chen, Automated detection and classification of defective and abnormal dies in wafer images, Appl. Sci., 10 (2020), 3423. https://doi.org/10.3390/app10103423 doi: 10.3390/app10103423
![]() |
[23] |
J. O'Leary, K. Sawlani, A. Mesbah, Deep learning for classification of the chemical composition of particle defects on semiconductor wafers, IEEE Trans. Semicond. Manuf., 33 (2020), 72–85. https://doi.org/10.1109/TSM.2019.2963656 doi: 10.1109/TSM.2019.2963656
![]() |
[24] |
N. Yu, Q. Xu, H. Wang, Wafer defect pattern recognition and analysis based on convolutional neural network, IEEE Trans. Semicond. Manuf., 32 (2019), 566–573. https://doi.org/10.1109/TSM.2019.2937793 doi: 10.1109/TSM.2019.2937793
![]() |
[25] |
P. P. Shinde, P. P. Pai, S. P. Adiga, Wafer defect localization and classification using deep learning techniques, IEEE Access, 10 (2022), 39969–39974. https://doi.org/10.1109/ACCESS.2022.3166512 doi: 10.1109/ACCESS.2022.3166512
![]() |
[26] |
S. Chen, C. Kang, D. Perng, Detecting and measuring defects in wafer die using gan and yolov3, Appl. Sci., 10 (2020), 8725. https://doi.org/10.3390/app10238725 doi: 10.3390/app10238725
![]() |
[27] |
Y. Yi, S. Lai, W. Wang, S. Li, R. Zhang, Y. Luo, et al., Sdnmf: Semisupervised discriminative nonnegative matrix factorization for feature learning, Int. J. Intell. Syst., 37 (2022), 11547–11581. https://doi.org/10.1002/int.23054 doi: 10.1002/int.23054
![]() |
[28] |
Y. Yi, J. Wang, W. Zhou, C. Zheng, J. Kong, S. Qiao, Non-negative matrix factorization with locality constrained adaptive graph, IEEE Trans. Circuits Syst. Video Technol., 30 (2019), 427–441. https://doi.org/10.1109/TCSVT.2019.2892971 doi: 10.1109/TCSVT.2019.2892971
![]() |
[29] |
X. Yang, G. Lin, Y. Liu, F. Nie, L. Lin, Fast spectral embedded clustering based on structured graph learning for large-scale hyperspectral image, IEEE Geosci. Remote Sens. Lette., 19 (2022), 1–5. https://doi.org/10.1016/j.ins.2023.03.035 doi: 10.1016/j.ins.2023.03.035
![]() |
[30] |
L. He, N. Ray, Y. Guan, H. Zhang, Fast large-scale spectral clustering via explicit feature mapping, IEEE Trans. Cybern., 49 (2018), 1058–1071. https://doi.org/10.1109/TCYB.2018.2794998 doi: 10.1109/TCYB.2018.2794998
![]() |
[31] |
P. Bourgeat, F. Meriaudeau, K. W. Tobin, P. Gorria, Content based segmentation of patterned wafers, J. Electr. Imaging, 13 (2004), 428–435. https://doi.org/10.1117/1.1762518 doi: 10.1117/1.1762518
![]() |
[32] |
J. Yang, Y. Xu, H. Rong, S. Du, H. Zhang, A method for wafer defect detection using spatial feature points guided affine iterative closest point algorithm, IEEE Access, 8 (2020), 79056–79068. https://doi.org/10.1109/ACCESS.2020.2990535 doi: 10.1109/ACCESS.2020.2990535
![]() |
[33] |
S. Wang, Z. Zhong, Y. Zhao, L. Zuo, A variational autoencoder enhanced deep learning model for wafer defect imbalanced classification, IEEE Trans. Compon., Packag., Manuf. Technol., 11 (2021), 2055–2060. https://doi.org/10.1109/TCPMT.2021.3126083 doi: 10.1109/TCPMT.2021.3126083
![]() |
[34] |
W. Li, D. Tsai, Automatic saw-mark detection in multicrystalline solar wafer images, Sol. Energy Mater. Sol. Cells, 95 (2011), 2206–2220. https://doi.org/10.1016/j.solmat.2011.03.025 doi: 10.1016/j.solmat.2011.03.025
![]() |
[35] |
T. Schlosser, M. Friedrich, F. Beuth, D. Kowerko, Improving automated visual fault inspection for semiconductor manufacturing using a hybrid multistage system of deep neural networks, J. Intell. Manuf., 33 (2022), 1099–1123. https://doi.org/10.1007/s10845-021-01906-9 doi: 10.1007/s10845-021-01906-9
![]() |
1. | Amirreza Naderipour, Zulkurnain Abdul-Malek, Mohammad Hajivand, Zahra Mirzaei Seifabad, Mohammad Ali Farsi, Saber Arabi Nowdeh, Iraj Faraji Davoudkhani, Spotted hyena optimizer algorithm for capacitor allocation in radial distribution system with distributed generation and microgrid operation considering different load types, 2021, 11, 2045-2322, 10.1038/s41598-021-82440-9 | |
2. | Nibedan Panda, Santosh Kumar Majhi, Rosy Pradhan, A Hybrid Approach of Spotted Hyena Optimization Integrated with Quadratic Approximation for Training Wavelet Neural Network, 2022, 47, 2193-567X, 10347, 10.1007/s13369-022-06564-4 | |
3. | Davut Izci, Serdar Ekinci, Hatice Lale Zeynelgil, Controlling an automatic voltage regulator using a novel Harris hawks and simulated annealing optimization technique, 2023, 2578-0727, 10.1002/adc2.121 | |
4. | Nikhil Paliwal, Laxmi Srivastava, Manjaree Pandit, Rao algorithm based optimal Multi‐term FOPID controller for automatic voltage regulator system , 2022, 43, 0143-2087, 1707, 10.1002/oca.2926 | |
5. | Serdar Ekinci, Davut Izci, Erdal Eker, Laith Abualigah, An effective control design approach based on novel enhanced aquila optimizer for automatic voltage regulator, 2023, 56, 0269-2821, 1731, 10.1007/s10462-022-10216-2 | |
6. | Abdelhakim Idir, Laurent Canale, Yassine Bensafia, Khatir Khettab, Design and Robust Performance Analysis of Low-Order Approximation of Fractional PID Controller Based on an IABC Algorithm for an Automatic Voltage Regulator System, 2022, 15, 1996-1073, 8973, 10.3390/en15238973 | |
7. | Shafih Ghafori, Farhad Soleimanian Gharehchopogh, Advances in Spotted Hyena Optimizer: A Comprehensive Survey, 2022, 29, 1134-3060, 1569, 10.1007/s11831-021-09624-4 | |
8. | Yi Zhang, XianBo Sun, Li Zhu, ShengXin Yang, YueFei Sun, Qingling Wang, Research on Three-Phase Unbalanced Commutation Strategy Based on the Spotted Hyena Optimizer Algorithm, 2022, 2022, 1099-0526, 1, 10.1155/2022/2092421 | |
9. | Chunhui Mo, Xiaofeng Wang, Lin Zhang, 2022, Chapter 10, 978-981-19-8151-7, 142, 10.1007/978-981-19-8152-4_10 | |
10. | Davut Izci, Serdar Ekinci, H. Lale Zeynelgil, John Hedley, Performance evaluation of a novel improved slime mould algorithm for direct current motor and automatic voltage regulator systems, 2022, 44, 0142-3312, 435, 10.1177/01423312211037967 | |
11. | Davut Izci, Serdar Ekinci, Seyedali Mirjalili, Optimal PID plus second-order derivative controller design for AVR system using a modified Runge Kutta optimizer and Bode’s ideal reference model, 2022, 2195-268X, 10.1007/s40435-022-01046-9 | |
12. | Nikhil Paliwal, Laxmi Srivastava, Manjaree Pandit, Equilibrium optimizer tuned novel FOPID‐DN controller for automatic voltage regulator system , 2021, 31, 2050-7038, 10.1002/2050-7038.12930 | |
13. | Muhammad Imran Nadeem, Kanwal Ahmed, Dun Li, Zhiyun Zheng, Hafsa Naheed, Abdullah Y. Muaad, Abdulrahman Alqarafi, Hala Abdel Hameed, SHO-CNN: A Metaheuristic Optimization of a Convolutional Neural Network for Multi-Label News Classification, 2022, 12, 2079-9292, 113, 10.3390/electronics12010113 | |
14. | Özay Can, Cenk Andiç, Serdar Ekinci, Davut Izci, Enhancing transient response performance of automatic voltage regulator system by using a novel control design strategy, 2023, 0948-7921, 10.1007/s00202-023-01777-8 | |
15. | Sudhakar Babu Thanikanti, T. Yuvaraj, R. Hemalatha, Belqasem Aljafari, Nnamdi I. Nwulu, Optimizing Radial Distribution System With Distributed Generation and EV Charging: A Spotted Hyena Approach, 2024, 12, 2169-3536, 113422, 10.1109/ACCESS.2024.3438456 | |
16. | Bora Çavdar, Erdinç Şahin, Erhan Sesli, On the assessment of meta-heuristic algorithms for automatic voltage regulator system controller design: a standardization process, 2024, 106, 0948-7921, 5801, 10.1007/s00202-024-02314-x | |
17. |
Bora Çavdar, Erdinç Şahin, Ömür Akyazı, Fatih Mehmet Nuroğlu,
A novel optimal PI\uplambda1I\uplambda2D\upmu1D\upmu2 controller using mayfly optimization algorithm for automatic voltage regulator system,
2023,
35,
0941-0643,
19899,
10.1007/s00521-023-08834-0
|
|
18. | Rohit Salgotra, Pankaj Sharma, Saravanakumar Raju, Amir H. gandomi, A Contemporary Systematic Review on Meta-heuristic Optimization Algorithms with Their MATLAB and Python Code Reference, 2024, 31, 1134-3060, 1749, 10.1007/s11831-023-10030-1 | |
19. | Ömer Öztürk, Bora Çavdar, Otomatik Gerilim Regülatörü Sistemi Denetleyici Tasarımı için Meta-Sezgisel Algoritmaların Performansı, 2024, 14, 2564-7377, 2258, 10.31466/kfbd.1558173 | |
20. | Tapas Si, Péricles B. C. Miranda, Utpal Nandi, Nanda Dulal Jana, Ujjwal Maulik, Saurav Mallik, Mohd Asif Shah, QSHO: Quantum spotted hyena optimizer for global optimization, 2025, 58, 1573-7462, 10.1007/s10462-024-11072-y | |
21. | Fei Dai, Tianli Ma, Song Gao, Optimal Design of a Fractional Order PIDD2 Controller for an AVR System Using Hybrid Black-Winged Kite Algorithm, 2025, 14, 2079-9292, 2315, 10.3390/electronics14122315 |
Controller parameters | Min. value | Max. value |
Kp | 0 | 1.5 |
Ki | 0 | 1.0 |
Kd | 0 | 1.0 |
Algorithms | Parameter values |
SCA | r2∈[0,2π], a=2, r4∈[0,1]. The population size is 50. |
FPA | The proximity probability p = 0.8, the population size is 50. |
PSOGSA | c1=c2=2, ωmax=0.3,ωmin=0.1, G0=1, α=5 the population size is 50. |
GWO | Components →α∈[0,2] over the course of iterations. The population size is 50. |
SHO | The parameter is →h∈[0,5] over the course of iterations, the population size is 50. |
ISHO | →hinitial=5, hfinal=0, u∈[0,2.0]. The population size is 50. |
Algorithms | SCA | FPA | PSOGSA | GWO | SHO | ISHO |
Kp | 1.4155 | 1.4230 | 1.4012 | 1.3168 | 1.3079 | 1.0263 |
Ki | 0.9721 | 0.9974 | 0.9602 | 0.9051 | 0.9234 | 0.7115 |
Kd | 0.4546 | 0.4302 | 0.4601 | 0.4219 | 0.3985 | 0.3154 |
Best | 0.0328 | 0.0329 | 0.0328 | 0.0329 | 0.0334 | 0.0327 |
Worst | 0.0382 | 0.0380 | 0.0333 | 0.0369 | 0.0370 | 0.0331 |
Ave | 0.0344 | 0.0341 | 0.0330 | 0.0344 | 0.0347 | 0.0328 |
Std | 0.0015 | 0.0012 | 1.5427 × 10−4 | 0.0012 | 9.8111 × 10−4 | 8.4078 × 10−5 |
Algorithms | SCA | FPA | PSOGSA | GWO | SHO | ISHO |
Maximum overshoots | 1.1751 | 1.1601 | 1.1383 | 1.1767 | 1.2017 | 1.120 |
Peak time (s) | 0.3821 | 0.3923 | 0.3883 | 0.3924 | 0.3951 | 0.4160 |
Settling time (s) | 0.6930 | 1.003 | 0.9723 | 0.9494 | 0.9288 | 0.8481 |
Rise time (s) | 0.2382 | 0.2207 | 0.2883 | 0.2274 | 0.2010 | 0.3021 |
Controller parameters | Min. value | Max. value |
Kp | 0 | 1.5 |
Ki | 0 | 1.0 |
Kd | 0 | 1.0 |
Algorithms | Parameter values |
SCA | r2∈[0,2π], a=2, r4∈[0,1]. The population size is 50. |
FPA | The proximity probability p = 0.8, the population size is 50. |
PSOGSA | c1=c2=2, ωmax=0.3,ωmin=0.1, G0=1, α=5 the population size is 50. |
GWO | Components →α∈[0,2] over the course of iterations. The population size is 50. |
SHO | The parameter is →h∈[0,5] over the course of iterations, the population size is 50. |
ISHO | →hinitial=5, hfinal=0, u∈[0,2.0]. The population size is 50. |
Algorithms | SCA | FPA | PSOGSA | GWO | SHO | ISHO |
Kp | 1.4155 | 1.4230 | 1.4012 | 1.3168 | 1.3079 | 1.0263 |
Ki | 0.9721 | 0.9974 | 0.9602 | 0.9051 | 0.9234 | 0.7115 |
Kd | 0.4546 | 0.4302 | 0.4601 | 0.4219 | 0.3985 | 0.3154 |
Best | 0.0328 | 0.0329 | 0.0328 | 0.0329 | 0.0334 | 0.0327 |
Worst | 0.0382 | 0.0380 | 0.0333 | 0.0369 | 0.0370 | 0.0331 |
Ave | 0.0344 | 0.0341 | 0.0330 | 0.0344 | 0.0347 | 0.0328 |
Std | 0.0015 | 0.0012 | 1.5427 × 10−4 | 0.0012 | 9.8111 × 10−4 | 8.4078 × 10−5 |
Algorithms | SCA | FPA | PSOGSA | GWO | SHO | ISHO |
Maximum overshoots | 1.1751 | 1.1601 | 1.1383 | 1.1767 | 1.2017 | 1.120 |
Peak time (s) | 0.3821 | 0.3923 | 0.3883 | 0.3924 | 0.3951 | 0.4160 |
Settling time (s) | 0.6930 | 1.003 | 0.9723 | 0.9494 | 0.9288 | 0.8481 |
Rise time (s) | 0.2382 | 0.2207 | 0.2883 | 0.2274 | 0.2010 | 0.3021 |