A New Hybridization Approach between the Fireworks Algorithm and Grey Wolf Optimizer Algorithm

Barraza, Juan; Rodríguez, Luis; Castillo, Oscar; Melin, Patricia; Valdez, Fevrier

doi:https://doi.org/10.1155/2018/6495362

Journal of Optimization

On this page

Abstract Introduction Discussion Conclusions Conflicts of Interest References Copyright Related Articles

Research Article | Open Access

Volume 2018 | Article ID 6495362 | https://doi.org/10.1155/2018/6495362

A New Hybridization Approach between the Fireworks Algorithm and Grey Wolf Optimizer Algorithm

Juan Barraza,¹Luis Rodríguez,¹Oscar Castillo,¹Patricia Melin,¹and Fevrier Valdez¹

Academic Editor: S. Mehdi Vahidipour

Received30 Jan 2018

Accepted03 Apr 2018

Published27 May 2018

Abstract

The main aim of this paper is to present a new hybridization approach for combining two powerful metaheuristics, one inspired by physics and the other one based on bioinspired phenomena. The first metaheuristic is based on physics laws and imitates the explosion of the fireworks and is called Fireworks Algorithm; the second metaheuristic is based on the behavior of the grey wolf and belongs to swarm intelligence methods, and this method is called the Grey Wolf Optimizer algorithm. For this work we studied and analyzed the advantages of the two methods and we propose to enhance the weakness of both methods, respectively, with the goal of obtaining a new hybridization between the Fireworks Algorithm (FWA) and the Grey Wolf Optimizer (GWO), which is denoted as FWA-GWO, and that is presented in more detail in this work. In addition, we are presenting simulation results on a set of problems that were tested in this paper with three different metaheuristics (FWA, GWO, and FWA-GWO) and these problems form a set of 22 benchmark functions in total. Finally, a statistical study with the goal of comparing the three different algorithms through a hypothesis test (-test) is presented for supporting the conclusions of this work.

1. Introduction

In recent years, the global world of computer science is creating an interesting environment [1] for research, especially, with algorithms that aim at solving different optimization problems [2], which means maximizing or minimizing depending on the goal and the requirements of the particular problem [3].

At present time, a family of recent algorithms having great impact is the so-called bioinspired algorithms [4]; the reason is because they offer an interesting way of simulating the combination among the natural phenomena, mathematics, and computation. Combination is a key word among these algorithms; for example, in genetic algorithms [5], a combination is performed with two operators, such as crossover and mutation.

Keeping on with the combination concept, another related concept is hybridization [6], and we can understand, for hybridization, processes in which discrete structures, which can exist separately, are combined to generate new structures, objects, and methods.

In recent works, it has been demonstrated that the hybridization of bioinspired algorithms has yielded very good results, and in this regard the main contribution in this work is the proposed hybridization between the Fireworks Algorithm (FWA) [7] and the Grey Wolf Optimizer (GWO) [8] taking advantage of their best features and combining them for obtaining a better overall performance for solving problems, in a new hybrid algorithm. The above-mentioned hybridization is described and explained in more detail in the following sections of this paper.

The remainder of the paper is organized as follows: we start with basic concepts in Section 2, which is organized in two parts, FWA in the first part and GWO in the second part. In Section 3, we present the proposed FWA-GWO method, then the simulation results are presented in Section 4, and finally, we conclude the paper, by mentioning possible future work in Section 5.

2. Basic Concepts

In this section, the basic concepts about FWA and GWO are presented to provide the reader with a background for understanding the proposed hybrid approach (FWA-GWO).

2.1. Fireworks Algorithm (FWA)

The FWA is a metaheuristic method based on the explosion of fireworks behavior [9]. Every firework performs an explosion process generating a number of sparks, which are placed on a local space around the corresponding firework to represent possible solutions in a search space [10, 11].

2.1.1. Number of Sparks

Equations (1) are used to calculate the number of sparks [12, 13].

2.1.2. Explosion Amplitude

The explosion amplitude [14] is calculated for each firework by the following equation:

2.1.3. Generating Sparks

