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 aheuristic-based FA (HBFA) for computing optimaof discrete nonlinear optimization problems,where the discrete variables are of binary type. An important issue in FA is the formulation...
Main Author: | |
---|---|
Other Authors: | , , |
Format: | article |
Language: | eng |
Published: |
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/1822/30772 |
Country: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/30772 |