The binarization mechanisms of continuous metaheuristics are of interest in operational research. This is mainly due to the fact that there are a lot of combinatorial problems that are NP-hard. In this article, we exploit the concept of percentile as a mechanism of binarization of swarm intelligence continuous metaheuristics. To evaluate the behavior of our binary operator, the Multi-verse metaheuristic is used and applied to solve the combinatorial problem of the knapsack. The binary algorithm obtained, the binary multi-verse Optimizer (BMVO) shows good performance in solving the most difficult problems of the knapsack.
|Journal||Journal of Information Systems Engineering and Management|
|State||Published - 2019|
- multidimensional knapsack problem