Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
DOI10.1155/2014/215182zbMATH Open1302.90259DBLPjournals/advor/CostaRFF14OpenAlexW1988627973WikidataQ57573519 ScholiaQ57573519MaRDI QIDQ471708FDOQ471708
Authors: M. Fernanda P. Costa, Ana Maria A. C. Rocha, Rogério B. Francisco, Edite M. G. P. Fernandes 
Publication date: 17 November 2014
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/215182
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30)
Cites Work
- An improved harmony search algorithm for solving optimization problems
- Firefly Algorithms for Multimodal Optimization
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Self-adaptive step firefly algorithm
- Modified firefly algorithm
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- A novel hybrid bat algorithm with harmony search for global numerical optimization
- A novel differential evolution algorithm for binary optimization
- Harmony search algorithms for binary optimization problems
Cited In (5)
- Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization
- Putting continuous metaheuristics to work in binary search spaces
- A novel \(x\)-shaped binary particle swarm optimization
- Binarization of the swallow swarm optimization for feature selection
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
This page was built for publication: Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471708)
