Planned intervention: On Wednesday April 3rd 05:30 UTC Zenodo will be unavailable for up to 2-10 minutes to perform a storage cluster upgrade.

There is a newer version of the record available.

Published July 19, 2019 | Version v1.2
Software Open

shah314/gamultiknapsack: Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem

Creators

  • 1. Target

Description

(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).

Files

shah314/gamultiknapsack-v1.2.zip

Files (98.7 kB)

Name Size Download all
md5:ed289941ac4fac74dd7110db9b023d30
98.7 kB Preview Download

Additional details

Related works