Swarm intelligence heuristic algorithm is used to solve discounted {0-1} knapsack problem(D{0-1} KP). In order to improve the solution efficiency and quality, a repair and optimization strategy is needed to convert abnormal coding individuals into coding individuals that meet the solution constraints. On the basis of introducing the concept of group value density, taking particle swarm optimization algorithm(PSO) as an example, this paper proposed a set of greedy repair and optimization methods based on group(GGROA), and further constructed the PSO based GGROA for solving D{0-1}KP algorithm(PSO-GGRDKP) to explore the feasibility and performance of GGROA. PSO-NGROADKP and PSO-GRDKP were PSO algorithms based on item greedy repair and optimization method. The experimental results on D {0-1} KP standard data set show that compared with PSO-NGROADKP and PSO-GRDKP, PSO-GGRDKP has slightly higher error rate, but the time performance of the algorithm is improved by 13.8% and 12.9% respectively.

[2022-03-22] Accepted Paper /doc/2021.12.0701/v1

[2022-08-05] Printed Article /doc/2021.12.0701/v2