Next Article in Journal
Contact Analysis and Friction Prediction of Non-Gaussian Random Surfaces
Previous Article in Journal
Contribution Analysis of Assembled Brake System to Reduce Squealing
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Unified Evolutionary Algorithm Framework for Hybrid Power Converter

School of Electronic and Electrical Engineering, Kyungpook National University, Daegu 41566, Korea
*
Author to whom correspondence should be addressed.
Appl. Sci. 2022, 12(21), 11236; https://doi.org/10.3390/app122111236
Submission received: 8 October 2022 / Revised: 27 October 2022 / Accepted: 30 October 2022 / Published: 5 November 2022

Abstract

:
A significant amount of the literature is focused on converters that supply the required voltage with low input-current ripple to electronic devices. A hybrid converter that combines boost and Cuk converters was developed recently. This hybrid converter achieved a relatively low input-current ripple based on earlier strategies. This paper proposes a new model that simulates a hybrid power converter system using a unified evolutionary algorithm (EA). As part of this paper, we present an improved framework for a hybrid power converter. Moreover, a unified EA is developed to incorporate differential evolution (DE) and genetic algorithm (GA) properties in order to analyze the proposed modified hybrid power converter. This research describes a modified hybrid power converter that optimizes the zero-ripple duty cycle (DZ) through the proposed algorithm for minimizing the input-current ripple. Based on our simulation results, comparing the proposed method with the baseline algorithm reveals that the proposed approach is significantly more efficient than the baseline algorithm and achieves the minimum input-current ripple in different gain values. In addition, we observe that the proposed algorithm performs better than the DE and GA algorithms in terms of obtaining low input-current ripple results. Therefore, the proposed hybrid algorithm is becoming more efficient with hybridization.

1. Introduction

Over the past several years, emphasis has been placed on optimizing advanced electronic systems, which depend on reliable and efficient power supplies. To achieve these objectives, optimization methods are used in the design of power converters [1]. The voltage ratings of the various components in electrical and electronic devices differ. DC–DC converters are electronic circuits that generate the appropriate voltage for a specific element [2]. In general, these are categorized into buck, boost, buck-boost, and Cuk converters. The DC–DC converters are power electronics-based circuits that are capable of varying and regulating the voltage level from input to output. These converters have been used in a wide variety of applications, such as automatic control systems, renewable energy systems [3,4], photovoltaic generation, fuel cell generation, and electric vehicles [2,5] because of their high efficiency, small size, and simple structure.
The converters produce waves with many harmonics. This is an important characteristic. A filter is placed at the output of the converter to reduce these harmonics. It is complex and expensive to filter the output voltage or current of a converter that delivers a square voltage or current by alternation. The pulse-width modulation (PWM) technique has been demonstrated to be the most suitable for a controlled converter. In addition, it effectively neutralizes the output wave [6]. In [6], the authors presented various techniques using controlled PWM. Three PWM strategies with different vertical and horizontal combinations were evaluated in [7]. Thereby, their output harmonics were measured.
Many scholars have recently applied and implemented metaheuristic techniques in the context of complex optimization problems [8,9]. Several metaheuristic algorithms have been developed. These include DE [10], GA [11], and particle swarm optimization (PSO) [12]. These methods are reliable, straightforward, and simple to implement. Consequently, these are among the preferred approaches [13]. Metaheuristics have been applied in several practical applications [14], and some are used in optimizing relevant problems. These include an improved interlaced boost converter [15]. Problems with power converters have been solved using the PSO algorithm [15,16,17]. In [15], an interleaved boost converter (IBC) using an optimal Type-III controller is described. In order to design the controller parameters, the classical “k-factor” strategy was employed, followed by the development of an optimal Type-III controller based on PSO. In the paper [16], the authors introduced an optimization method for a proportional-integral PI controller for four-phase interleaved boost converters. The PSO algorithm was used to find the optimal gains for PI controllers [16]. By using the chaos PSO algorithm, the paper [17] simulated and analyzed a boost converter with maximum power point tracking (MPPT).
In [18], a GA was utilized to perform constrained optimization of a DC–DC converter for uninterruptible power supply applications. In [19], the design of a PID controller for controlling a DC–DC boost converter in PV systems was discussed. Here, three controller parameters were adjusted using the GA. A method that optimizes the duty cycle based on a pre-calculated duty cycle by using the GA for a non-inverting buck-boost converter was proposed in [20]. Furthermore, the duty cycles were estimated using a discrete model. An optimization method for synchronized buck converters using discrete variables was presented in [21]. The DE algorithm was used in [22] to design high-power millimeter-wave mode converters. In [23], a variation in the DE algorithm was developed to determine the switching angles of a programmed pulse-width modulation (PPWM)controlled inverter. In [24], a differential evolution strategy was used to solve the optimal switching angle problem in an harmonic elimination pulse-width modulation (HE-PWM). As described in the paper [25], a hybrid converter was presented that was capable of providing both AC and DC loads with one DC input where a voltage source inverter replaced the control switch of the boost converter. An optimized filter design for a boost converter was created using GA in [26]. By using GA, it was possible to reduce the lower-order harmonics of an inverter considerably. Due to the nonlinear characteristics and time-varying features of power converters, GA was applied to optimize PI parameters [27]. The bee colony optimization algorithm generated duty cycles for the Sheppard–Taylor and interleaved converter in [28,29]. In [30], authors constructed and developed a hybrid converter that was intended for marine applications.
An EA based on pulse-width modulation was proposed in [31] for a hybrid interleaved boost–Cuk converter. This paper introduced the pulse-width-modulation technique and described the formula to analyze the influence of independent duty cycles and an input-current ripple; however, differential evolution was employed to minimize the input-current ripple. The approach proposed therein had certain limitations. First, the zero-ripple duty cycle (DZ) was maintained at a constant. Maintaining DZ at a constant affected the performance because the input-current ripple estimation depended on DZ. Second, the approach used a basic DE algorithm and failed to utilize the new advances proposed in the DE literature. Motivated by these, the main contributions of this paper are listed as follows:
  • Introduce a modified hybrid converter that simultaneously optimizes three variables (duty cycle D, scale factor k, and DZ);
  • A new framework to be designed for the hybrid power converter;
  • We proposed a unified EA to minimize the input-current ripple;
  • A hybrid algorithm that combines DE and GA is suggested to enhance the current model’s performance.
