Heuristic-Based Firefly Algorithm for Bound Constrained Nonlinear Binary Optimization
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 formula...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2014-01-01
|
| Series: | Advances in Operations Research |
| Online Access: | http://dx.doi.org/10.1155/2014/215182 |