A novel binary artificial bee colony algorithm for the set-union knapsack problem

Open Webpage

Yi-Chao He, Haoran Xie, Tak-Lam Wong, Xizhao Wang

Published: 2018, Last Modified: 27 Jan 2026Future Gener. Comput. Syst. 2018EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights •A novel bee colony method based on the full mapping function is proposed.•Infeasible solutions are addressed by using a greedy strategy for Knapsack problems.•The method has better results than extant approximation algorithms to solve SUKP.•The proposed generic model can be integrated with other evolutionary algorithms.