Random dimensions are calculated with the following equation knowing that when a firework explodes, its sparks will take different random directions.

2.1.4. Selection of Locations

After the explosion of the fireworks, to maintain the diversity of the sparks, places are selected with respect to the location of the others. To calculate the distance among and the other places, the following equations are used:

Figure 1 shows the general flowchart of the FWA, where the original author of the method [7] described each equation that was presented above and that we can find in more detail in the original paper [11] and other variants presented in [15–17].

2.2. Grey Wolf Optimizer

The Grey Wolf Optimizer (GWO) algorithm [18] is a metaheuristic created by Seyedali Mirjalili in 2014. In this algorithm the author takes advantage of the main features that the grey wolf has in nature based on the research of Muro et al. [19] about hunting strategies of the Canis lupus or grey wolf. When the original author designed the algorithm, the following features were highlighted: the hierarchy into the pack [20] and the hunting mechanism.

Basically, the optimization process is guided by the three best solutions in the pack or in all the population, so in order to recognize these better solutions, we assume that the best solution is called the alpha wolf, then the second and third best solutions in the optimization are called beta and delta wolves, respectively, and finally the rest of the candidate solutions are called omega wolves.

In addition it is important to mention that the hunting mechanism behavior of the grey wolf and its main phases are described as follows: first, pursue and approach the prey, after that encircle and harass the prey until it stops moving, and finally attack the prey. In the algorithm this behavior is simulated byIn this case, (6) represents a distance between the best solution and a random motion that is represented in (9) and is a random value in a range minus the solution that we have evaluated ().

The next position of the current solution is presented in (7) that is a subtraction of the best solution and the distance that we have obtained in (6) multiplied by a weight (), which is assigned to this distance and this is described in and coefficients represent the ways for the exploration and exploitation in the algorithm to occur [21], both in direct and in indirect ways, and we can find extensive information of these coefficients in the original paper, where the method was originally proposed [22].

Equations (10) and (11) are the same as (6) and (7), respectively, but in this case the best solution is represented by the leaders of the pack and in this case alpha, beta, and delta, as we mentioned above.Finally, in (12) we can find the next position of the solution that we are evaluating, which is basically an average based on the three best wolves in the pack, so in these equations that we described above we can find the main inspiration for the GWO algorithm, which is the hierarchical pyramid of leadership and the hunting mechanism. In Figure 2 we can find the flow chart of the algorithm.

3. Proposed FWA-GWO

The main goal of the hybridization between both methods [6] is to take advantage of their main features and in this paper we present the following features of each method that we are using for achieving hybridization: FWA:(i)Initialization(ii)Explosion amplitude(iii)Locations GWO:(i)Hierarchical pyramid(ii)Interaction among the population(iii)Next location of population

Figure 3 shows a general flow chart of the proposed hybridization between the FWA and GWO algorithms and the red blocks represent the considered features of the FWA and the blue blocks the GWO features that are used in the proposed hybrid approach.

In order to explain the performance of the FWA-GWO, we are presenting below the details of each block in the flowchart that we illustrated in Figure 3.

3.1. Select Initial Packs and Wolves

We start to select a number of locations as in the FWA, but in this case we are representing the number of the packs in the population. In addition we need to select the number of wolves for each pack represented by . It is important to mention that the conventional FWA works with a number of function evaluations and the GWO works with the iterations as stopping criteria, so in (13) we show the relation between both types of stopping criteria.where is the total number of iterations; is the number of function evaluations; is the number of packs; and is the number of wolves for each pack.

For example if we have 4 packs and 6 wolves for each pack, we have 24 possible solutions for each iteration in the algorithm; therefore, for 15,000 function evaluations the FWA-GWO algorithm will execute 625 iterations [23].

3.2. Set Initial Packs with Wolves for the Search Space

We add a way to select initial locations in this algorithm, which means that, depending on the number of packs, the corresponding number of partitions is found. For example, if we have a search space with a lower bound and upper bound defined in a range ,where TS is a total search space and ub and lb represent the upper and lower bounds, respectively.

