## Figures

## Abstract

Global optimization is challenging to solve due to its nonlinearity and multimodality. Traditional algorithms such as the gradient-based methods often struggle to deal with such problems and one of the current trends is to use metaheuristic algorithms. In this paper, a novel hybrid population-based global optimization algorithm, called hybrid firefly algorithm (HFA), is proposed by combining the advantages of both the firefly algorithm (FA) and differential evolution (DE). FA and DE are executed in parallel to promote information sharing among the population and thus enhance searching efficiency. In order to evaluate the performance and efficiency of the proposed algorithm, a diverse set of selected benchmark functions are employed and these functions fall into two groups: unimodal and multimodal. The experimental results show better performance of the proposed algorithm compared to the original version of the firefly algorithm (FA), differential evolution (DE) and particle swarm optimization (PSO) in the sense of avoiding local minima and increasing the convergence rate.

**Citation: **Zhang L, Liu L, Yang X-S, Dai Y (2016) A Novel Hybrid Firefly Algorithm for Global Optimization. PLoS ONE 11(9):
e0163230.
https://doi.org/10.1371/journal.pone.0163230

**Editor: **Wen-Bo Du, Beihang University, CHINA

**Received: **June 22, 2016; **Accepted: **September 6, 2016; **Published: ** September 29, 2016

**Copyright: ** © 2016 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

**Data Availability: **All relevant data are available within the paper.

**Funding: **This work has been supported financially by the National Natural Science Foundation of China under Grant 51109041 to YTD, and by the Fundamental Research Funds for the Central Universities under Grant HEUCF160405 to LNZ and also supported by the China Scholarship Council to LNZ. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

**Competing interests: ** The authors have declared that no competing interests exist.

## Introduction

Global optimization is crucially important in many applications, such as image processing [1], antenna design [2], chemistry [3], wireless sensor network [4], and so on. However, such global optimization problems are challenging to solve because these problems are often highly nonlinear with multiple local optima. Thus, traditional methods such as the gradient-based methods usually struggle to deal with such problems. Thus, for decades, researchers have attempted many different ways to try to solve such challenging problems with different degrees of success. In recent years, many researchers have proposed some new optimization algorithms [5–7].

Technically speaking, optimization methods can be divided into two main parts: deterministic algorithms and stochastic algorithms [8]. Deterministic algorithms such as the Hill-Climbing [9], Newton-Raphson [10] and Simplex Method [11] can get the same final results if the same set of initial values are used at the beginning. The advantages of such deterministic algorithms are that they usually have good efficiency for certain problems and require only a small number of iterations. However, one of their main disadvantages is the high probability of being trapped in local optima because they are local search algorithms. On the other hand, stochastic algorithms often use some randomness in their strategies which can enable the algorithm to escape from the local optima to search more regions on a global scale. This kind of strategy always produce unrepeatable routes of each individual run even starting with the same initial points. Though may be slightly different, the final results of these algorithms can often converge to the same optimal results within a given criterion if the algorithm is allowed to run long enough [8].

Nowadays, most stochastic algorithms can be called meta-heuristic algorithms [12]. Most of them have been developed, based on the biological processes in nature and these algorithms start to show their power and efficiency. Genetic Algorithm (GA) [13], Ant Colony Optimization (ACO) [14], Particle Swarm Optimization (PSO) [15–18], Artificial Bee Colony (ABC) [19], Cuckoo Search (CS) [20] and Firefly Algorithm (FA) [21–24] are some of the most popular algorithms in this class of stochastic algorithms. The disadvantages of these algorithms are the need for proper setting the algorithm-dependent parameters and a large number of iterations. However, these meta-heuristic algorithms have two main advantages. One is the good information-sharing mechanism which can promote the algorithm to converge faster under certain conditions and the other is the lower probability of entrapment into local modes.

The paper is organized as follows: the main idea of the standard firefly algorithm and standard differential evolution are illustrated in Section 2, and then the details of our proposed hybrid firefly algorithm are described in Section 3. In Section 4, we will demonstrate and carry out the analysis of the experimental results. Finally, Section 5 concludes the work.

## Firefly Algorithm and Differential Evolution

