Results of 108 instances of 0-1knapsack problem solved by GA, BPSO, binABC, GTOA, RTEA and T-NBDE

Published: 25 July 2022| Version 1 | DOI: 10.17632/4wstd4dmbh.1
Contributor:
He Yichao

Description

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.

Files

Institutions

Hebei GEO University

Categories

Decision Problem

License