Bet algorithm is a search-algorithm metaheuristic inspired by Bet Theory to solve combinatorial optimization problems.
This particular code was developed and implemented by me in 2018 to solve the MKP (Multi-Dimensional Knapsack Problem).
The Multi-dimensional Knapsack problem is a generalisation of the traditional knapsack problem where your aim is to fill it in the best possible way. Each item has a value and occupy a space in the n different dimensions of the knapsack. The number of items is limited to these dimensions constraints and the ultimate goal is to get the most value out of the knapsack.
[1] DEMASI, P. HEURÍSTICAS BASEADAS EM APOSTAS PARA PROBLEMAS DE OTIMIZAÇÃO COMBINATÓRIA
[2] DRAKE, J. MKP Instances. http://www.cs.nott.ac.uk/~jqd/mkp/
[3] CHU, P. C.; BEASLEY, J. E. A genetic algorithm for the multiconstrained knapsack problem. Journal of Heuristics, [S.l.], n.4, p.63–86, 1998.