@inproceedings{771f33c3972b40deb18f74b5df13195f,
title = "A Binary Firefly Algorithm Applied to Knapsack Problem",
abstract = "The NP-hard problems are of interest in operations research and particularly the combinatorial problems. Therefore, the design of efficient algorithms that address these combinatorial problems are active lines of research. Inspired by the above, this article designs a binarization method so that continuous metaheuristics can solve combinatorial problems. The binarization method uses the concept of percentile. This method of percentile is applied to the firefly algorithm. The multidimensional knapsack problem (MKP) was used to verify our algorithm.",
keywords = "Combinatorial optimization, Metaheuristics, Multidimensional Knapsack problem",
author = "Hernan Pinto and Matias Valenzuela and Carlos Maureira and Luis Lopez and Andr{\'e}s Fern{\'a}ndez",
note = "Publisher Copyright: {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 10th Computer Science Online Conference, CSOC 2021 ; Conference date: 01-04-2021 Through 01-04-2021",
year = "2021",
doi = "10.1007/978-3-030-77445-5_35",
language = "English",
isbn = "9783030774448",
series = "Lecture Notes in Networks and Systems",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "376--385",
editor = "Radek Silhavy",
booktitle = "Artificial Intelligence in Intelligent Systems - Proceedings of 10th Computer Science On-line Conference, 2021",
}