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.
Change the global variable ANNEALING_ITERATIONS to change the number of iterations that the algorithm runs for.
The algorithm requires a "data.dat" file in the current directory in the format specified by ftp://cermsem.univ-paris1.fr/pub/CERMSEM/hifi/MMKP/MMKP.html
Instances are available here - ftp://cermsem.univ-paris1.fr/pub/CERMSEM/hifi/MMKP/MMKP.html