Skip to content

Latest commit

 

History

History
16 lines (14 loc) · 698 Bytes

README.md

File metadata and controls

16 lines (14 loc) · 698 Bytes

ukp

Unbounded Knapsack optimization problem solved with meta-heuristics

Heuristics and meta-heursitics used:
1- Weight-Ordered heuristic
2- Density-Ordered heuristic (*)
3- Density-Ordered extended heuristic
4- Total value heuristic (*)
5- Simulated Annealing meta-heuristic
6- Genetic Algorithm (*)
7- Ant Colony Algorithm



Note for contributors:

1/ The lines ended with (*) means they are already implemented or being contributed by another person.
2/ When you wish to contribute then, please, fork a new branch give it the name of the algorithm you are trying to implement and once finished commit the changes and raise a pull request to the master.