Skip to content

Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem
Compare
Choose a tag to compare
@shah314 shah314 released this 19 Jul 02:55
· 92 commits to master since this release
v1.4
180006b
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Learn about vigilant mode.

(Added paper) (Added data.DAT) (Added Java Implementation) A genetic algorithm implementation for the multidimensional knapsack problem. The multi-constraint (or multidimensional) knapsack problem is a generalization of the 0/1 knapsack problem. The multi-constraint knapsack problem has m constraints and one objective function to be maximized while all the m constraints are satisfied.

The implementation is similar to the one described in [Chu98], but it's significantly different. It uses Lagrangian multipliers as constraint weights and compared to the paper, it finds close to optimum solutions much faster. (Convergence can be controlled using the parameters).

Assets 2
Loading