We need subspaces where each pack performs the initialization of its subpopulation and this behavior is represented inSS is the distance that should exist between each range for each pack. These ranges for each pack are calculated with a general linear function, as shown as follows:where , is the number of packs, and is a calculated constant value. In this case, of the search space, such that the search ranges for each pack are [], []⋯[]. We can represent this as follows: .

In Figure 4, we can find an example of this initialization method with 4 packs and a search space in a range of of [, 100] with 2 dimensions.

An advantage of this algorithm is the initialization of the population in subspaces of the search space; FWA-GWO partitions the search space for the function to be evaluated based on the number of packs, with the aim of covering most of the search space and assuring achieving the exploration. Figure 5 shows the initialization of the population based on the leader.

3.3. Update the Positions for Each Agent Based on Its Packs

As we mentioned above, this part simulates the update of the wolves based on the leaders of each pack, and to understand better its performance, we illustrate in a graphical way a representation of this behavior.

Figure 6 shows an example of how to update the positions in FWA-GWO; is a bidimensional plot with a function in a range of and with an optimum equal to zero. Also in Figure 6, we can find in a graphical way the convergence of the all search agents in the algorithm. In addition, we can mention that blue, red, aqua, and green points represent the members of the 4 packs for this example, and the magenta points represent the initialization of each pack.

On the other hand, to keep the equilibrium of this algorithm (FWA-GWO), we decided to partition the search process in 3 phases; 100 percent of the total number of iterations was divided into 3 parts. We consider the first phase in an interval of 0% to 33.3% of the iterations and we consider this as the exploration phase, the second phase takes an interval from 33.3% to 66.6%, in this phase sometimes the FWA-GWO algorithm is exploring and other times exploiting, and finally, we consider the third phase as the exploitation and take the remaining part of the percentage (66.6% to 99.9%) of the total number of iterations.

It is worth mentioning that the number of packs is not constant, while the FWA-GWO is working. In other words, the objective of having three phases in this algorithm is to reduce the number of packs according to the particular phase in this algorithm. In addition, in the first phase (exploration) the algorithm will work with the number of packs and wolves that we selected at the beginning; in the second phase, the numbers of packs is reduced at half with the help of (17) and finally the FWA-GWO algorithm always finishes the optimization with only one big pack.Table 1 shows examples of the relationship between the phases and number of packs, respectively, based on the number of packs that were initialized.

In addition, we are presenting this information (Table 1) in a graphical way to explain the relationship in more detail. Figure 7 represents phase 1 where and .

In Figure 8 we present the second phase, so the new value of is based on (17) and the new value for is 12, because we divided the population into the number of packs . In addition we can mention that the total population is the same as that was originally initialized.

Finally, in Figure 9 we can find only one big pack as we mentioned above. In addition we can mention that this is an example of how the population is distributed into the 3 phases that the algorithm has and finally we assume that each pack has their corresponding leaders (alpha, beta, and delta).

3.4. Mathematical Model of FWA-GWO

For the hybridization between FWA and GWO, we modified the equations in GWO to calculate the distance for updating the next position of the current solution, and we introduced the amplitude explosion of the FWA into the distance for updating the next position in GWO (coefficient in (6)). Equation (18) shows the changes that we mentioned above.where represents the amplitude explosions of each pack and is the number of packs. When the number packs is 1 then the amplitude is 0.5, when the number of packs is 2 then the amplitude of the packs is 1 and 2, respectively [8]. When the number of packs is equal or greater than 3, we can then use the formula of the amplitude explosion of FWA.

The reason why the parameters are 0.5, 1, and 2 when the number of packs is one or two is because we are trying to maintain the parameter values in a range of , as the parameter in (6) in GWO is the one that controls the exploration and exploitation in the algorithm.

Equation (19) shows how we can normalize the parameter of the explosion amplitude between 0 and 2 when the number of packs is greater than 2.where represents the explosion amplitude normalized for each pack and is the maximum value of all amplitudes.

The distance between the best wolf with a random motion and the current wolf of each pack is calculated in the following way:where is the obtained distance of each pack, is the leader of the pack, and is the current wolf of each pack.