Firefly algorithm (FA) [25] is a new biologically inspired meta-heuristic optimization algorithm, which was proposed by Xin-She Yang in 2008. This algorithm is inspired by the flashing behaviour of tropical fireflies. Differential evolution (DE) [26] developed by Storn and Price in 1997 is also a meta-heuristic algorithm. DE with a potential parallel structure is a non-gradient-based, evolutionary computation algorithm. It has been proven that both algorithms can get a better optimal results than those achieved by the existing methods.

### Standard Firefly Algorithm

The Firefly Algorithm (FA) is based on the communication behaviour of tropical fireflies and the idealized behaviour of the flashing patterns. FA uses the following three idealized rules [27–30] to build the mathematical model of the algorithm:

- All fireflies are unisex so that one firefly will be attracted to other fireflies regardless of their sex;
- Attractiveness is proportional to their brightness. Thus for any two flashing fireflies, the less bright one will move towards the brighter one. The attractiveness is proportional to the brightness and they both decrease as their distance increases;
- The brightness of a firefly is affected or determined by the landscape of the objective function. (Thus, for a maximization problem, the brightness can simply be proportional to the value of the objective function.)

In the standard firefly algorithm, there are two important points. One is the formulation of the light intensity and another is the change of the attractiveness. Firstly, we can always assume that the brightness of the firefly can be determined by the encoded objective function landscape. Secondly, we should define the variation of light intensity and formulate the change of the attractiveness. As we know that in nature the light intensity decreases with the distance from its source and the media will absorb the light, so in our simulation we suppose the light intensity *I* varies with the distance *r* and light absorption parameter γ exponentially and monotonically [31]. That is
(1)
where *I*_{0} is the original light intensity at the source (i.e., at the distance *r* = 0) and *γ* is the light absorption coefficient. From the idealized rules we known that in our simulation we suppose the attractiveness of firefly is proportional to the light intensity *I*. So we can define the firefly’s light attractive coefficient *β* in the similar way as the light intensity coefficient *I*. That is
(2)
where *β*_{0} is the original light attractiveness at *r* = 0.

The Cartesian distance is used to calculate the distance between any two fireflies *i* and *j* at *x*_{i} and *x*_{j}
(3)
where *d* is the number of dimensions. The amount of movement of firefly *i* to another more attractive (brighter) firefly *j* is determined by
(4)
where the first term is the current location of firefly *i*, the second term is due to the attraction, while the third term is randomization with the vector of random variables *ε*_{i} being drawn from different distributions such as the Uniform distribution, Gaussian distribution and Lévy flight. In the third term, α is a scaling parameter that controls the step size and it should be linked with the interests of the problems.

According to above idealization and approximations rules, the pseudo-code of standard firefly algorithm can be summarized in Algorithm 1.

**Algorithm 1** Pseudo-code for the standard FA algorithm

Objective function *f*(*x*), *x* = (*x*_{1},⋯,*x*_{D})^{T}

Initialize a population of fireflies *x*_{i} (*i* = 1,2,⋯*n*)

Calculate the light intensity *I*_{i} at *x*_{i} by *f*(*x*_{i})

Define light absorption coefficient *γ*

**While ( t < MaxGeneration**)

f**or i = 1:n all n fireflies**

**for j = 1:n all n fireflies**

Calculate the distance *r* between *x*_{i} and *x*_{j} using Cartesian distance equation

**if ( I_{j} > I_{i})**

Attractiveness varies with distance *r* via

Move firefly *i* towards *j* in all *d* dimensions

**end if**

Evaluate new solutions and update light intensity

**end for j**

**end for i**

Rank the fireflies and find the current best

**end**** while**

Post-process results and visualization

### Standard Differential Evolution

Differential evolution (DE) was proposed by Storn and Price in 1996, which uses a vectorized mutation operator and two forms of crossover (either exponential or binomial) to evolve from the randomly generated, initial starting points to the potentially optimal solution. There are many DE variants. In this paper, we use the so-called DE*/rand/1/bin* scheme/variant. This variant is probably the most widely used in practice, which can be briefly described as follows [32].

For a given *D*-dimensional minimization problem, a population consists of *n* individual solution vectors. The mutant vector *v*_{i} can be defined as follows:
(5)
where the indexes *r*_{1},*r*_{2}, *r*_{3} ∈ [1, *n*] correspond to three solutions randomly chosen from the whole population and *g* is the iteration/generation index. The indices have to be different from each other. In addition, *F* (*F* ∈ [0,2]) is a perturbation parameter that controls the amplification of the difference vector , though in most cases 0 < *F* < 1 is used in practice.

