Application of Grasshopper Optimization Algorithm for Selective Harmonics Elimination in Low-Frequency Voltage Source Inverter

: In this paper, an application of the recently developed Grasshopper Optimization Algorithm (GOA) for calculation of switching angles for Selective Harmonic Elimination (SHE) PWM in low-frequency voltage source inverter is proposed. The algorithm is based on insect behavior in the food foraging swarm of grasshoppers. The characteristic feature of GOA is the movement of agents is based on the position of all agents in the swarm. This method represents a higher probability of convergence than Particle Swarm Optimization (PSO) Modiﬁcations of GOA have been examined regarding their e ﬀ ect on the algorithm’s convergence. The proposed modiﬁcations were based on the following techniques: Grey Wolf Optimizer (GWO), Natural Selection (NS), Adaptive Grasshopper Optimization Algorithm (AGOA), and Opposite Based Learning (OBL). The performance of GOA and its modiﬁcations were compared with well-known PSO. Areas, where GOA is superior to PSO in terms of probability of convergence, have been shown. The e ﬃ ciency of the GOA algorithm applied for solving the SHE problem was conﬁrmed by measurements in the laboratory


Introduction
The Selective Harmonic Elimination (SHE) and Selective Harmonic Mitigation (SHM) [1,2] has been described for the first time in the 1960s in [3] and disseminated by Patel and Hoft [4,5]. Since that time SHE has been introduced in a number of industrial applications where power electronics was proposed [6]. The challenge is progress in the development of techniques for solving SHE/SHM non-linear transcendental equations Since the early days, iterative techniques such as Newton-Raphson (N-R) [4,5], Gauss-Newton have been employed to solve these equations. The convergence of these methods depends on the initial guess, which is a complex problem and in many cases is not successful. This disadvantage encourages researchers to develop more effective techniques. Thus, Chaison et al. in [7] proposed the method based on the conversion of transcendental equations into an equivalent set of polynomials. The high degree of polynomial requires specialized software to compute it. The combination of Groebner's bases and symmetric polynomials was applied to solve the mentioned polynomials [8]. However, it generates ambiguous solutions which make it less useful. The main disadvantage of iterative techniques is they do not find an optimum solution.
The development of evolutionary algorithms opens new opportunities in the field of solving SHE equations [9]. These algorithms present numerous benefits such as independence from an initial guess, variable complexity that depends on assumptions like the number of switching angles, modulation index, dead times between switching, switching frequency, and others. Thus, there is a possibility that for different optimization region different algorithm is most suitable. Thus, every recently developed algorithm should be evaluated towards application for solving SHE-PWM equations. In this paper, the authors present the study for the application of the GOA algorithm. The novelty of this study is proof that there is a range of SHE problems where the GOA algorithm gives a higher possibility of convergence with lower computational effort than widely used and appreciated PSO. Results presented in this paper encourage further research to discover the full potential of the GOA algorithm regarding the presented problem by comparing it with a wider representation of bio-inspired algorithms.
The problem undertaken in the study is considered as a single criteria optimization problem. SHE problem could be considered as a multi-objective optimization problem as each harmonic value as a function of optimization variables could be considered as a separate objective function. However, all considered harmonics in the problem of SHE should be eliminated for the same optimization variables, therefore the desirable optimization solution is a utopian solution from the point of view of the multi-optimization approach [40]. Accordingly, the optimization functions have been aggregated to a single optimization variable by means of the dedicated relationship proposed in the article.

Drive's Parameters
The main goal of this work is to study the convergence of GOA applied for the calculation of switching angles for SHE-PWM for a low-frequency VSI drive with an induction motor. Therefore, to prove the validity of results obtained by the examined algorithm, the VSI drive was modeled in MATBAL/SIMULINK and verified in the laboratory. Parameters of utilized induction motor for experiments are presented in Table 1.  Figure 1a. illustrates the topology of the VSI utilized for the purpose of this work. Figure 1b shows an equivalent circuit of a single phase of the motor applied in the SIMULINK model. Inverter's transistors were controlled by binary switching function (SF(ωt)) formed by switching angles (α) defined as angular "moments" of transistors state change ( Figure 2). Switching angles are delivered by solving equations presented in this section.