The weight for each distance of the omega wolves and the leaders of the pack that we described above is defined as follows:In (21), represents the weight for (22), is a value that decreases during iterations in a range of , and is a random value between 0 and 1 for each pack.

Equation (22) allows updating the next position of the current wolf and the mathematical model is defined as follows:where represents the next position, is the best wolf of each pack, and and are described in (20) and (21), respectively.

To apply randomness in the method, (23) is used with the aim that each leader obtains different moves for each omega wolf.Equations (24) and (25) are the same as (10) and (11) in GWO, but the difference is that now the leaders are represented for each pack.In (26) we can find the next position of the solution that we are evaluating as the GWO works and is an average of the three best wolves, but in this case this is represented for each pack. Finally, Algorithm 1 presents the pseudocode for the FWA-GWO.

Initialize and
Initialize the grey wolf population
Initialize a, and
Calculate the fitness of each search agent
= the best search agent of pack
= the second best agent of pack
= the third best search agent of pack
while ( < Max number of iterations)
for each search agent
Update the position of the current search
agent by Equation (5)
end for
Update , and
Update and
Calculate the fitness of all search agents
Update , and

end while
return best

4. Simulation Results and Discussion

In this section we are presenting the benchmark functions that are used in this work.

Table 2 shows the equations of the first 13 benchmark functions [24–26] used for the tests with the algorithms (FWA, FWO, and FWA-GWO) that can be classified as unimodal and multimodal, respectively. Figure 10 shows the graphical representations of these benchmark functions in their 3D versions.

Also in this paper we used another set of 9 benchmark functions that are called fixed-dimension multimodal and we can find their corresponding equations in Table 3 with the number of dimensions that were considered, the range of the search space and the optimal value for each function, respectively. Finally, in Figure 11 we show the graphical representations of these benchmark functions in their 3D versions.

For the experiments that were performed in this paper, we are presenting three different configurations for the FWA-GWO algorithm and we can find their descriptions as follows:(1)Version 1(i)4 packs(ii)6 wolves for each pack(iii)625 iterations(iv)15,000 function evaluations(2)Version 2(i)5 packs(ii)6 wolves for each pack(iii)500 iterations(iv)15,000 function evaluations(3)Version 3(i)8 packs(ii)5 wolves for each pack(iii)375 iterations(iv)15,000 function evaluations

For comparing the performance of all the algorithms, we performed hypothesis tests (-test) [22, 27, 28] with the following parameters:(i) (FWA-GWO)(ii)(iii)The mean of the FWA-GWO is lower than the mean of the original method (claim)(iv)(v)(vi)(vii)

We show the hypothesis tests results in the following tables, where we are comparing FWA-GWO with FWA and FWA-GWO with GWO, respectively.

4.1. Comparison between GWO and FWA-GWO

In Tables 4–11, we are presenting a comparison and hypothesis tests between the GWO and the hybrid method for 30, 60, and 90 dimensions and the three different versions, respectively.

From Table 4 we can conclude based on the hypothesis test that, for the case of 30 dimensions, the FWA-GWO in version 1 is better in 7 of the 13 benchmark functions that are analyzed in this paper.

In Table 5 we show the results of a hypothesis test for the original GWO and the FWA-GWO in version 2 and in this case the proposed method is better in 6 of the 13 analyzed functions.

Finally, Table 6 shows the results of the hypothesis tests when we are using version 3 of the FWA-GWO, in other words when the algorithm has 8 packs and 5 wolves for each pack, then we can conclude that the proposed hybrid approach (FWA-GWO) is better in 7 of the 13 functions that were tested in this paper.

In the following figures we are illustrating in a graphical way the results of the hypothesis tests, more specifically the -values. The comparison is between the conventional algorithms and the proposed FWA-GWO with the different versions.

In this case the blue bar represents the value of the hypothesis test with 60 dimensions, the green bar represents the values of the hypothesis with 90 dimensions, and finally the red bar represents the critical value according of the hypothesis test that was described above, which in this case is −1.645. Therefore, while the blue and green bars are less than −1.645, the hybrid method is better.

