Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
type: Item
instance of: scholarly article
title: Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
zbMATH Open document ID: 1302.90259
DOI: 10.1155/2014/215182
author: M. Fernanda P. Costa
author: Ana Maria A. C. Rocha
author: Rogério B. Francisco
author: Edite M. G. P. Fernandes
published in: Advances in Operations Research
publication date: 2014-11-17T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6370020
Wikidata QID: Q57573519
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/215182
OpenAlex ID: W1988627973
cites work: A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
cites work: A novel differential evolution algorithm for binary optimization
cites work: Firefly Algorithms for Multimodal Optimization
cites work: Self-adaptive step firefly algorithm
cites work: A novel hybrid bat algorithm with harmony search for global numerical optimization
cites work: Modified firefly algorithm
cites work: An improved harmony search algorithm for solving optimization problems
cites work: Harmony Search Algorithms for binary optimization problems
cites work: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
DBLP publication ID: journals/advor/CostaRFF14
description: scientific article; zbMATH DE number 6370020