基于新颖二进制人工蜂群算法求解 带权集合覆盖问题.

The weighted set covering problem (WSCP) is a famous NP-hard problem. In order to solve the WSCP efficiently by using artificial bee colony algorithm(ABC), this paper proposed a novel binary ABC(nBABC). In nBABC, it proposed a global evolution operator which combined random learning and inheritance to improve the global exploration ability of the algorithm. Secondly, based on the dynamic adjustment strategy, it proposed an adaptive random inversion operator to maintain the balance between exploration and development. Based on the idea of approximate algorithm, it proposed the repair algorithm WSCP-GRA and optimization algorithm WSCP-GOA for dealing with the infeasible solution of WSCP, on the basis of which a new method for solving WSCP was given by using nBABC. In order to verify the efficiency of nBABC in solving WSCP, using it to solve 45 WSCP instances in OR-Library. The comparison with several algorithms shows that nBABC can obtain the optimal values of all instances, which is more competitive than the existing algorithms for solving WSCP. [ABSTRACT FROM AUTHOR]