For 60 dimensions in the analyzed problems, the FWA-GWO in version 1 is better in 6 of the 13 analyzed benchmark functions according to Figure 12 and also we can find the -values for 90 dimensions between the GWO and version 1 of the FWA-GWO. In this case the proposed method is better in 4 benchmark functions.

In Figure 13 we can conclude that for 60 dimensions, the FWA-GWO in version 2 is better only in 3 of the 13 analyzed functions, respectively, and for 90 dimensions. In this case, the version 2 of the proposed method (FWA-GWO) has not a good performance because it is better than the original method only in 2 of the analyzed benchmark functions.

Finally, we are presenting in Figure 14 the -values when the problem has 60 and 90 dimensions, respectively. According to the hypothesis tests between GWO and the FWA-GWO in version 3 we can conclude that the FWA-GWO is better only in 3 of the 13 analyzed functions, respectively, with 60 dimensions and for 90 dimensions we can find that version 3 is better in 4 of the 13 analyzed functions based on the results of the hypothesis test.

4.2. Comparison between FWA and FWA-GWO

In addition we are presenting the hypothesis testing between the FWA and the FWA-GWO; Table 7 shows the results of the averages, standard deviations, and -values for 30 dimensions with the FWA-GWO in version 1.

We can conclude from Table 7 that the FWA-GWO is better in 5 of the 13 benchmark functions that are analyzed in this paper.

Table 8 shows the results when we used the FWA-GWO in version 2 and in this case we can find that it has a better a performance because it is better than the conventional FWA in 8 of the 13 total functions.

Finally, for 30 dimensions in Table 9 we are presenting the last version of the FWA-GWO algorithm that was analyzed in this paper and we can conclude that, for 30 dimensions, this version has the best configuration of the parameters because, according of the hypothesis testing, the FWA-GWO is better than FWA in 9 of the 13 benchmarks functions that were analyzed.

Based on Figure 15 we can mention that for 60 dimensions the FWA-GWO version 1 is better than the conventional FWA in 5 of the 13 benchmark functions that were analyzed in this paper and when the problems have 90 dimensions we can find that, for this number of dimensions, version number 1 is better in 4 benchmark functions that were analyzed.

In Figure 16 we can find in a graphical way the values of the hypothesis test between FWA and the FWA-GWO in version 2 and for 60 dimensions we can mention that we have a similar performance with respect to version 1 because both methods are better than the conventional FWA in 5 of the 13 analyzed benchmark functions. Finally, for 90 dimensions we can conclude that the FWA-GWO is better in 5 of the 13 benchmark functions that are analyzed.

Finally, in Figure 17 we are presenting the results of the hypothesis test between FWA and version 3 of the FWA-GWO and we can mention that for 60 dimensions we can conclude that in this version of FWA-GWO it only has better performance in 4 benchmark functions and for 90 dimensions FWA-GWO is better in 5 of the 13 benchmark functions that are analyzed in this paper.

4.3. Comparison of the Best Solutions among the Three Methods

In Figures 12, 13, and 14 we can notice that when the problem has 60 and 90 dimensions, respectively, we can find an interesting behavior and that, for these benchmark functions, the conventional GWO has better performance than the FWA-GWO according to the analyzed hypothesis test.

Also we can mention that, for the comparison between the FWA and the FWA-GWO, for 60 and 90 dimensions, respectively, the FWA-GWO has better performance around half of total analyzed benchmark functions and it is important to say that we are presenting only three different configurations of the FWA-GWO and for this comparison the performance can be significantly improved if we change these configurations.

In addition we consider that it is very important to summarize in the following tables a brief comparison only of the best results obtained in the 50 independent executions of each method for 60 and 90 dimensions, respectively, with the main goal of showing that although in a hypothesis test we cannot prove a best performance in some of the benchmark functions that are analyzed, the FWA-GWO still found a better result than the conventional algorithm.

