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

Authors

  • Alfredo Silveira Araújo Neto Techway Informática Ltda.

DOI:

https://doi.org/10.5335/rbca.v15i2.13917

Keywords:

Evolutive computing, metaheuristics, combinatorial optimization

Abstract

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 whichmethods based on biological behaviors and evolutionary behaviors have been admitted to their resolution, this paper proposes the application of ameta-heuristic inspired by the ecological relationship of predation of the cat regarding themouse, to obtain approximate solutions to the 0-1multiple 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 reach solutions as suitable as those determined by other combinatorial optimization methods.

Downloads

Download data is not yet available.

Published

2023-07-27

Issue

Section

Original Paper

How to Cite

[1]
2023. Optimization inspired by the ecological interaction of cat predation regarding to the mouse applied to the 0-1 multiple knapsack problem. Brazilian Journal of Applied Computing. 15, 2 (Jul. 2023), 36–50. DOI:https://doi.org/10.5335/rbca.v15i2.13917.