An effective binary artificial bee colony algorithm for maximum set k-covering problem

作者：

Highlights：

• A hybrid binary artificial bee colony algorithm is proposed.

• A new food source updating method is developed.

• Using a tabu search based simulated annealing to improve solution quality.

• Bucket sorting technique is employed to speed up the search.

• We find new best solutions for several instances.

摘要

•A hybrid binary artificial bee colony algorithm is proposed.•A new food source updating method is developed.•Using a tabu search based simulated annealing to improve solution quality.•Bucket sorting technique is employed to speed up the search.•We find new best solutions for several instances.

论文关键词：Maximum set k-covering problem,Artificial bee colony algorithm,Local search,Heuristic,Binary programming

论文评审过程：Received 12 January 2020, Revised 28 April 2020, Accepted 1 July 2020, Available online 10 July 2020, Version of Record 25 July 2020.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.113717