SHE-PWM
In the great number of cases of SHE-PWM application, it is used in electric drives to eliminate low order harmonics, while amplitudes of high order harmonics are reduced by input filters. SHE equations are based on the Fourier series expansion of the inverter output voltage waveform: where ω is an angular frequency of fundamental component, n is a harmonic order, and an, bn are Fourier coefficients. For quarter-wave symmetry, only coefficient an for the odd n coefficient represents the non-zero value: where UDC is DC-link voltage and n is the number of switching angles per a quarter-period. In this paper, fluctuation and ripplers of DC-link voltage were not of concern.
Assuming the odd quarter-wave symmetry of inverter output voltage, triple harmonics are canceled. The symmetry of the system brings cancelation of even harmonics as well. For n = 5 switching angles in quarter-period, 5 non-linear equations can be formulated (4) to satisfy fundamental component (V1) and eliminate 5th, 7th, 11th, and 13th harmonics:

SHE-PWM
In the great number of cases of SHE-PWM application, it is used in electric drives to eliminate low order harmonics, while amplitudes of high order harmonics are reduced by input filters. SHE equations are based on the Fourier series expansion of the inverter output voltage waveform: where ω is an angular frequency of fundamental component, n is a harmonic order, and an, bn are Fourier coefficients. For quarter-wave symmetry, only coefficient an for the odd n coefficient represents the non-zero value: where UDC is DC-link voltage and n is the number of switching angles per a quarter-period. In this paper, fluctuation and ripplers of DC-link voltage were not of concern.
Assuming the odd quarter-wave symmetry of inverter output voltage, triple harmonics are canceled. The symmetry of the system brings cancelation of even harmonics as well. For n = 5 switching angles in quarter-period, 5 non-linear equations can be formulated (4) to satisfy fundamental component (V1) and eliminate 5th, 7th, 11th, and 13th harmonics:

SHE-PWM
In the great number of cases of SHE-PWM application, it is used in electric drives to eliminate low order harmonics, while amplitudes of high order harmonics are reduced by input filters. SHE equations are based on the Fourier series expansion of the inverter output voltage waveform: [a n sin(nωt) + b n cos(nωt)] where ω is an angular frequency of fundamental component, n is a harmonic order, and an, bn are Fourier coefficients. For quarter-wave symmetry, only coefficient an for the odd n coefficient represents the non-zero value: where U DC is DC-link voltage and n is the number of switching angles per a quarter-period. In this paper, fluctuation and ripplers of DC-link voltage were not of concern.
Assuming the odd quarter-wave symmetry of inverter output voltage, triple harmonics are canceled. The symmetry of the system brings cancelation of even harmonics as well. For n = 5 Energies 2020, 13, 6426 5 of 16 switching angles in quarter-period, 5 non-linear equations can be formulated (4) to satisfy fundamental component (V1) and eliminate 5th, 7th, 11th, and 13th harmonics: where M1 is for modulation index: In this case the fundamental voltage component (V1) is defined as the amplitude of phase voltage of the motor in the star connection of the windings. The main goal of this paper is to adopt GOA for solving Equation (4) to determine switching angles for SHE-PWM end examine its convergence.
Thus, the aim is to apply an optimization algorithm to minimize fitness function (6) to achieve declared fundamental component (V * 1 ) and harmonics elimination. The fundamental component is minimized with the highest weigh (penalty value) that equals σ 1 = 100. Thus, every 1% of difference between an actual value and the desired one will increase fitness function by 100. Harmonics are minimized with penalty weight σ 5 = σ 7 = σ 11 = σ 12 = 10 One of the essential assumptions of every optimization algorithm is the STOP criterion based on the maximum number of iterations and the minimum value of the fitness function. In this paper, the minimum value of the fitness function assumed to be the success is f fit _ STOP = 0.0001. Regarding the necessity of implementation of dead-times in industrial applications (in this paper dt = 5 × 10 −6 s), a lower value of the fitness function will not be recognized as higher quality performance. To prove this statement, sample results obtained by GOA with tolerance 1 × 10 −3 ( Figure 3a) were compared with the results obtained with tolerance 1 × 10 −10 ( Figure 3b). Figure 3 shows that decreasing the parameter of tolerance does not guarantee better efficiency of eliminated harmonics, only significantly increases computation time. Thus, tolerance 1 × 10 −3 was assumed to be sufficient. More results will be presented in Section 5.