The remainder of this paper is organized as follows: In Section 2, we provide an overview of the existing hybrid power converters, DE, and GA. Section 3 provides further details on the proposed method. The results are presented in Section 4, and the conclusions are presented in Section 5.

2. Background

2.1. Existing Hybrid Power Converters

A wide variety of DC–DC converter topologies have been developed for power electronics over the past few years [32,33]. Interleaved converters, like the interleaved boost converter, have proven successful among the various converters. An important aspect of interleaved converters is that all parallel converters need to have an identical duty cycle or voltage gain. Parallel converters share the same input voltage. Therefore, a severe power imbalance occurs when one converter increases the voltage more than the other. A key feature of interleaved converters is that they have a zero input-current ripple at their operation points. For instance, a double-phase interleaved boost converter exhibits zero input-current ripple. Furthermore, hybrid interleaved converters such as the one described in [34] are being investigated. It is feasible to select a zero input-current ripple for this converter. This enables it to operate in the best operating range. Unlike the conventional interleaving converters with an identical duty cycle for all converters, a hybrid converter [34] employ a PWM strategy to assign a duty cycle to each converter. The duty cycles are dependent. Although hybrid converters may have independent duty cycles, an equal gain in voltage may be obtained by any set of duty cycles. This results in various input ripple currents.
The hybrid converters [24,27] are illustrated in Figure 1a. It is a combination of a Cuk converter and a boost converter. Consequently, their input voltages are identical, and the load is connected differentially from the Cuk output to the boost converter output. Owing to the Cuk converter’s negative output voltage, the voltage gain is more significant when the two boost converters are interleaved. This is because they have independent outputs and may have different duty cycles. The PWM strategy is illustrated in Figure 1b. Meanwhile, Figure 1c shows the current waveform in a duty cycle where the ripple in the input-current is zero.
The mathematical model of the hybrid power converter can be summarized as follows:
V C 1 = V i n 1 1 D 1 ;           I L 1 = I O 1 1 D 1
V C 2 = V i n 1 1 D 2 ;       I L 2 = I O D 2 1 D 2
V C 3 = V i n 1 1 D 2 ;       I L 3 = I O
The duty cycle for each transistor sx is determined by Dx (x = 1, 2). The voltage VCy (y = 1, 2, 3) represents the voltage across each capacitor Cy. The current ILz (z = 1, 2, 3) is equal to every inductor’s current Lz. Io is the output current. A series connection of C1 and C3 yields the output voltage. The output results are expressed as follows, based on the load resistance R:
V o = V i n 1 1 D 1 + V i n D 2 1 D 2 ;       I o = V O R
As part of the PWM strategy of a hybrid converter [31], the duty cycle of the converter is s2, d = d2. Therefore, the duty cycle of s1 (d1) is expressed as a fraction of d multiplied by k, as follows:
d = d2; d1 = kd
The following equation can be obtained by applying similar properties to inductors:
L1 = kL2
k is determined by the duty cycle wherein zero input-current ripples are preferred. The duty cycle is called DZ, in which a mathematical equation is written as the following:
    k = 1 D Z D Z
A detailed description of the PWM strategy is available in [34]. It is generally straightforward. However, it has drawbacks because it loses a degree of freedom when a duty cycle is proportional to another over the entire range of operations. Considering this limitation in [34], a new PWM strategy was proposed in [31]. The duty cycles can be represented as in Equation (8). Here, k is a variable and not a constant. In [31], the best value was selected at each operation point. The study provided a more detailed description of the current PWM strategy used in this research. In addition, the input-current ripple was analyzed under two conditions: D > DZ and D < DZ.

2.1.1. The Case of D > DZ

When D > DZ and the switching functions overlap, the maximum ripple may occur in two periods: (1 − kD) TS and (1 − D) TS. Further information concerning this situation is provided in [31].
The input-current ripple at the time interval (1 − kD) TS is defined by Equation (8):
Δ i g = ( 1 k D ) T S ( V i n L 2 + V i n V C 1 L 1 )
We obtain Equation (9) based on Equations (1) and (5):
Δ i g A = V i n T S L 2 K L ( k L k D k L k D )
The input-current ripple in the time interval (1 − D) TS is derived using Equation (10):
Δ i g = ( 1 k D ) T S ( V i n L 1 + V i n V C 2 L 2 )
The following equation is defined based on Equations (2) and (5):
Δ i g B = V i n T S L 2 K L ( 1 D k L D )

