Simulated Annealing for the Multiple Choice Multidimensional Knapsack Problem
Switch branches/tags
Nothing to show
Clone or download
Latest commit 2980910 Nov 10, 2018
Permalink
Failed to load latest commit information.
LICENSE Create LICENSE Nov 10, 2018
README.md Update README.md May 21, 2018
data.zip Add files via upload May 21, 2018
saMultiChoiceKnapsack.cpp Add files via upload May 21, 2018

README.md

Simulated Annealing Algorithm for the Multiple Choice Multidimensional Knapsack Problem

Shalin Shah

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.

Usage:
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