Grasshopper Optimization Algorithm (GOA)
GOA was developed and introduced by Saremi, Mirjalili, and Lewis in [20]. The first proposed application was for structural optimization to find the optimal shape of a three-bar truss, a 52-bar truss, and a Cantilever beam. In this paper, the authors present the application of GOA to solve SHE equations. The proposed algorithm mathematically models the behavior of grasshopper swarm foraging for food to survive. Their individual behavior and social interactions lead the swarm to the optimal solution. The mathematical model of grasshopper behavior is based on a formula for the position of each grasshopper described by the following equation: where Xi is the position of the i-th grasshopper, Si is the social interaction between agents in the swarm, Gi is the gravity force acting on the i-th grasshopper, and Ai models the wind effect. However, due to specifics of the problems analyzed in this work effect of gravity and wind were omitted. Thus, only social interactions were taken into account.
where * is the normalized distance between the i-th and j-th grasshopper, s( * ) is the function of social forces and ⃗ is an unitary vector from i-th to j-th grasshopper. If absolute value of the distance between the i-th and j-th agent is formulated as: thus, the normalized value is defined as * = 2 + ( , 2) where , 2 is the remainder after division of by 2. Distance normalization allows for the value of the distance to be kept close to the value of 2 what gives the best effect with the s-function.
Unitary vector ⃗ is defined with the following correlation: Thus, ⃗ can be defined by the following formula:

Grasshopper Optimization Algorithm (GOA)
GOA was developed and introduced by Saremi, Mirjalili, and Lewis in [20]. The first proposed application was for structural optimization to find the optimal shape of a three-bar truss, a 52-bar truss, and a Cantilever beam. In this paper, the authors present the application of GOA to solve SHE equations. The proposed algorithm mathematically models the behavior of grasshopper swarm foraging for food to survive. Their individual behavior and social interactions lead the swarm to the optimal solution. The mathematical model of grasshopper behavior is based on a formula for the position of each grasshopper described by the following equation: where X i is the position of the i-th grasshopper, S i is the social interaction between agents in the swarm, G i is the gravity force acting on the i-th grasshopper, and A i models the wind effect. However, due to specifics of the problems analyzed in this work effect of gravity and wind were omitted. Thus, only social interactions were taken into account.
where d * ij is the normalized distance between the i-th and j-th grasshopper, s(d * ij ) is the function of social forces and → d ij is an unitary vector from i-th to j-th grasshopper. If absolute value of the distance between the i-th and j-th agent is formulated as: thus, the normalized value is defined as Thus, → d ij can be defined by the following formula: A characteristic feature of GOA is a comfort zone shrinking with the iteration number. The Comfort zone is the circle around the best agent. Inside the comfort zone, other agents are being repulsed from the leader and outside the comfort zone, they are being attracted to it. This behavior keeps a balance between exploration and exploitation. The decreasing coefficient c models variation of the comfort zone by changing value typically from 1 to some small number. Regarding the above considerations, Equation (7) for the d-dimensional problem can be expanded as follows: where ub d is for upper bound of the d-th dimension, lb d is for lower bound of the d-th dimension, Gbest d is for the global best result in the d-th dimension, s is for s-Function which describes the strength of the interaction between agents and is formulated with the following formula: where F and L are coefficients with suggested values 0.5 and 1.5 respectively. Variation of these coefficients will be analyzed in further sections, regarding its influence on the probability of convergence of the algorithm. Equation (13) reveals the most significant rule of GOA. The position of agents in every iteration is determined with respect to the position of all other agents in the swarm. For instance, in the PSO algorithm position of agents is determined regarding only two vectors: personal best and global best position. That is the reason why GOA requires a lower population to keep the same computational effort. Moreover, an increment of the swarm population may result in lower convergence.
To apply the GOA algorithm for solving SHE Equation (4) the X d i must be correlated with the i-th vector of switching angles [α 1 α 2 α 3 α 4 α 5 ] i Thus, in this case, the problem is 5 dimensional. In the following subsections, the modifications of GOA are proposed and tested in section V.