2.1.2. The Case of D < DZ

When D < DZ, the switching functions have a dead time (when both transistors are off). Under such conditions, the maximum ripples can occur at two times: DTS and kDTS [31].
The input-current ripple during the period of the DTS can be calculated using the following formula:
Δ i g = D T S ( V i n L 2 + V i n V C 1 L 1 )
We obtain Equation (13) based on Equations (1) and (5):
Δ i g A 2 = V i n T S L 2 K L D ( 1 K D ) ( k L k D k L k D )
For the period kDTS, the ripple of the input-current can be expressed as Equation (14):
Δ i g = k D T S ( V i n L 1 + V i n V C 2 L 2 )
The following equation can be obtained based on Equations (2) and (5):
Δ i g B 2 = V i n T S L 2 K L k D ( 1 D k L D )
Thus, the algorithm should comply with the gain. This can be expressed by Equation (16):
G = 1 1 K D + D 1 D

2.2. Differential Evolution (DE)

DE is a well-known evolutionary algorithm (EA) which incorporates mutation, crossover or recombination, and selection [10]. The DE algorithm consists of a set of search agents X = { x 1 , x 2 , , x m } . Here, xi represents a potential solution that improves gradually during the evolution. The DE algorithm randomly initializes the population and then, evaluates the fitness function:
Xi(j) = XiL + rand [0, 1]. (XiHXiL)
where XiL is the lower bound and XiH is the upper bound. Xi(j) is selected randomly from the interval [XiL, XiH]. Subsequently, mutation, recombination (crossover), and selection are used to improve individuals in an iterative process. Mutation is used as the search tool. Mutation operations create mutant vectors by adding the weighted difference between two randomly selected vectors to form a third vector. In this study, we applied the DE/current-to-best/1 mutation strategy. It is expressed as follows:
Ocur = Xcur + F(Pbest − Xcur) + F(Xr1 − Xr2)
where Xcur and Ocur indicate the current parent and its corresponding offspring solution, respectively. F denotes the scaling factor, and Xr1 and Xr2 denote the random solutions.
In crossover operations, the parameters of the mutant vector are mixed with those of the target vector to generate a new vector, which is commonly referred to as a trial vector. A trial vector can replace the target vector in the next generation if it is more suitable than the target vector. We used a binomial crossover in this study. It is described as follows:
U j , i , G + 1 = { V j , i , G + 1             i f   a   r a n d C R X j , i , G                           O t h e r w i s e   j   = 1 ,   2 , ,   D ;   i   = 1 , 2 , , Np
where D is the number of genes. CR denotes the crossover factor, which is typically between zero and one.
Selection guides the search for potential regions within the search space. In the selection step, the initial step is a one-to-one competition analysis (local search). The next step is to select the best individual in the population (global search):
X i , G + 1 = a r g max { f ( X i , G ) , f ( U i , G + 1 ) } X b , G + 1 = a r g max { f ( X i , G + 1 ) } i   = 1 ,   2 , , Np .

2.3. Genetic Algorithm (GA)

The GA was developed by John Holland in 1970 and has been demonstrated to be an efficient tool [35]. In contrast to other evolutionary computation techniques, such as PSO, the GA identifies the optimal solution from the solution space. In general, GAs are based on groups of points rather than an individual point. This can be used to solve optimization problems through natural selection and genetics. GAs can handle a population of many individuals to achieve the best solution by using a randomly initialized population. The initial population of the GA is generated at random. This is similar to DE (Equation (17)). After a parent population is generated, mating selection is performed to select better parent individuals to generate offspring. Variation (crossover and mutation) operators are used to produce offspring solutions. Subsequently, the parent and offspring populations are combined. The selection mechanism is then performed based on the objective function. The combined population is sorted according to the optimization criteria of the objective function, and better N solutions are preserved for the next generation. This process is repeated until the termination condition is satisfied.

3. Proposed Methodology

This section briefly describes the proposed model and its key components. First, we describe the modified model for a hybrid power converter. Then, we describe the proposed unified EA to solve the modified model.

3.1. Modified Hybrid Power Converter

The hybrid power converter approach proposed in [31] aims to minimize input-current ripple. However, they considered two optimization parameters (D and k) for the power converter model. The power converter model proposed in [31] considers two periods. Considering these periods, the input-current ripple may attain a maximum value. Therefore, it is necessary to formulate the objective function in order to minimize the maximum value of the input-current ripple. If D > DZ [31], this procedure minimizes a maximum ripple in the input-current. Similarly, the largest input-current ripple is minimized when D < DZ [31]. Furthermore, they considered several restrictions, including achieving the desired voltage gain; evaluating the switch time, and searching the domain, which includes valid values for D and k. However, the objective-function estimation is highly sensitive to DZ. Hence, in our proposed model, we aim to optimize three variables (D, k, and DZ) simultaneously and analyze its performance. The range of the three variables is between 0 and 1, according to the below equations. The modified hybrid power converter can be expressed as:
min D , k , D z R f ( D , k , D z ) = { f 1 ( D , k , D z ) ,           D > D z f 2 ( D , k , D z ) ,   o t h e r w i s e
Subject to;
G 1 1 k D + D 1 D G + t
0 ≤ D ≤ 1
0 ≤ k ≤ 1
0 ≤ DZ ≤ 1
Thus, f1(D, k, DZ) and f2(D, k, DZ) are formulated as follows:
f 1 ( D , k , D z ) = [ | Δ i g A 1 | ,   | Δ i g A 1 | > | Δ i g B 1 | | Δ i g B 1 | ,               O t h e r w i s e .
f 2 ( D , k , D z ) = [ | Δ i g A 2 | ,   | Δ i g A 2 | > | Δ i g B 2 | | Δ i g B 2 | ,                       O t h e r w i s e .
DZ was maintained at a constant of 0.6 in [31]. It plays a significant role in the calculation of the objective functions. Consequently, its optimization would yield better results. The effectiveness of optimizing DZ is verified in the simulation section.

3.2. Unified Evolutionary Algorithm

In this study, we combined the advantages of two popular EAs: DE and GA. Herein, DE operators are used to produce the offspring population, which helps in its exploitation. Then, a GA selection mechanism is used to preserve elite individuals. First, an initial population of size N is generated randomly according to Equation (17). Unlike in the previous approaches, three variables are considered in the proposed approach [31]. Therefore, an individual Xi is defined as:
Xi = {D, k, DZ}
The candidate solutions are evaluated based on the Xi in the objective function presented in Equation (21). Thus, Equation (21) can be expressed as:
min X i R f ( X i ) = { f 1 ( D , k , D z ) ,           D > D z f 2 ( D , k , D z ) ,   o t h e r w i s e
The proposed model involves a constrained optimization problem. Therefore, it is necessary to apply a penalty function to assess the population in the objective function. Feasible solutions can be determined through the penalty function. The penalty function for the power converter is formulated as follows:
h = | w c ( G 1 1 X i 1 X i 2 X i 1 1 X i 1 ) |
A constant factor w is used to determine the degree to which a candidate’s fitness value is penalized. c represents the violated constraint indicator, with c ϵ {0, 1}. Meanwhile, Xi1 = D, and Xi2 = k. Equation (29) can be revised as follows based on the penalty function for evaluating the population:
min X i R f ( X i ) +   h
After evaluation, the offspring are generated using the DE mutation “DE/current-to-best/1”. The “DE/current-to-best/1” to generate trail vector is performed as described in Equation (18). After the trial vector is generated, the offspring solution is produced using a binomial crossover. Binomial crossover is performed according to Equation (19). Next, the offspring and parent populations are combined. The combined population is then sorted according to the optimization criteria of the objective function (i.e., the input-current ripple was minimized in this study). Hence, the combined population is sorted in the ascending order of the objective function. Then, N solutions in the sorting order are preserved for the next generations. Figure 2 presents a schematic of the general framework of the proposed method.

4. Simulation Setup and Results

This section describes the parameter settings for the algorithms being compared and the hybrid power converter. We conducted several experiments to evaluate the performance of our proposed method. It was compared with the baseline method [31], DE and GA algorithms. We considered various desired voltage gains as part of the evaluation to demonstrate the efficiency of our approach. Simulations were performed on a PC with an Intel Core i5-10400 CPU processor operating at 2.90 GHz and a 64-bit version of Windows 10 with MATLAB 2021b. In the experiments, the gain value G was varied from 3 to 6 at intervals of 0.1.

4.1. Comparison between the Proposed Method and Baseline Algorithm

The approach proposed in [31] was selected as the baseline algorithm to validate the performance of the proposed algorithm. The control parameters for the baseline algorithm were set as follows: the mutation scaling factor F was selected from a uniform distribution between 0.2 and 0.8; the crossover rate was set as 0.2 and w was maintained as 10, as recommended in [31]. F, CR, and w were set as 0.3, 0.75, and 10, respectively, for the proposed method. The population size and the number of generations were set as 20 and 50, respectively. Because the EA is a stochastic algorithm, these results are based on the average value collected from 30 independent executions. Moreover, Table 1 provides the relevant parameters for the hybrid power converter.
The mean values of the input-current ripple obtained over 30 independent runs are presented in Table 2. In addition, we have provided the hybrid power converter parameters D, k, and DZ. It is evident from the results presented in this table that the proposed method achieved a lower input–current ripple value in all the cases. It achieved a significant improvement in the input-current ripple value as G increased. Table 2 reveals that the optimization of DZ simultaneously optimized both D and k. The simulation results of the proposed method are better than those of the baseline algorithm because of the optimization of DZ. The baseline algorithm maintained DZ at a constant of 0.6. The proposed method performed better for each gain instance at different values of DZ. For example, the proposed method optimized DZ to 0.7998 for a gain of 3.1 and 0.9519 for a gain of 4. Thus, the optimization of DZ improved the performance of the model. In the summary of Table 2, the proposed hybrid algorithm (combines DE and GA) method performed better than a baseline (basic DE) model. Therefore, due to hybridization, the proposed method minimizes input-current ripple better than the baseline method, demonstrating its efficiency. In particular, as the G value increases, the efficiency of the proposed method increases significantly because it incorporates the properties of DE and GA.
Furthermore, we compared the baseline and proposed methods as shown in Figure 3 to demonstrate the effectiveness of the proposed method. Figure 3a shows the input-current ripple values of the compared algorithms. It indicates that the proposed technique can attain smaller input-current ripple values over its operating area. Moreover, in most cases, the models differ significantly, except in one case, which demonstrates an almost similar performance (gain = 3).
Figure 3b illustrates the percentage improvement of the proposed method compared with the baseline algorithm. It is evident from Figure 3b that the proposed method achieved an improvement of almost 50% in most cases. The performance of the proposed algorithm improved by almost 100% for a gain of 3.166.
In Figure 4, the proposed method is evaluated using a convergence graph that illustrates its speed performance. We consider ten operation points in the test to estimate the speed with which the optimization algorithm attains the optimal value. Figure 4 exhibits the input-current ripple obtained at each generation for gain values of 3.4, 3.6, 3.8, 4, 4.3, 4.7, 5, 5.3, 5.7, and 6 for the baseline and proposed methods. The gain values were selected based on the most significant and relevant points. It is evident from Figure 4 that the proposed method performed significantly better than the baseline method. In addition, it exhibited a speed performance higher than that of the previous method.

4.2. Further Analysis on the Proposed Method

In this section, we analyze the performance of the proposed unified EA with differential evolution [10] (DE and DE*) and the genetic algorithm [35] to demonstrate its superiority. We have presented the obtained input-current ripple (Δig) for the proposed hybrid approach, DE, DE*, and GA, in Table 3. As shown in Table 3, DE represents the original differential algorithm with the “DE/rand/bin” and binomial crossover. As mentioned earlier, in the proposed unified EA, the “DE/current-to-best/1” and binomial crossover are employed. For better analysis, we have included DE* in the simulation setup that replaces the “DE/rand/bin” mutation with the “DE/current-to-best/1” mutation. For a fair comparison, the crossover rate (CR) and mutation scaling factor (F) are maintained identically for DE, DE*, and unified EA as CR = 0.75 and F = 0.3. The GA employs a real-encoding crossover and a polynomial mutation. The mutation factor F is chosen from real random numbers as uniformly distributed between 0 and 1, and CR ∈ [0, 1], in GA. We set the population size and number of generations to 20 and 50, respectively.
As shown in Table 3, the mean values of the input-current ripple over 30 runs are given. Based on the results in Table 3, the proposed method resulted in lower input–current ripple values than DE, DE*, and GA in all cases. The proposed method has better simulation results than DE, DE*, and GA algorithms because our proposed hybrid algorithm incorporates the properties of DE and GA. Additionally, the efficiency of the proposed hybrid algorithm is increasing with hybridization. The hybridization of the proposed method can potentially improve the current model’s performance and minimizes input-current ripple. To conclude, a hybrid algorithm can improve the method’s performance (convergence speed) and the quality of the solutions.

5. Conclusions

In this study, we developed a hybrid power converter model based on a unified EA. Three power converter variables were optimized simultaneously to increase the efficiency of the model. Furthermore, we proposed a unified EA that integrated the properties of DE and genetic GA to evaluate the modified hybrid power converter. This study employed the unified EA to optimize the zero-ripple duty cycle (DZ) in order to minimize the input-current ripple. Based on the simulation results obtained in this study, the proposed method achieved a lower input-current ripple value across the operating range when compared to the baseline method. By analyzing the percentage improvement results that were found, the proposed method improved the majority of cases by nearly 50%. In addition, the proposed algorithm was compared with DE and GA, and the simulation results indicated that the proposed algorithm obtained a low input-current ripple when compared to those with different gain values. Due to this, the efficiency of the proposed method and the hybridization of the current model was proven. Consequently, the proposed algorithm outperformed the baseline technique, DE, and the GA algorithms. In addition, it performed better than the baseline algorithm in terms of speed.
In the future, we intend to optimize other parameters of the power converter (such as the indicator factor, switching frequency, and output resistance) to enhance the performance. Additionally, we would like to apply the hybrid algorithm to other hybrid power converters.

Author Contributions

Conceptualization, S.G. and S.H.; methodology, S.G. and S.H.; software, S.G.; validation, S.G.; formal analysis, S.G., M.S., J.-J.P., M.K. and Y.J.; investigation, S.G., M.S., J.-J.P. and Y.J.; resources, S.G.; data curation, S.G., J.-J.P. and M.K.; writing—original draft preparation, S.G., M.S. and Y.J.; writing—review and editing, S.G.; visualization, S.G. and M.K.; supervision, S.H.; project administration, S.H.; funding acquisition, S.H. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Korea Institute of Energy Technology Evaluation and Planning (KETEP) and the Ministry of Trade, Industry & Energy (MOTIE) of the Republic of Korea (No. 20202010600010).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable, the study does not report any data.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Rahal-Arabi, T.; Park, H.-J.; Hahn, J. Power delivery for the next generation mobile platform. In Proceedings of the 2008 Electrical Design of Advanced Packaging and Systems Symposium, Seoul, Korea, 10–12 December 2008. [Google Scholar]
  2. Williams, B.W. Unified Synthesis of Tapped-Inductor DC-to-DC Converters. IEEE Trans. Power Electron. 2013, 29, 5370–5383. [Google Scholar] [CrossRef]
  3. Pavlovic, T.; Bjazic, T.; Ban, Z. Simplified Averaged Models of DC–DC Power Converters Suitable for Controller Design and Microgrid Simulation. IEEE Trans. Power Electron. 2012, 28, 3266–3275. [Google Scholar] [CrossRef]
  4. Hegazy, O.; Van Mierlo, J.; Lataire, P. Analysis, Modeling, and Implementation of a Multidevice Interleaved DC/DC Converter for Fuel Cell Hybrid Electric Vehicles. IEEE Trans. Power Electron. 2012, 27, 4445–4458. [Google Scholar] [CrossRef]
  5. Rosas-Caro, J.C.; Ramirez, J.M.; Peng, F.Z.; Valderrabano, A. A DC–DC multilevel boost converter. IET Power Electron. 2010, 3, 129–137. [Google Scholar] [CrossRef]
  6. Berrezzek, F. A study of new techniques of controlled PWM inverters. Eur. J. Sci. Res. 2009, 32, 77–87. [Google Scholar]
  7. Carrara, G.; Gardella, S.; Marchesoni, M.; Salutari, R.; Sciutto, G. A new multilevel PWM method: A theoretical analysis. IEEE Trans. Power Electron. 1992, 7, 497–505. [Google Scholar] [CrossRef]
  8. Palakonda, V.; Awad, N.H.; Mallipeddi, R.; Ali, M.; Veluvolu, K.C.; Suganthan, P.N. Differential evolution with stochastic selection for uncertain environments: A smart grid application. In Proceedings of the 2018 IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, Brazil, 8–13 July 2018. [Google Scholar] [CrossRef]
  9. Ramlan, F.W.; Palakonda, V.; Mallipeddi, R. Differential Evolutionary (DE) Based Interactive Recoloring Based on YUV Based Edge Detection for Interior Design. In Proceedings of the 2019 International Conference on Information and Communication Technology Convergence (ICTC), Jeju, Korea, 16–18 October 2019. [Google Scholar] [CrossRef]
  10. Storn, R.; Price, K. Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997, 11, 341–359. [Google Scholar] [CrossRef]
  11. Holland, J.H. Adaptation in Natural and Artificial Systems, 1st ed.; University of Michigan Press: Ann Arbor, MI, USA, 1975. [Google Scholar]
  12. Eberhart, R.; Kennedy, J. A new optimizer using particle swarm theory. In Proceedings of the MHS’95, Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 4–6 October 1995. [Google Scholar]
  13. Ghorbanpour, S.; Pamulapati, T.; Mallipeddi, R. Swarm and evolutionary algorithms for energy disaggregation: Challenges and prospects. Int. J. Bio-Inspired Comput. 2021, 17, 215–226. [Google Scholar] [CrossRef]
  14. Ghorbanpour, S.; Pamulapati, T.; Mallipeddi, R.; Lee, M. Energy disaggregation considering least square error and temporal sparsity: A multi-objective evolutionary approach. Swarm Evol. Comput. 2021, 64, 100909. [Google Scholar] [CrossRef]
  15. Banerjee, S.; Ghosh, A.; Rana, N. An Improved Interleaved Boost Converter With PSO-Based Optimal Type-III Controller. IEEE J. Emerg. Sel. Top. Power Electron. 2016, 5, 323–337. [Google Scholar] [CrossRef]
  16. Laoprom, I.; Tunyasrirut, S. Design of PI Controller for Voltage Controller of Four-Phase Interleaved Boost Converter Using Particle Swarm Optimization. J. Control Sci. Eng. 2020, 2020, 9515160. [Google Scholar] [CrossRef] [Green Version]
  17. Suganya, R.; Rajkumar, M.V.; Pushparani, P. Simulation and Analysis of Boost Converter with MPPT for PV System using Chaos PSO Algorithm. Int. J. Emerg. Technol. Eng. Res. 2017, 5, 97–105. [Google Scholar]
  18. Chew, C.-K.; Kondapalli, S.R.R. Modeling, Analysis, Simulation and Design Optimization (Genetic Algorithm) of dc-dc Converter for Uninterruptible Power Supply Applications. In Proceedings of the 2005 International Conference on Power Electronics and Drives Systems, Kuala Lumpur, Malaysia, 28 November–1 December 2005. [Google Scholar]
  19. Badis, A.; Mansouri, M.N.; Boujmil, M.H. A genetic algorithm optimized MPPT controller for a PV system with DC-DC boost converter. In Proceedings of the 2017 International Conference on Engineering & MIS (ICEMIS), Monastir, Tunisia, 8–10 May 2017. [Google Scholar]
  20. Ortatepe, Z.; Karaarslan, A. Pre-calculated duty cycle optimization method based on genetic algorithm implemented in DSP for a non-inverting buck-boost converter. J. Power Electron. 2019, 20, 34–42. [Google Scholar] [CrossRef]
  21. Chang, W.; Wang, J.; Chen, Q. Multi-objective optimization of synchronous buck converter based on NSGA-U algorithm. In Proceedings of the 2016 IEEE International Conference on Mechatronics and Automation, Harbin, China, 7–10 August 2016. [Google Scholar]
  22. Yang, S.; Qing, A. Design of high-power millimeter-wave TM/sub 01/-TE/sub 11/mode converters by the differential evolution algorithm. IEEE Trans. Plasma Sci. 2005, 33, 1372–1376. [Google Scholar] [CrossRef]
  23. Yahia, H.; Liouane, N.; Dhifaoui, R. Weighted differential evolution based PWM optimization for single phase voltage source inverter. Int. Rev. Electr. Eng. 2010, 9, 125–130. [Google Scholar]
  24. Rashid, M.I.M.; Hiendro, A.; Anwari, M. Optimal HE-PWM inverter switching patterns using differential evolution algorithm. In Proceedings of the 2012 IEEE International Conference on Power and Energy (PECon), Kota Kinabalu, Malaysia, 2–5 December 2012. [Google Scholar]
  25. Raghavendran, P.; Surendar, V. Design and Implementation of Hybrid Converter for PV System for Both AC and DC Load. In Proceedings of the 2019 International Conference on Recent Advances in Energy-efficient Computing and Communication (ICRAECC), Nagercoil, India, 7–8 March 2019. [Google Scholar]
  26. Prabakar, K.; Li, F. Application of genetic algorithm for the improved performance of boost converters. IFAC Proc. Vol. 2012, 45, 85–90. [Google Scholar] [CrossRef]
  27. Achiammal, B.; Kayalvizhi, D. Optimal tuning of PI controller using genetic algorithm for power electronic converter. Int. J. Eng. Res. 2013, 2, 6. [Google Scholar]
  28. Karaarslan, A. The Implementation of Bee Colony Optimization Algorithm to Sheppard–Taylor PFC Converter. IEEE Trans. Ind. Electron. 2012, 60, 3711–3719. [Google Scholar] [CrossRef]
  29. Karaarslan, A. The implementation of bee colony optimization control method for interleaved converter. Electr. Eng. 2015, 98, 109–119. [Google Scholar] [CrossRef]
  30. Sasilatha, T.; Lakshmi, D.; Rajasree, R. Design and Development of Hybrid Converter for Marine Applications. Eur. J. Med. Nat. Sci. 2022, 5, 1–8. [Google Scholar] [CrossRef]
  31. Rodríguez, A.; Alejo-Reyes, A.; Cuevas, E.; Beltran-Carbajal, F.; Rosas-Caro, J.C. An Evolutionary Algorithm-Based PWM Strategy for a Hybrid Power Converter. Mathematics 2020, 8, 1247. [Google Scholar] [CrossRef]
  32. Wang, C. Investigation on Interleaved Boost Converters and Applications. Ph.D. Thesis, Virginia Tech, Blacksburg, VA, USA, 2009. [Google Scholar]
  33. Jang, Y.; Jovanovic, M.M. Interleaved Boost Converter With Intrinsic Voltage-Doubler Characteristic for Universal-Line PFC Front End. IEEE Trans. Power Electron. 2007, 22, 1394–1401. [Google Scholar] [CrossRef]
  34. Pedro, A.-A.J.; Cesar, R.-C.J.; Francisco, B.-C.; Antonio, V.-G.; Eduardo, H.-S.; Salvador, G.-A.; Avelina, A.-R.; Martin, G.-V.P. Power quality improvement by interleaving unequal switching converters. IEICE Electron. Express 2016, 13, 20160558. [Google Scholar] [CrossRef]
  35. Holland, J.H. Genetic algorithms: Computer programs that “evolve” in ways that resemble natural selection can solve complex problems even their creators do not fully understand. Sci. Am. 2005, 267, 1992. [Google Scholar]
Figure 1. Hybrid power converter proposed in [31]. (a) Structure, (b) PWM strategy, and (c) Waveforms of the input current ripple.
Figure 1. Hybrid power converter proposed in [31]. (a) Structure, (b) PWM strategy, and (c) Waveforms of the input current ripple.
Applsci 12 11236 g001aApplsci 12 11236 g001b
Figure 2. General framework of proposed method.
Figure 2. General framework of proposed method.
Applsci 12 11236 g002
Figure 3. (a) Comparison between proposed method and baseline algorithm based on input-current ripple, (b) Percentage improvement of proposed method compared with baseline algorithm.
Figure 3. (a) Comparison between proposed method and baseline algorithm based on input-current ripple, (b) Percentage improvement of proposed method compared with baseline algorithm.
Applsci 12 11236 g003
Figure 4. Convergence graphs of proposed (red) and baseline (blue) methods with different gain values. (a) G = 3.4, (b) G = 3.6, (c) G = 3.8, (d) G = 4, (e) G = 4.3, (f) G = 4.7, (g) G = 5, (h) G = 5.3, (I) G = 5.7, and (j) G = 6.
Figure 4. Convergence graphs of proposed (red) and baseline (blue) methods with different gain values. (a) G = 3.4, (b) G = 3.6, (c) G = 3.8, (d) G = 4, (e) G = 4.3, (f) G = 4.7, (g) G = 5, (h) G = 5.3, (I) G = 5.7, and (j) G = 6.
Applsci 12 11236 g004aApplsci 12 11236 g004b
Table 1. Parameters for simulation setting.
Table 1. Parameters for simulation setting.
Input Voltage Vin20 V
Inductor Factor kL0.6666
Switching Frequency fS50 kHz
Output Resistance R60 Ω
L166 µH
L2100 µH
Table 2. Comparison of proposed method with baseline algorithm.
Table 2. Comparison of proposed method with baseline algorithm.
GainMethodologyInput-Current Ripple (Δig)DkDZ
3Proposed0.07580.58070.67510.9999
Baseline0.08440.58060.67530.6
3.1Proposed0.02030.59510.66880.7998
Baseline0.05200.59500.66890.6
3.166Proposed1.32 × 10−50.60000.66660.7888
Baseline0.01050.60000.66670.6
3.2Proposed0.01800.60450.66460.9999
Baseline0.05080.60370.66850.6
3.3Proposed0.07100.61750.65880.7010
Baseline0.15270.61440.67440.6
3.4Proposed0.12650.62980.65330.8508
Baseline0.25480.62450.67940.6
3.5Proposed0.17210.64140.64800.9180
Baseline0.35620.63420.68470.6
3.6Proposed0.22710.65240.64300.8303
Baseline0.45040.64350.68860.6
3.7Proposed0.26620.66290.63830.9999
Baseline0.53390.65240.69230.6
3.8Proposed0.32040.67280.63380.9334
Baseline0.62550.66070.69710.6
3.9Proposed0.35330.68230.62950.9759
Baseline0.70450.66870.70070.6
4Proposed0.39440.70810.51490.9519
Baseline0.78730.67680.70310.6
4.1Proposed0.42340.71690.50540.8247
Baseline0.86460.68400.70670.6
4.2Proposed0.46570.72500.49680.9966
Baseline0.94160.69120.71010.6
4.3Proposed0.47580.73270.48900.9602
Baseline1.01160.69800.71300.6
4.4Proposed0.53540.74000.48190.9141
Baseline1.06350.70450.71560.6
4.5Proposed0.54070.74680.47530.8284
Baseline1.15190.71080.71850.6
4.6Proposed0.54180.75330.46930.8076
Baseline1.19470.71690.72050.6
4.7Proposed0.56130.75940.46360.8536
Baseline1.25260.72290.72180.6
4.8Proposed0.57970.76520.45840.9999
Baseline1.31810.72850.72530.6
4.9Proposed0.62170.77080.45360.9999
Baseline1.3640.73390.72730.6
5Proposed0.66520.77600.44900.9999
Baseline1.44820.73920.72810.6
5.1Proposed0.71020.78110.44480.9999
Baseline1.47020.74440.72960.6
5.2Proposed0.78480.78590.44080.9999
Baseline1.53160.74920.73310.6
5.3Proposed0.71660.79040.43710.9999
Baseline1.58120.75410.73290.6
5.4Proposed0.67140.79480.43360.9999
Baseline1.61320.75870.73420.6
5.5Proposed0.74720.79900.43030.9999
Baseline1.65850.76280.73760.6
5.6Proposed0.76140.80310.42710.9426
Baseline1.70350.76730.73800.6
5.7Proposed0.77510.80690.42410.9999
Baseline1.75470.77160.74030.6
5.8Proposed0.82270.81070.42130.9999
Baseline1.7780.77520.74160.6
5.9Proposed0.83620.81420.41860.9995
Baseline1.83440.77930.74190.6
6Proposed0.84930.81770.41610.9999
Baseline1.87210.78310.74420.6
Table 3. Comparison of proposed method with DE and GA algorithms.
Table 3. Comparison of proposed method with DE and GA algorithms.
GainInput-Current Ripple (Δig)
ProposedDEDE*GA
30.07580.09030.80000.2745
3.10.02030.03680.03380.2478
3.1661.32 × 10−50.00980.00310.2214
3.20.01800.03030.02130.1413
3.30.07100.08110.08920.3102
3.40.12650.13690.13530.4496
3.50.17210.19200.18570.4079
3.60.22710.23040.23480.4199
3.70.26620.29060.27740.5628
3.80.32040.33180.33450.5955
3.90.35330.36540.36990.7023
40.39440.41570.41700.6418
4.10.42340.44610.44750.6955
4.20.46570.47510.47560.8467
4.30.47580.50400.49210.9972
4.40.53540.54850.55571.0329
4.50.54070.58010.55921.0595
4.60.54180.66220.56981.0270
4.70.56130.59250.57951.2939
4.80.57970.65350.59101.0793
4.90.62170.70500.64501.2583
50.66520.68430.67921.3074
5.10.71020.74310.74411.3449
5.20.78480.79320.79361.3159
5.30.71660.75790.72141.3645
5.40.67140.85280.69491.3718
5.50.74720.78640.76451.5165
5.60.76140.90560.78061.5898
5.70.77510.79660.78881.4792
5.80.82270.84910.84991.7313
5.90.83620.90110.86521.6052
60.84930.95140.87831.4860
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ghorbanpour, S.; Seo, M.; Park, J.-J.; Kim, M.; Jin, Y.; Han, S. Unified Evolutionary Algorithm Framework for Hybrid Power Converter. Appl. Sci. 2022, 12, 11236. https://doi.org/10.3390/app122111236

AMA Style

Ghorbanpour S, Seo M, Park J-J, Kim M, Jin Y, Han S. Unified Evolutionary Algorithm Framework for Hybrid Power Converter. Applied Sciences. 2022; 12(21):11236. https://doi.org/10.3390/app122111236

Chicago/Turabian Style

Ghorbanpour, Samira, Mingyu Seo, Jeong-Ju Park, Musu Kim, Yuwei Jin, and Sekyung Han. 2022. "Unified Evolutionary Algorithm Framework for Hybrid Power Converter" Applied Sciences 12, no. 21: 11236. https://doi.org/10.3390/app122111236

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