tttocklll / knapsack

knapsack

0-1 knapsack solver using 2 metaheuristics

Metaheuristics

• Modified Discrete Shuffled Frog Leaping Algorithm (MDSFLA)
• Binary Fireworks Algorithm (BFWA)

References

• J. Xue, J. Xiao and J. Zhu, "Binary Fireworks Algorithm for 0-1 Knapsack Problem," 2019 International Conference on Artificial Intelligence and Advanced Manufacturing (AIAM), Dublin, Ireland, 2019, pp. 218-222, https://doi.org/10.1109/AIAM48774.2019.00051.
• Kaushik Kumar Bhattacharjee, S.P. Sarmah, "Shuffled frog leaping algorithm and its application to 0/1 knapsack problem," Applied Soft Computing, Volume 19, 2014, pp. 252-263, ISSN 1568-4946, https://doi.org/10.1016/j.asoc.2014.02.010.

Benchmarks

(in ./problem)

https://people.sc.fsu.edu/~jburkardt/datasets/knapsack_01/knapsack_01.html