Table 10 shows the best values of each method with 60 dimensions and we can conclude that in general the proposed FWA-GWO algorithm has better performance in 8 of the 13 analyzed functions, the FWA has better performance than the others in 4 of the 13 functions, and finally the GWO algorithm has better performance in 2 of the 13 benchmark functions that are analyzed in this paper. The best version of the FWA-GWO is with version 1 with 5 functions, and finally with versions 2 and 3, both methods are better in 2 benchmark functions, respectively.

Table 11 shows the general results for the best experiments of 50 runs that were executed with 90 dimensions and we can find that the FWA-GWO has better performance in 7 of the 13 analyzed benchmark functions. The FWA metaheuristic has better performance in 4 of the 13 functions and finally the GWO algorithm has better performance in 2 of 13 analyzed benchmark functions with 90 dimensions.

Based on Tables 10 and 11 we can find an interesting conclusion because we can note that the FWA-GWO has a better performance than the GWO and FWA, respectively, based on the best results that we obtained in the respective sample. This is very important because, for example, when we want to design fuzzy controllers, the design, the architecture, or the best plant is based on the best result that we obtained in the total experiments or executions and we can conclude that for these optimization problems the FWA-GWO has better performance than the conventional methods (GWO and FWA). Finally we can mention that for improving the results of the FWA-GWO in the hypothesis testing with 60 and 90 dimensions, respectively, we need to test other types of configurations of the FWA-GWO, because the configurations that we presented in this paper were chosen randomly.

Finally, we present the results of the rest of the total benchmark functions [F14, F22] that are analyzed in this paper, and these benchmark functions are called “fixed-dimension multimodal” and averages and standard deviation are presented in the following tables.

Tables 12 and 13 illustrate a brief comparison only with the averages of GWO, FWA, and the FWA-GWO in versions 1 and 2, respectively, and we can conclude that the three methods have a good performance with these benchmark functions.

In addition, Table 14 shows the comparison of the last version presented in this paper; the main goal of evaluating these benchmark functions is to prove that the methods work correctly and have a good performance with these types of problems and we only present a brief comparison in average without hypothesis test because the results are very similar.

4.4. Convergence of the FWA-GWO

In the following figures we are presenting convergence plots between the GWO and the FWA-GWO with two different problems and the difference is that in one problem the FWA-GWO (hybrid) has better performance and in others has not, according to the hypothesis test.

Figure 18 shows the convergence curve of the GWO and FWA-GWO algorithms, respectively, for the benchmark function number 4.

In Figure 19 we can notice the performance of the GWO and the FWA-GWO when we are using the benchmark function number 10. The red line represents the convergence curve of the GWO algorithm and the blue line represents the convergence of the FWA-GWO (hybrid).

It is important to mention that in conclusion we can say that, with the help of Figures 18 and 19, the FWA-GWO always finds other solutions throughout the iterations and this behavior is good because the algorithm always converges and avoids the local optima and this process occurs through the advantages of the hybridization between the GWO and FWA algorithms. On the other hand we can note in Figure 18 that, for example, in this problem (F10), the GWO algorithm falls into a local minimum and cannot avoid this problem. In addition, we can test with other configurations in the FWA-GWO toolbox, which is presented in [29].

5. Conclusions

In this paper we have presented the hybridization among two metaheuristics that were described above and the new hybrid method is called FWA-GWO. Is important to mention that an advantage of this new hybrid method is the capacity of choosing between the exploitation and exploration phases in the algorithm that are two main features of metaheuristics, so it is very important to choose this abilities according to the problem that we want to solve.

According to the results presented in this paper we can conclude that for 30 dimensions the different versions of the hybrid method are better than the GWO and FWA, respectively, according to the hypothesis test presented. On the other hand, we can note that for 60 and 90 dimensions in the hypothesis tests the performance of FWA-GWO is poor, but we can note an interesting behavior, and that if we analyzed the best result of the total executions, we found the best performance in the different FWA-GWO versions. It is important to mention that the configuration of the hybrid method for these types of problems can be significantly improved and users can test other configurations of FWA-GWO on the Toolbox.

Taking into account the fact that the proposed FWA-GWO method obtained the best result in 60 and 90 dimensions, we can conclude that the FWA-GWO can perform in a better way in problems of control and design of structures in computational intelligence than the FWA or GWO algorithms [30–32], respectively.