GOA with GWO Module
Grey Wolf Optimizer is a meta-heuristic algorithm inspired by the behavior of grey wolves and mathematically described by Mirjalili et al. in [41]. The GWO is well studied and can be treated as an independent algorithm. However, its main feature can be implemented in other algorithms. The specifics of the GWO is based on the determination of the three best global solutions called alpha, beta, and gamma. Positions of all particles in the swarm will be updated with respect to the position of the three best global Ta, Tb, Tc. Thus, to combine GOA and GWO, formula (13) will be modified to the following form [24]:

GOA with NS Module
The theory of Natural Selection is based on the random elimination of agents from the swarm with a certain probability P with respect to their fitness value. The better result has a higher chance to survive. Thus, NS requires a classification of the agents then the algorithm calculates P for each agent. To adopt NS for the SHE problem the following formula for P for the i-th agent was developed: where P min is the minimum assumed probability of survival assigned for the weakest agent; P max is the maximum assumed probability of survival assigned for the best agent; f f it_i is the fitness of the i-th agent; f f it_swarm is the mean value of fitness functions of all agents in the swarm. The roulette is performed for every single agent regarding its probability of survival. The eliminated agents are replaced by new random solutions.

Adaptive GOA
Adaptive Grasshopper Optimization Algorithm (AGOA) is based on a dynamic adaptation of the c coefficient regarding the Evolutionary Rate (ER) of the swarm of grasshoppers. ER is defined as the ratio between the number of agents whose fitness was improved in the previous iteration to the total number of agents in the swarm Np. Thus, c for AGOA is defined by the following formula: where F ER (ite) is the dynamic adjustment function defined by the following correlation: where F 0 is a constant larger than 1. Thus, AGOA presents a dynamic change of comfort zone with a decreasing trend.

GOA with OBL Module
Opposite Based Learning is a technique of swarm algorithms modification based on the statement that the opposite solution to the developed one might bring better result. Thus, every solution (agent) should be reversed and its fitness should be evaluated. If the fitness of the reversed solution is better than the original, the agent will be replaced. Opposite value ... X d i can be calculated as follows: However, the application of this technique to SHE brings issues regarding the feasibility of calculated solutions. As switching angles are restricted to be sorted according to their feasibility, Equation (19) will reverse their order and make them not feasible. To implement OBL to solve the SHE problem opposite solution ... X d i must be reordered to respect restriction: 0 < α 1 < α 2 < α 3 < α 4 < α 5 < π 2 .

Simulation Tests and Comparative Study
In this section, a simulation analysis of GOA algorithm performance is presented. Moreover, a comparative study between GOA and modified GOA (NS, AGOA, GWO, and OBL) is carried out. The optimization process has been carried out with the following assumptions: • STOP criterion of the optimization process is obtained when reaching the assumed maximum number of iterations or the value of the fitness function is below the assumed tolerance 1 × 10 −4 • Every modification module is tested separately. The combination of all modules in one algorithm is not tested. The reason is an increment of computation effort for multi-module algorithm what makes it difficult to compare with single module modifications, • Swarm population (Np) and maximum number of iterations (max_ite) for comparative study is established regarding similar computational effort (elapsed time of optimization) for compared algorithms. Figure 4 shows the flow chart of the developed GOA algorithm for SHE with marked modification modules. However, as was mentioned above, only one module is active at the time.

Comparison between GOA and PSO
The comparative study between GOA and PSO was carried out for n = 5 switching angles in a quarter-period, modulation index M1 = 0.9, and fundamental frequency ff = 50 Hz what gives 550 Hz switching frequency. In this work 5th, 7th, 11th, and 13th harmonics are eliminated permanently. Figure 5 presents the trajectories of particles during the optimization process with GOA and PSO algorithms, respectively. The GOA algorithm is characterized by a short time of exploration and a long period of exploitation while the PSO algorithm provides a very high intensity of exploration. Figure 6 shows that PSO needs a higher number of iterations to converge comparing with GOA and its modifications.