The binomial crossover operation tries to produce a new trial vector from the perturbed or mutated vector *v*_{i,g+1} = [*v*_{i1,g+1},*v*_{i2,g+1},⋯,*v*_{iD,g+1}] and the target vector *x*_{i,g} = [*x*_{i1,g},*x*_{i2,g},⋯,*x*_{iD,g}]
(6)
where *j* ∈ [1,2,⋯*D*], *r*(*j*) is the *jth* realization of a uniform random generator number. In addition, *C*_{r} ∈ [0,1] is the so-called crossover constant. Here, *random* ∈ [1,2,⋯,*D*] is a random permutation index vector, which can usually ensure that the trial vector *u*_{i,g+1} gets at least one character from the mutated vector *v*_{i,g+1}.

The selection mechanism is similar to those of other algorithms where a greedy acceptance is performed: (7)

This means that the update is accepted only if a better objective is achieved.

Algorithm 2 summarizes the basic steps of the standard differential evolution algorithm.

**Algorithm 2** Pseudo code for the standard DE algorithm

Initialize the population *x*_{i} (*i* = 1,2,⋯*n*) from the randomly initial starting points

Set the perturbation parameter *F* and crossover probability parameter *C*_{r}

**While ( t < MaxGeneration**)

f**or i = 1:n in all individuals**

For each *x*_{i}, randomly choose 3 different vectors , and from the whole population

Use mutation to generate a new vector *v*_{i}

Generate a random index *random* (*i*)

Generate a randomly distributed number *r*(*j*) *ϵ* [0,1]

**for j = 1:D**

Crossover operation, for each parameter *v*_{ij}, update

**end for j**

Select operation, select and update the solution *x*_{i}

**end for i**

**end** **while**

Post-process results and visualization

## The HFA Algorithm

Both the firefly algorithm and differential evolution have their own advantages and they both work well for a wide range of optimization problems. In this paper, we propose a new hybrid algorithm based on FA and DE by combining some of the advantages of both algorithms. We call the proposed approach the hybrid firefly algorithm (HFA) that combines the attraction mechanism of FA with the mixing ability of DE so as to increase the speed of convergence and the diversity of the population. The major difference between firefly algorithm and differential evolution is how new individuals are generated and then used at each iteration.

Among the many components of algorithms, intensification and diversification (also called exploitation and exploration) are the two major components of any meta-heuristic algorithm [33]. In order to explore the search space on a global scale, meta-heuristic algorithms need to generate a diverse range of solutions using diversification or exploration strategy. Intensification or exploitation strategy can guide the individual to search in a local region, based on the prior knowledge or the new information found during the search process that a current good solution is found in this region. An algorithm’s solution accuracy and convergence rate can be enhanced by balancing intensification and diversification properly.

Firstly, the earlier observations and studies in the literature indicated that the firefly algorithm can subdivide the whole population into subgroups automatically in terms of the attraction mechanism via the variation of light intensity and one of the FA variants can escape from the local minima owing to long-distance mobility by Lévy flight [34]. Such advantages mean that FA is good at exploration as well as diversification. Furthermore, technically speaking, due to the efficiency of mutation operator and crossover operator, differential evolution can provide a good mixing ability among the population and thus provide a better diversity in the population. At the same time, DE can also carry out local search during the process, especially when approaching to the local optimal solutions, and thus we can use this advantage to improve both the exploitation and exploration ability of our proposed algorithm. In addition, updating the current global best in the whole population ensures that solutions can converge to the optimum, while diversification via mixing and regrouping the whole population allows the search algorithm to escape from local optima and may simultaneously increase the diversity of solutions. It is worth pointing out that we only mix and regroup the individual location information obtained after the main iteration of parallel FA and DE processes, rather than generating the new positions from random walks or other operators. The main superiority of such mixing and regrouping mechanism is to guarantee the search focusing on the current locations in the promising areas obtained in the earlier phase instead of having to search or re-search less promising regions of the search space.

Based on above descriptions, the fundamental steps of the HFA can be summarized as the pseudo-code shown in Algorithm 3 where we can see that the parallel use of FA and DE can strike a good balance between exploration and exploitation during the whole iteration process.

