Combinatorial problems with NP-hard complexity appear frequently in operational research. Making robust algorithms that solve these combinatorial problems is of interest in operational research. In this article, a binarization mechanism is proposed so that continuous metaheuristics can solve combinatorial problems. The binarization mechanism uses the concept of percentile. This percentile mechanism is applied to the bat algorithm. The NP-hard knapsack problem (MKP) was used to verify our algorithm. Additionally, the binary percentile algorithm was compared with other algorithms that have recently has solved the MKP, observing that the percentile algorithm produces competitive results.
CITATION STYLE
Jorquera, L., Villavicencio, G., Causa, L., Lopez, L., & Fernández, A. (2020). A Binary Bat Algorithm Applied to Knapsack Problem. In Advances in Intelligent Systems and Computing (Vol. 1225 AISC, pp. 172–182). Springer. https://doi.org/10.1007/978-3-030-51971-1_14
Mendeley helps you to discover research relevant for your work.