Comparison between GOA and PSO
The comparative study between GOA and PSO was carried out for n = 5 switching angles in a quarter-period, modulation index M1 = 0.9, and fundamental frequency f f = 50 Hz what gives 550 Hz switching frequency. In this work 5th, 7th, 11th, and 13th harmonics are eliminated permanently. Figure 5 presents the trajectories of particles during the optimization process with GOA and PSO algorithms, respectively. The GOA algorithm is characterized by a short time of exploration and a long period of exploitation while the PSO algorithm provides a very high intensity of exploration. Figure 6 shows that PSO needs a higher number of iterations to converge comparing with GOA and its modifications. switching frequency. In this work 5th, 7th, 11th, and 13th harmonics are eliminated permanently. Figure 5 presents the trajectories of particles during the optimization process with GOA and PSO algorithms, respectively. The GOA algorithm is characterized by a short time of exploration and a long period of exploitation while the PSO algorithm provides a very high intensity of exploration. Figure 6 shows that PSO needs a higher number of iterations to converge comparing with GOA and its modifications. In the following part of this section, the convergence of GOA and PSO has been compared. The various combinations of parameters were tested. For every set of both GOA and PSO, 100 runs were calculated. For each series of runs, the number of runs that reaches ffit below 1 × 10 −4 was recorded as the success. The variation of the following parameters was studied: maximum number of iterations (max_ite), size of the population (Np), PSO parameters C1 and C2, and GOA parameters used in s-function (L and F). Thus, all results have been presented in Figure 6 where the probability of convergence is compared. The value of population size for PSO and GOA was adjusted to keep similar computation times for both. The best performance of GOA was recorded for settings: Np = 40 max_ite = 300, L = 1.5 and F = 0.5. For the aforementioned setting, GOA achieved 27% convergence (time of computation 101 s). The PSO achieved the best performance for: Np = 250, max_ite = 300, C1 = 1 and C2 = 0.5. Thus, GOA presents better performance than PSO regarding higher convergence for lower population size. Results presented in Figure 6 proves that for the SHE problem the GOA presents a significantly higher probability of convergence than the PSO algorithm. The most interesting result was achieved by using the GOA algorithm for population 40 and 300 iterations (the second-highest for this algorithm) where the probability of convergence was 28%. This result proves that the GOA algorithm can be very efficient for low population set up which reduces its computational effort. The highest recorded probability of convergence of PSO during the experiment was 15% (time of computation 260 s). The GOA algorithm gives a better result faster. The computation effort is extremely significant during the application of the optimization task for the task. In this paper, coefficients of the compared algorithm were selected in such a way to keep comparable computation time. The parameters which are affecting computation time are population size Np and the maximum number of iteration max_ite. Results presented in Figure 6 can be divided into 9 SETS regarding In the following part of this section, the convergence of GOA and PSO has been compared. The various combinations of parameters were tested. For every set of both GOA and PSO, 100 runs were calculated. For each series of runs, the number of runs that reaches f fit below 1 × 10 −4 was recorded as the success. The variation of the following parameters was studied: maximum number of iterations (max_ite), size of the population (Np), PSO parameters C1 and C2, and GOA parameters used in s-function (L and F). Thus, all results have been presented in Figure 6 where the probability of convergence is compared. The value of population size for PSO and GOA was adjusted to keep similar computation times for both.
The best performance of GOA was recorded for settings: Np = 40 max_ite = 300, L = 1.5 and F = 0.5. For the aforementioned setting, GOA achieved 27% convergence (time of computation 101 s). The PSO achieved the best performance for: Np = 250, max_ite = 300, C1 = 1 and C2 = 0.5. Thus, GOA presents better performance than PSO regarding higher convergence for lower population size. Results presented in Figure 6 proves that for the SHE problem the GOA presents a significantly higher probability of convergence than the PSO algorithm. The most interesting result was achieved by using the GOA algorithm for population 40 and 300 iterations (the second-highest for this algorithm) where the probability of convergence was 28%. This result proves that the GOA algorithm can be very efficient for low population set up which reduces its computational effort. The highest recorded probability of convergence of PSO during the experiment was 15% (time of computation 260 s). The GOA algorithm gives a better result faster. The computation effort is extremely significant during the application of the optimization task for the task. In this paper, coefficients of the compared algorithm were selected in such a way to keep comparable computation time. The parameters which are affecting computation time are population size Np and the maximum number of iteration max_ite. Results presented in Figure 6 can be divided into 9 SETS regarding Np and max_ite. Table 2 presents computation time for the PSO and GOA performed on a computer with processor Intel Core i7-8557U. Results from Table 2 are presented in Figure 7. The parameters Np and max_ite were selected to keep similar computation time for GOA and PSO for one SET. The GOA in every iteration calculates the position of every agent (grasshopper) related to every agent in the swarm, PSO calculates the only position of the agent related to the position of the pest particle. That is why GOA needs higher computational effort than PSO for the same Np. Thus, to make it comparable the Np for GOA was reduced in every SET.  70  99  300  40  101  SET 2  300  130  169  300  60  163  SET 3  300  250  260  300  80  261  SET 4  500  70  165  500  40  152  SET 5  500  130  310  500  60  277  SET 6  500  250  470  500  80  438  SET 7  700  70  245  700  40  264  SET 8  700  130  412  700  60  385  SET 9  700  250  637  700  80  687 Energies 2020, 13, x FOR PEER REVIEW 11 of 17 particle. That is why GOA needs higher computational effort than PSO for the same Np. Thus, to make it comparable the Np for GOA was reduced in every SET.  1  300  70  99  300  40  101  SET 2  300  130  169  300  60  163  SET 3  300  250  260  300  80  261  SET 4  500  70  165  500  40  152  SET 5  500  130  310  500  60  277  SET 6  500  250  470  500  80  438  SET 7  700  70  245  700  40  264  SET 8  700  130  412  700  60  385  SET 9  700  250  637  700 80 687