**Algorithm 3** Pseudo-code for the HFA algorithm

**Begi****n**

Divide the whole group into two groups: *G*_{1} and *G*_{2}

Initialize the populations *G*_{1} and *G*_{2}

Evaluate the fitness value of each particle

**Repeat**

**Do in parallel**

Perform FA operation on *G*_{1}

Perform DE operation on *G*_{2}

**End Do in parallel**

Update the global best in the whole population

Mix the two groups and regroup them randomly into new groups: *G*_{1} and *G*_{2}

Evaluate the fitness value of each particle

**Until a terminate-condition is met**

**En****d**

Post-process results and visualization

Though the detailed computational complexity may depend on the structure of the implementation, however, for three meta-heuristic algorithms used in this paper, their complexities can be easily estimated. For FA, the time complexity is O*(n*^{2}*t*) where *n* is the population size and *t* is the number of iterations because there are two loops for going through the population. For DE, its complexity is O(*nt*). Therefore, in this case, for our proposed hybrid approach (HFA), the time complexity is O(*n*^{2}*t*/4 + *nt*/2) because each component (either FA or DE) only uses half of the population. As n is small (in this case, *n* = 20 *or* 40), and *t* is large (in this case, *t* = 2000), the computation cost is relatively inexpensive because the algorithm complexity is linear in terms of *t*. The main computational cost will be in the evaluations of objective functions.

## Benchmarks and Parameter Settings

### Benchmark Functions

Benchmark functions are useful to evaluate new algorithms and their features such as the precision, the rate of convergence, the robustness and the general performance. To evaluate the performance of our proposed algorithm and other existing algorithms, a set of 13 standard benchmark functions is used and such benchmarks have been chosen with a diverse range of properties. Theoretically speaking, if a small number of the benchmark functions are used, the experimental results may be potential biased due to the limited diversity of the problem objective landscape and in this case it would be very difficult to draw any convincing conclusions. Therefore, we have chosen test functions based on the characteristics, modality and other properties so as to provide a fairly rich set of functions with varied difficulties. In essence, we used the same test functions as those used in [35, 36]. All of the benchmark functions are summarized in Tables 1 and 2 where *D* denotes the dimension of the benchmark function, *S* denotes the scales of the variables, and *F*_{min} is the global optimum value in the variable scales.

The test benchmark functions can be divided into two groups in terms of the number of local minima: unimodal functions and multimodal functions. The unimodal test functions have one global optimum, so they are suitable for benchmarking the local exploitation ability of algorithms. This kind of functions will allow to focus more on the convergence rates of the tested algorithms other than the final results. Multimodal test functions have many local minima, and the number of local optima usually increases exponentially with the problem dimension, so they are suitable for benchmarking the global exploration ability of algorithms. This kind of multimodal functions can test the exploration ability which can make the algorithm escape from local optima. In some applications, to find a good optimal or suboptimal solution is more important, while other applications may place the emphasis on the accuracy of the solutions. So the quality of final results is more of concern in such applications.

From Table 1, we know that functions *f*_{1}-*f*_{7} are unimodal, high-dimensional problems. Function *f*_{5}, also namely the ‘banana function’, has a global optimum inside a long but flat, narrow, parabola-shaped valley. To find the location of the valley is non-trivial, though not too difficult. However, to converge to the global minimum with a high accuracy is more difficult, especially for gradient-based algorithms. Function *f*_{6} is the step function, characterized by plateaus and discontinuities. In addition, function *f*_{7} is a noisy quadratic function.

Functions *f*_{8}–*f*_{13} in Table 2 are multimodal, high-dimensional problems and more details are summarized in Table 2. For example, *f*_{8} is a non-convex, multimodal and additively separable function. This seemingly simple function can be deceptive because the global minimum at (420.9687,⋯,420.9687) is geometrically distant from the next best local minima in the domain [−500,500]^{D} where *D* is the number of dimensions. Therefore, many algorithms including some of metaheuristic algorithms may find it quite challenging to solve. In addition, *f*_{9} is also challenging as it is one of the most difficult benchmarks commonly used in the literature because it has multiple, steep wells with multiple local minima. Another widely used multimodal benchmark function is *f*_{10}, namely the Ackley function, which can be characterized by a deep valley at the centre and an almost flat outer zone. Consequently, it is quite challenging to solve because it is easy for most optimization algorithms to get trapped in one of its many local minima due to the multimodality.