Also we can conclude that the FWA-GWO is an algorithm that has diversity in the method for searching for the optimal value, because in the total population the algorithm has a set of possible best solutions, so this feature is important because it helps avoid the local optima or false best values, searching always for possible different solutions. Finally, the proposed hybrid method (FWA-GWO) could be easily adapted to solve multiobjective problems.

As future work, we could test the FWA-GWO algorithm in problems with control of plants, as a first choice or as a second option, and dynamically adjust the parameters into the FWA-GWO algorithm with type 1 and interval type 2 fuzzy logic, respectively.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

References

E. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm intelligence: from natural to artificial systems, OUP, USA, 1999.
U. Can and B. Alatas, “Physics based metaheuristic algorithms for global optimization,” American Journal of Information Science and Computer Engineering, vol. 1, pp. 94–106, 2015.
View at: Google Scholar
D. H. Wolpert and W. G. Macready, “No free lunch theorems for optimization,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 67–82, 1997.
View at: Publisher Site | Google Scholar
B. Melián and J. Moreno, “Metaheurísticas: una visión global,” Revista Iberoamericana de Inteligencia Artificial, vol. 19, pp. 7–28, 2003.
View at: Google Scholar
F. Al Adwan, M. Al Shraideh, and M. R. Saleem Al Saidat, “A genetic algorithm approach for breaking of bimplified data encryption standard,” International Journal of Security and Its Applications, vol. 9, no. 9, pp. 295–304, 2015.
View at: Publisher Site | Google Scholar
J. Soto, P. Melin, and O. Castillo, “Optimization of the Fuzzy Integrators in Ensembles of ANFIS Model for Time Series Prediction: The case of Mackey-Glass,” in Proceedings of the IEEE Conference on Norbert Wiener in the 21st Century (21CW), pp. 1–8, Boston, Mass, USA, June 2014.
View at: Publisher Site | Google Scholar
Y. Tan, Fireworks Algorithm, Springer-Verlag, Berlin, Heidelberg, Germany, 2015.
L. Rodríguez, O. Castillo, and J. Soria, “A study of parameters of the grey wolf optimizer algorithm for dynamic adaptation with fuzzy logic,” Studies in Computational Intelligence, vol. 667, pp. 371–390, 2017.
View at: Publisher Site | Google Scholar
Y. Zheng, Q. Song, and S. Chen, “Multiobjective fireworks optimization for variable-rate fertilization in oil crop production,” Applied Soft Computing, vol. 13, no. 11, pp. 4253–4263, 2013.
View at: Publisher Site | Google Scholar
J. Li, S. Zheng, and Y. Tan, “Adaptive fireworks algorithm,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '14), pp. 3214–3221, Springer, Beijing, China, July 2014.
View at: Publisher Site | Google Scholar
Y. Tan and Y. Zhu, Fireworks Algorithm for Optimization, Springer-Verlag, Berlin, Heidelberg, Germany, 2010.
View at: Publisher Site | MathSciNet
J. Li, S. Zheng, and Y. Tan, “The Effect of Information Utilization: Introducing a Novel Guiding Spark in the Fireworks Algorithm,” IEEE Transactions on Evolutionary Computation, vol. 21, no. 1, pp. 153–166, 2017.
View at: Publisher Site | Google Scholar
Y. Tan and S. Zheng, “Dynamic search in fireworks algorithm,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC'14), pp. 3222–3229, July 2014.
View at: Publisher Site | Google Scholar
N. H. Abdulmajeed and M. Ayob, “A firework algorithm for solving capacitated vehicle routing problem,” International Journal of Advancements in Computing Technology (IJACT), vol. 6, no. 1, pp. 79–86, 2014.
View at: Google Scholar
J. Li and Y. Tan, “The bare bones fireworks algorithm: A minimalist global optimizer,” Applied Soft Computing, vol. 62, pp. 454–462, 2018.
View at: Publisher Site | Google Scholar
B. Zhang, Y.-J. Zheng, M.-X. Zhang, and S.-Y. Chen, “Fireworks Algorithm with Enhanced Fireworks Interaction,” IEEE Transactions on Computational Biology and Bioinformatics, vol. 14, no. 1, pp. 42–55, 2017.
View at: Publisher Site | Google Scholar
S. Zheng, J. Li, A. Janecek, and Y. Tan, “A cooperative framework for fireworks algorithm,” IEEE Transactions on Computational Biology and Bioinformatics, vol. 14, no. 1, pp. 27–41, 2017.
View at: Publisher Site | Google Scholar
S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey wolf optimizer,” Advances in Engineering Software, vol. 69, pp. 46–61, 2014.
View at: Publisher Site | Google Scholar
C. Muro, R. Escobedo, L. Spector, and R. P. Coppinger, “Wolf-pack (Canis lupus) hunting strategies emerge from simple rules in computational simulations,” Behavioural Processes, vol. 88, no. 3, pp. 192–197, 2011.
View at: Publisher Site | Google Scholar
L. Rodriguez, O. Castillo, J. Soria et al., “A fuzzy hierarchical operator in the grey wolf optimizer algorithm,” Applied Soft Computing, vol. 57, pp. 315–328, 2017.
View at: Publisher Site | Google Scholar
A. A. Heidari and P. Pahlavani, “An efficient modified grey wolf optimizer with Lévy flight for optimization tasks,” Applied Soft Computing, vol. 60, pp. 115–134, 2017.
View at: Publisher Site | Google Scholar
L. Rodriguez, O. Castillo, and J. Soria, “Grey wolf optimizer with dynamic adaptation of parameters using fuzzy logic,” in Proceedings of the 2016 IEEE Congress on Evolutionary Computation, CEC 2016, pp. 3116–3123, Canada, July 2016.
View at: Publisher Site | Google Scholar
J. Barraza, P. Melin, F. Valdez, and C. González, “Fireworks algorithm (FWA) with adaptation of parameters using fuzzy logic,” Studies in Computational Intelligence, vol. 667, pp. 313–327, 2017.
View at: Publisher Site | Google Scholar
J. G. Digalakis and K. G. Margaritis, “On benchmarking functions for genetic algorithms,” International Journal of Computer Mathematics, vol. 77, no. 4, pp. 481–506, 2001.
View at: Publisher Site | Google Scholar | MathSciNet
M. Molga and C. Smutnicki, “Test functions for optimization needs,” In press.
View at: Google Scholar
X. S. Yang, “Test problems in optimization,” in Engineering Optimization: An Introduction with Metaheuristic Applications, John Wiley & Sons, 2010, https://arxiv.org/abs/1008.0549v1.
View at: Google Scholar
J. Barraza, P. Melin, F. Valdez, and C. I. Gonzalez, “Fuzzy FWA with dynamic adaptation of parameters,” in Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC'16), pp. 4053–4060, July 2016.
View at: Google Scholar
R. Larson and B. Farber, Elementary Statistics Picturing the World, Perarson Education Inc, 2003.
Toolbox FWAGWO, “Hybridization between the FWA and GWO algorithms,” 2017, http://www.hafsamx.org/melin/ToolFWAGWO/.
View at: Google Scholar
D. Guha, P. K. Roy, and S. Banerjee, “Load frequency control of interconnected power system using grey Wolf optimization,” Swarm and Evolutionary Computation, vol. 27, pp. 97–115, 2016.
View at: Publisher Site | Google Scholar
R.-E. Precup, R.-C. David, and E. M. Petriu, “Grey Wolf optimizer algorithm-based tuning of fuzzy control systems with reduced parametric sensitivity,” IEEE Transactions on Industrial Electronics, vol. 64, no. 1, pp. 527–534, 2017.
View at: Publisher Site | Google Scholar
S. Saremi, S. Z. Mirjalili, and S. M. Mirjalili, “Evolutionary population dynamics and grey wolf optimizer,” Neural Computing and Applications, vol. 26, no. 5, pp. 1257–1263, 2015.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2018 Juan Barraza et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

2635

Downloads

1955

Citations