Comparative Study between PSO, GOA, and Modified GOA
In this subsection, the convergence of GOA with modifications and PSO algorithms has been carried out. Assumptions from section V A and Table 3 are valid in this section. However, the comparison has been conducted for a wider range of modulation index M1 = 0.4 ÷ 1.1. The comparative study reveals that the most efficient with the highest probability of convergence is the GOA algorithm modified by adding the OBL module ( Figure 9). The convergence of the studied algorithm was decreasing with an increase of M1 because higher modulation index requires smaller spaces between switching angles and reduce the feasibility of developed solutions. For M1 in the range from 0.7 to 0.8 modification based on NS presented very good performance as well. Figure 10 presents the examination of fitness value (f fit ) as the function of the iteration number. The conclusion is that GOA-based algorithms present significantly faster convergence than PSO.
Energies 2020, 13, x FOR PEER REVIEW 12 of 17 In this subsection, the convergence of GOA with modifications and PSO algorithms has been carried out. Assumptions from section V A and Table 3 are valid in this section. However, the comparison has been conducted for a wider range of modulation index M1=0.4 ÷ 1.1. The comparative study reveals that the most efficient with the highest probability of convergence is the GOA algorithm modified by adding the OBL module ( Figure 9). The convergence of the studied algorithm was decreasing with an increase of M1 because higher modulation index requires smaller spaces between switching angles and reduce the feasibility of developed solutions. For M1 in the range from 0.7 to 0.8 modification based on NS presented very good performance as well. Figure 10 presents the examination of fitness value (ffit) as the function of the iteration number. The conclusion is that GOA-based algorithms present significantly faster convergence than PSO.

Experimental Results
The applied GOA algorithm has been experimentally verified. Switching angles calculated by the GOA algorithm were implemented into the laboratory stand ( Figure 11) developed according to Figure  1. Parameters of the induction motor applied in the laboratory stand are presented in Table 1. The inverter control by switching angles input was provided by DSpace card 1104. Switching angles were applied as the look-up table for off-line control. Verification was conducted for two operating points with the same fundamental frequency ff = 50 Hz, and different M1 = 0.9 and 1.0, respectively. In Figures 12 and 13 it can be noticed that amplitudes of 5th, 7th, 11th, and 13th harmonics in the output voltage have been eliminated and the GOA algorithm has successfully minimized the goal function.
(a) (b) Figure 10. Fitness value versus iteration number for examined algorithms.

Experimental Results
The applied GOA algorithm has been experimentally verified. Switching angles calculated by the GOA algorithm were implemented into the laboratory stand ( Figure 11) developed according to Figure 1. Parameters of the induction motor applied in the laboratory stand are presented in Table 1. The inverter control by switching angles input was provided by DSpace card 1104. Switching angles were applied as the look-up table for off-line control. Verification was conducted for two operating points with the same fundamental frequency f f = 50 Hz, and different M1 = 0.9 and 1.0, respectively.