### Parameter Settings

For the verification purpose of the algorithms and the analysis of the experimental results, our proposed hybrid firefly algorithm is compared to the standard FA and DE as well as PSO to benchmark the performance and to see if there is any improvement.

In all cases, the population size is set to 40, and the dimension of the benchmark functions is equal to 30. We also set the maximum number of iterations, as the stopping criteria, equal to 2000. The initial population is generated using uniformly distributed random initialization within the ranges or limits of the design variables. In addition, 30 independent runs have also been carried out for each function and each algorithm with completely different initial settings. The results from the algorithms are accompanied according to four standard statistical measures: the Minimum, the Maximum, the Mean, and the Standard Deviation (Std) of the fitness values calculated over 30 independent runs.

For the firefly algorithm, we set the initial attractiveness *β*_{0} = 2 * *rand*, the light absorption coefficient *γ* = 1/*S*^{2} where *S* donates the average range of the variables, the random parameter *α* (*α* = 0.2 * 0.95^{iter} where 0.2 is the initial randomness factor and *iter* is the index of the iteration) reduces monotonically and gradually. Finally, we use the Lévy distribution to draw the random numbers because it can produce occasionally some long leaps [37]. The values of the differential evolution algorithm-dependent parameters are *F* = 0.5 as the scaling factor and *C*_{r} = 0.9 as the crossover constant [38]. Additionally, for particle swarm optimization, the learning factors *c*_{1} and *c*_{2} are both set as 2, the inertia weight *ω* decreases linearly from *ω*_{max} = 0.9 to *ω*_{min} = 0.4 [39].

It is worth pointing out that in our proposed HFA, the parameters, *β*_{0}, *γ*, *α*, *ε*_{i}, *F* and *CR*, are all the same as those defined in the standard FA and DE. Specially, in our implementations, we have divided the whole population into two subgroups (subpopulations), which means that the population size in FA and DE each is equal to 20. And at the same time we have also divided the total 2000 iterations into 10 sub-iteration groups (or subgroups or substages). For each sub-iteration group, FA and DE, respectively, the number of sub-iterations is set to 200 times in parallel, and thus the total of 2000 iterations is realized in 10 subgroups and each with a number of 200 iterations.

All of the algorithm-dependent parameters are summarised in Table 3.

### Experimental Results and Analysis

#### Unimodal Function Experimental Results.

In the first series of experiments, the aim is to compare the exploitation ability and convergence rate of the mentioned algorithms for functions *f*_{1}-*f*_{7}. The statistic results of 30 independent runs are given in Table 4. The best mean results of the algorithms are written in bold.

As can be seen from Table 4, HFA performs significantly better than FA, DE and PSO consistently for all unimodal test functions except for *f*_{4}. For *f*_{4}, our proposed HFA cannot tune itself successfully, whereas FA solves this function quite accurately. In essence, this case is consistent with the so-called no-free-lunch (NFL) theorems. This means that there is no universally superior algorithm for all types of problems [40, 41]. However, as we are not intending to solve all types of problems, therefore, ranking algorithms is always possible for any given set of problems.

In the rest of this section, we use Freidman tests to test which of the mentioned algorithms are statistically better in the solution of benchmark functions [42]. A null hypothesis indicates that two algorithms are equivalent and, therefore, they can get the equal ranks. If the performance of the algorithms is statistically different, the null hypothesis will be rejected. We use a significance level 0.95 (or α = 0.05) for the Friedman tests. Table 5 summarises the mean values of all the relevant unimodal benchmark functions. The results of the Friedman non-parametric test are illustrated in Table 6. According to the p-values in Table 6, we can conclude that HFA has a significant difference from FA and PSO. However, the result become insignificant when compared with DE.

Figs 1–3 are the convergence curves observed by the 4 mentioned algorithms for *f*_{1}, *f*_{3} and *f*_{5}. In these figures, the horizontal axis is the number of iterations and the vertical axis is the fitness value of the benchmark function. It is can be seen that HFA performs significantly better than FA, DE, and PSO. For example, *f*_{1}, namely the simple sphere function, is a famous benchmark function. During the whole generations, HFA displays a faster convergence rate than those of FA, DE, and PSO due to its better exploitation search ability. It is clear that HFA quickly reaches the neighborhood of the global optimum and gets approximately 10^{−16} with only 200 iterations, while DE and PSO can only reach approximately 10^{−12} and 10^{−8}, respectively after the final 2000 iterations. In fact, HFA has a nearly constant convergence rate throughout the whole iteration for most of the unimodal benchmark functions. And the experiment results of HFA after 200 iterations (which means only one iterative repetition time) are better than the final results of DE and PSO after 2000 iterations. Hence from Figs 1–3, we can say that our proposed HFA has a quicker convergence rate and is able to improve its results steadily for a long time. On the other hand, FA also maintains a fast convergence rate at the beginning, however, it can get stuck into the local optimum very soon especially for Figs 2 and 3. Hence, we can know that FA cannot prevent premature convergence due to the poor exploration ability, especially as the iterations proceed. From the observed convergence curves, it is clear that DE and PSO have a very low convergence rate during the whole process compared with HFA and FA.

#### Multimodal Functions.

For the second series of experiments, we use multimodal functions to compare the exploration ability of the compared algorithms. The statistical results of comparing the mentioned algorithms with 30 independent runs are presented in Table 7. The best mean results of the mentioned algorithms are written in bold.

From the statistic results in Table 7 we can know that the HFA outperformed other compared algorithms when solving the functions *f*_{8} and *f*_{9}. The FA is the best for solving the functions *f*_{10} and *f*_{11}. In addition, HFA and FA have almost equal optimization abilities for solving the functions *f*_{12} and *f*_{13}. Both can obtain the accurate results of these functions.

Similar to what we have done for the unimodal test functions, the Friedman tests using the significance level of 0.95 (or α = 0.05) are also conducted for all the multimodal benchmark functions. Table 8 summarizes the mean values of the final results over 30 independent runs. The results of these tests are summarized in Table 9. The P-value in Table 9 shows that HFA has a significant difference from DE, while the results become insignificant when compared with FA and PSO.

At the same time, the convergence curves of different algorithms for *f*_{9} and *f*_{10} have been shown in Figs 4 and 5 where the horizontal axis is the number of iterations and the vertical axis is the fitness value of the benchmark function. According to Fig 4, DE and PSO perform poorly during the whole iterative process. FA maintains a higher convergence rate, but unfortunately it appears to become plunged into local optima after about 200 iterations. HFA can escape from the local optima automatically and find the final global best. As can be seen in Fig 5, it is obvious that FA and HFA perform significantly better than DE and PSO. In the beginning, FA displays a faster convergence rate than HFA, while HFA overtakes FA finally. Thus we can say that for the Ackley function both HFA and FA can maintain a strong exploration ability and robustness.

## Conclusions

In this paper, we have proposed a novel hybrid firefly algorithm (HFA) by combining some of the advantages of both firefly algorithm and differential evolution. Based on the theoretical analysis and the problem solving ability of metaheuristic algorithms, we can summarize that HFA has three advantages or improvements: the first strategy is equipped with a better balance between exploration and exploitation due to the parallel use of FA and DE and the population information-sharing. The experimental results illustrated that FA can provide an excellent convergence rate and a strong exploration ability, whereas DE is good at exploitation by using mutation and crossover operators. Ideally, an algorithm should explore the search space as extensively as possible to find all the promising regions and simultaneously it should conduct a more refined search in the promising areas so as to improve the precision of the solutions.

The second improvement is that the selection mechanism used in the proposed approach can enable the solution to converge to the optimum in a better way. This is achieved by first mixing the two subpopulations that are independently evolved using either FA or DE, and then selecting the best solutions among both subpopuations. Thus, it is more likely to find the global optimum than each individual algorithm involved in the hybrid. The third strategy improvement is that the hybrid can increase the diversity of solutions efficiently and can also help the algorithm avoid the stagnation problem by using a mixing and regrouping mechanism. It can be observed that the attraction operator in FA is a double-edged sword. To some extent, it can accelerate the convergence speed, but may also mislead the algorithm to get stuck into some local optima if the diversity of the population becomes low. Technically speaking, this hybrid mechanism can liberate the population from sub-optimal solutions and enable a continued progress toward the true global optima as have been observed in the simulations.

The statistical analyses have also confirmed the theoretical insight in this paper that the three enhancements in the combined approach can explore and exploit the search space more efficiently. It has been seen from the above results that the proposed HFA can indeed work well compared to FA, DE and PSO, which has been further confirmed by the results obtained from the Friedman tests.

Future work will explore different ways of mixing and regrouping the population so as to enhance the performance even further. In addition, it will be useful to carry out a more detailed parametric study to see how different sub-stages of iterations can be used to maximize the parallelism and also to reduce the overall number of iterations. Furthermore, it will also be useful to automatically tune these parameters depending on the modality of the problem and thus can solve problems more effectively in real-world applications.

## Acknowledgments

This work has been supported financially by the National Natural Science Foundation of China under the Grant 51109041, by the Fundamental Research Funds for the Central Universities under the Grant HEUCF160405 and also supported by the China Scholarship Council.

## Author Contributions

**Conceptualization:**XSY LNZ.**Funding acquisition:**YTD LNZ.**Methodology:**LNZ XSY.**Writing – original draft:**LNZ LQL.**Writing – review & editing:**XSY LNZ YTD.

## References

- 1. Horng M. H. Vector quantization using the firefly algorithm for image compression. Expert Systems with Applications. vol.39, no.1, pp. 1078–1091, 2012.
- 2. Basu B., Mahanti G. K. Thinning of concentric two-ring circular array antenna using firefly algorithm. Scientia Iranica. vol.19, no.6, pp. 1802–1809, 2012.
- 3. Ourique C. O., Biscaia E. C., Pinto J. C. The use of particle swarm optimization for dynamical analysis in chemical processes. Computers & Chemical Engineering. vol. 26, no.12, pp. 1783–1793, 2002.
- 4.
Camilo T., Carret C., Silva J. S., Boavida F. An energy-efficient ant-based routing algorithm for wireless sensor networks, Ant Colony Optimization and Swarm Intelligence. Springer Berlin Heidelberg. 2006, pp. 49–59.
- 5.
Reiner Horst, Pardalos Panos M. Eds. Handbook of global optimization. Vol. 2. Springer Science & Business Media. 2013.
- 6. Kavousi-Fard A., Samet H., Marzbani F. A new hybrid modified firefly algorithm and support vector regression model for accurate short term load forecasting. Expert systems with applications. vol. 41, no. 13, pp. 6047–6056, 2014.
- 7. Su C. T., Lee C. S. Network reconfiguration of distribution systems using improved mixed-integer hybrid differential evolution. IEEE Trans. Power Delivery. vol.18, no.3, pp.1022–1027, 2003.
- 8.
Yang X.S. Nature-Inspired Metaheuristic Algorithms. Second Edition. Luniver Press. 2010.
- 9. Goldfeld S. M., Quandt R. E., Trotter H. F. Maximization by quadratic hill-climbing. Econometrica: Journal of the Econometric Society. vol. 34, no. 3, pp. 541–551. 1966.
- 10. Abbasbandy S. Improving Newton–Raphson method for nonlinear equations by modified Adomian decomposition method. Applied Mathematics and Computation. vol.145, no.2, pp. 887–893, 2003.
- 11. Nelder J. A., Mead R. A simplex method for function minimization. The computer journal. 1965, 7(4): 308–313.
- 12. Arora S., Singh S. The firefly optimization algorithm: convergence analysis and parameter selection. International Journal of Computer Applications. vol. 69, no. 3, pp. 48–52, 2013.
- 13. Deb K., Pratap A., Agarwal S. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Computation. vol. 6, no. 2, pp. 182–197, 2002.
- 14.
Dorigo M., Birattari M. Ant colony optimization. Encyclopedia of machine learning. Springer US, 2010, PP. 36–39.
- 15.
Kennedy J. Particle swarm optimization. Encyclopedia of Machine Learning. Springer US, 2010, pp. 760–766.
- 16. Gao Y., Du W. B., Yan G. Selectively-informed particle swarm optimization. Scientific reports, 2015, 5: 9295. pmid:25787315
- 17. Du W. B., Gao Y., Liu C., Zheng Z., Wang Z. Adequate is better: particle swarm optimization with limited-information. Applied Mathematics and Computation. 2015, 268: 832–838.
- 18. Karaboga D., Basturk B. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of global optimization. vol. 39, no. 3, pp. 459–471, 2007.
- 19. Yuan G. N., Zhang L. N., Liu L. Q., Dai Y. T. Passengers’ evacuation in ships based on neighborhood particle swarm optimization. Mathematical Problems in Engineering. vol. 2014, 2014.
- 20.
X. S. Yang, S. Deb. Cuckoo search via Lévy flights. Nature & Biologically Inspired Computing. 2009. NaBIC 2009. World Congress on. IEEE. 2009, pp. 210–214.
- 21. Yang X. S. Firefly algorithm, stochastic test functions and design optimization. International Journal of Bio-Inspired Computation. vol. 2, no. 2, pp. 78–84, 2010.
- 22. Wang H., Zhou X., Sun H., Yu X., Zhao J., Zhang H., et al. Firefly algorithm with adaptive control parameters. Soft Computing. 2016: 1–12.
- 23. Marichelvam M. K., Geetha M., Solving tri-objective multistage hybrid flow shop scheduling problems using a discrete firefly algorithm. International Journal of Intelligent Engineering Informatics. 2014, 2(4), 284–303.
- 24. Wang H., Wang W., Sun H., Rahnamayan S. Firefly algorithm with random attraction. International Journal of Bio-Inspired Computation. 2016, 8(1): 33–41.
- 25.
Yang X. S. Firefly Algorithm, Nature-inspired metaheuristic algorithms. Luniver Press. 2010, pp. 79–90.
- 26. Storn R., Price K. Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization. vol. 11, no. 4, pp. 341–359, 1997.
- 27.
Yang X. S. Firefly algorithms for multimodal optimization. Stochastic algorithms: foundations and applications. Springer Berlin Heidelberg. 2009, pp. 169–178.
- 28. Wang H., Cui Z., Sun H., Rahnamayan S., Yang X. Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism. Soft Computing. 2016: 1–15.
- 29. Marichelvam M. K., Prabaharan T., Yang X. S. A discrete firefly algorithm for the multi-objective hybrid flow shop scheduling problems. IEEE transactions on evolutionary computation. 2014, 18(2), 301–305.
- 30. Marichelvam M. K., Geetha M. A hybrid discrete firefly algorithm to solve flow shop scheduling problems to minimize total flow time. International Journal of Bio-Inspired Computation. In press.
- 31.
Yang X. S. Firefly algorithm, Lévy flights and global optimization. Research and development in intelligent systems XXVI. Springer London. 2010, pp. 209–218.
- 32.
Price K., Storn R. M., Lampinen J.A. Differential evolution: a practical approach to global optimization. Springer Science & Business Media. 2006.
- 33. Blum C., Roli A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR). vol. 35, no. 3, pp. 268–308, 2003.
- 34.
Yang X. S. Cuckoo search and firefly algorithm: overview and analysis, Cuckoo Search and Firefly Algorithm. Springer International Publishing. 2014, pp.1–26.
- 35. Brest J., S Greiner , Bošković B., Mernik M., Zumer V. Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans. Evolutionary Computation. vol. 10, no. 6, pp. 646–657 2006.
- 36. Yao X., Liu Y., Lin G. Evolutionary programming made faster. IEEE Trans. Evolutionary Computation. vol. 3, no. 2, pp. 82–102, 1999.
- 37. Brown C. T., Liebovitch L. S., Glendon R. Lévy flights in Dobe Ju/’hoansi foraging patterns. Human Ecology. vol. 35 no. 1, pp. 129–138, 2007.
- 38. Vesterstrom J., Thomsen R. A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. Evolutionary Computation. 2004. CEC2004. Congress on. IEEE, 2004, 2, pp. 1980–1987.
- 39.
Shi Y., Eberhart R. C. Parameter selection in particle swarm optimization. Evolutionary programming VII. Springer Berlin Heidelberg. 1998, pp. 591–600.
- 40. Yang X. S. Free lunch or no free lunch: that is not just a question? International Journal on Artificial Intelligence Tools. vol. 21, no. 03, 2012.
- 41. Wolpert D. H., Macready W. G. No free lunch theorems for optimization. IEEE Trans. Evolutionary Computation. vol. 1, no. 1, pp. 67–82, 1997.
- 42.
Fister I., Yang X. S., Brest J., Fister I Jr. On the randomized firefly algorithm. Cuckoo Search and Firefly Algorithm. Springer International Publishing. 2014: 27–48.