A Machine Learning Whale Algorithm Applied to the Resource Allocation Problems

Abstract

Combinatorial optimization problems appear frequently in the areas of engineering and science. A significant number of these problems are of the NP-hard type, therefore when the problem grows, it is difficult to be addressed by complete techniques. This motivates the design of binary or discrete algorithms using continuous metaheuristic techniques. Particularly in the area of swarm intelligence, there are a large number of algorithms that work in continuous spaces and which can be adapted to solve binary or discrete problems. In this article, we use a general binarization mechanism based on the k-means technique to solve the multidimensional knapsack problem (MKP). Design experiments to demonstrate the practicality of the k-means technique in binarization.