Simulated Annealing Algorithm for the Multiple Choice Multidimensional Knapsack Problem

Implementation of simulated annealing algorithm for the multiple choice multidimensional knapsack problem. The multiple choice knapsack problem has n groups of items and m constraints. The objective is to choose one item from each group such that the total value (profit) is maximized while all of the m constraints are satisfied. The implementation is quite fast, and the code finds optimum or very close to optimum solutions in a very short duration.