Skip to content

Latest commit

 

History

History
36 lines (21 loc) · 533 Bytes

README.md

File metadata and controls

36 lines (21 loc) · 533 Bytes
Raw

Binary Knapsack Problem

Solution to binary Knapsack problems using metaheuristic approaches.

Metaheuristics

  1. Genetic Algoritm (GA)

  2. Global-Harmony Search (GHS)

  3. Particle Swarm Optimization (PSO)

  4. Grey Wolf Optimizer (GWO)

Run

Install dependencies

First recomend create a virtual enviroment.

pip3 install -r requirements.txt

Run app

python3 main.py Knapsack6

Knapsack problems

List of knapsack problems in knapsack/data/

  1. f1, ..., f10
  2. Knapsack1, ..., Knapsack6