Experimental Results
The applied GOA algorithm has been experimentally verified. Switching angles calculated by the GOA algorithm were implemented into the laboratory stand ( Figure 11) developed according to Figure  1. Parameters of the induction motor applied in the laboratory stand are presented in Table 1. The inverter control by switching angles input was provided by DSpace card 1104. Switching angles were applied as the look-up table for off-line control. Verification was conducted for two operating points with the same fundamental frequency ff = 50 Hz, and different M1 = 0.9 and 1.0, respectively. In Figures 12 and 13 it can be noticed that amplitudes of 5th, 7th, 11th, and 13th harmonics in the output voltage have been eliminated and the GOA algorithm has successfully minimized the goal function.
In Figures 12 and 13 it can be noticed that amplitudes of 5th, 7th, 11th, and 13th harmonics in the output voltage have been eliminated and the GOA algorithm has successfully minimized the goal function.

Experimental Results
The applied GOA algorithm has been experimentally verified. Switching angles calculated by the GOA algorithm were implemented into the laboratory stand ( Figure 11) developed according to Figure  1. Parameters of the induction motor applied in the laboratory stand are presented in Table 1. The inverter control by switching angles input was provided by DSpace card 1104. Switching angles were applied as the look-up table for off-line control. Verification was conducted for two operating points with the same fundamental frequency ff = 50 Hz, and different M1 = 0.9 and 1.0, respectively. In Figures 12 and 13 it can be noticed that amplitudes of 5th, 7th, 11th, and 13th harmonics in the output voltage have been eliminated and the GOA algorithm has successfully minimized the goal function.

Conclusions
In this paper, the authors investigated a novel application of a recently developed GOA algorithm, for the calculation of switching angles in SHE-PWM inverter modulation. The main goal of this paper was to examine the probability of convergence introduced by GOA applied for solving the SHE problem. Modifications of the GOA algorithm have been implemented and compared with the PSO algorithm. The GOA algorithm is based on the behavior of a swarm of grasshoppers and the most characteristic feature is that the movement of agents depends not only on the position related to the position of the best agent (best global solution) but it depends on the position related to the other agents as well. Thus, the results prove that the GOA algorithm requires a lower population size to converge with computation effort similar to PSO. The most interesting outcome of this study is that the GOA algorithm with OBL elements proves its superiority over the PSO algorithm regarding the probability of convergence for similar computational effort (lower population of particles). The second most efficient combination was the GOA algorithm with NS modification. GOA presents the highest advantage over PSO in the range of modulation index from 0.5 to 1.0. In this range, the convergence of PSO was dramatically reduced (below 5% in the worst case), and meanwhile, the probability of convergence of GOA was between 20 and 80%. The performed measurement experiments proved that the SHE-PWM waveform optimized by the GOA algorithm provided elimination of the chosen harmonics in the inverter's output voltage. In the nearest future, authors will focus their attention on the application of the GOA algorithm for optimization of waveforms generated by multilevel inverters and its applicability in traction drive solutions

Conclusions
In this paper, the authors investigated a novel application of a recently developed GOA algorithm, for the calculation of switching angles in SHE-PWM inverter modulation. The main goal of this paper was to examine the probability of convergence introduced by GOA applied for solving the SHE problem. Modifications of the GOA algorithm have been implemented and compared with the PSO algorithm. The GOA algorithm is based on the behavior of a swarm of grasshoppers and the most characteristic feature is that the movement of agents depends not only on the position related to the position of the best agent (best global solution) but it depends on the position related to the other agents as well. Thus, the results prove that the GOA algorithm requires a lower population size to converge with computation effort similar to PSO. The most interesting outcome of this study is that the GOA algorithm with OBL elements proves its superiority over the PSO algorithm regarding the probability of convergence for similar computational effort (lower population of particles). The second most efficient combination was the GOA algorithm with NS modification. GOA presents the highest advantage over PSO in the range of modulation index from 0.5 to 1.0. In this range, the convergence of PSO was dramatically reduced (below 5% in the worst case), and meanwhile, the probability of convergence of GOA was between 20 and 80%. The performed measurement experiments proved that the SHE-PWM waveform optimized by the GOA algorithm provided elimination of the chosen harmonics in the inverter's output voltage. In the nearest future, authors will focus their attention on the application of the GOA algorithm for optimization of waveforms generated by multilevel inverters and its applicability in traction drive solutions.