Results of 108 instances of 0-1knapsack problem solved by GA, BPSO, binABC, GTOA, RTEA and T-NBDE
收藏Mendeley Data2024-03-27 更新2024-06-26 收录
下载链接：
https://data.mendeley.com/datasets/4wstd4dmbh
下载链接
链接失效反馈官方服务：
资源简介：
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.
创建时间：
2024-01-23
