Results of 108 instances of 0-1knapsack problem solved by GA, BPSO, binABC, GTOA, RTEA and T-NBDE
Published: 30 August 2022| Version 2 | DOI: 10.17632/4wstd4dmbh.2
On the basis of five different algorithms for dealing with 0-1KP infeasible solutions, GA, BPSO, binABC, GTOA, RTEA and T-NBDE are used to solve four groups of 108 0-1KP instances. The calculation results (including best solution, worst section, average solution, standard deviation, average time, etc.) are given in 24 tables.
Hebei GEO University