Optimization inspired by the ecological interaction of cat predation regarding to the mouse applied to the 0-1 multiple knapsack problem

Classified as a combinatorial optimization problem NP-hard, which in general expends an unacceptable computational effort when determining optimal and exact solutions, the knapsack problem, as well as its variations, has usually been approached through heuristic and meta-heuristic algorithms, able to establish approximately optimal results at an acceptable processing cost. Therefore, and considering the assiduity with which methods based on biological behaviors and evolutionary behaviors have been admitted to their resolution, this paper proposes the application of a meta-heuristic inspired by the ecological relationship of predation of the cat regarding the mouse, to obtain approximate solutions to the 0-1 multiple knapsack problem, and observes, through an empirical evaluation that included a non -parametric statistical analysis of the results, that the suggested algorithm was able to compute equivalent or more adequate solutions than those determined by other combinatorial optimization methods.