Heuristic-Based Firefly Algorithm for Bound Constrained Nonlinear Binary Optimization

Abstract EN

Firefly algorithm (FA) is a metaheuristic for global optimization.

In this paper, we address the practical testing of a heuristic-based FA (HBFA) for computing optima of discrete nonlinear optimization problems, where the discrete variables are of binary type.

An important issue in FA is the formulation of attractiveness of each firefly which in turn affects its movement in the search space.

Dynamic updating schemes are proposed for two parameters, one from the attractiveness term and the other from the randomization term.

Three simple heuristics capable of transforming real continuous variables into binary ones are analyzed.

A new sigmoid “erf” function is proposed.

In the context of FA, three different implementations to incorporate the heuristics for binary variables into the algorithm are proposed.

Based on a set of benchmark problems, a comparison is carried out with other binary dealing metaheuristics.

The results demonstrate that the proposed HBFA is efficient and outperforms binary versions of differential evolution (DE) and particle swarm optimization (PSO).

The HBFA also compares very favorably with angle modulated version of DE and PSO.

It is shown that the variant of HBFA based on the sigmoid “erf” function with “movements in continuous space” is the best, in terms of both computational requirements and accuracy.