Skip to content

michalK00/GeneticAlgorithmForBinaryKnapsackProblem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Genetic Algorithm For Binary Knapsack Problem

Project created as part of the Effective Progamming Techniques course. This is a genetic algorithm that solves the binary knapsack problem. The data is taken from a file, or directly from the program itself.

Template for the input file:

NumberOfItems BackPackSize
FirstItemValue FirstItemSize
SecondItemValue SecondItemSize
...

and so on...
Here's an example:

5 126
44 92
46 4
90 43
72 83
91 84

About

Genetic algorithm that solves the binary knapsack problem

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages