Firefly Algorithm for optimization problems with non-continuous variables: A Review and Analysis

February 25, 2016 ยท The Cartographer ยท ๐Ÿ› arXiv.org

๐Ÿ“š THE CARTOGRAPHER: The Cartographer
Survey/review paper โ€” maps the landscape rather than implementing a method.

"No code URL or promise found in abstract"
"Title-pattern auto-detect: Firefly Algorithm for optimization problems with non-continuous variables: A Review and Analysis"

Evidence collected by the PWNC Scanner

Authors Surafel Luleseged Tilahun, Jean Medard T Ngnotchouye arXiv ID 1602.07884 Category cs.NE: Neural & Evolutionary Citations 4 Venue arXiv.org Last Checked 3 days ago
Abstract
Firefly algorithm is a swarm based metaheuristic algorithm inspired by the flashing behavior of fireflies. It is an effective and an easy to implement algorithm. It has been tested on different problems from different disciplines and found to be effective. Even though the algorithm is proposed for optimization problems with continuous variables, it has been modified and used for problems with non-continuous variables, including binary and integer valued problems. In this paper a detailed review of this modifications of firefly algorithm for problems with non-continuous variables will be discussed. The strength and weakness of the modifications along with possible future works will be presented.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Neural & Evolutionary

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

LSTM: A Search Space Odyssey

Klaus Greff, Rupesh Kumar Srivastava, ... (+3 more)

cs.NE ๐Ÿ› IEEE TNNLS ๐Ÿ“š 6.0K cites 11 years ago