A restart local search algorithm for solving maximum set k-covering problem

作者：Wang, Yiyuan; Ouyang, Dantong; Yin, Minghao; Zhang, Liming; Zhang, Yonggang^*

来源：Neural Computing & Applications, 2018, 29(10): 755-765.

DOI：10.1007/s00521-016-2599-7

• Random restart
• Neighborhood search
• Maximum set k-covering problem

The maximum set k-covering problem (MKCP) is a famous combinatorial optimization problem with widely many practical applications. In our work, we design a restart local search algorithm for solving MKCP, which is called RNKC. This algorithm effectively makes use of several advanced ideas deriving from the random restart mechanism and the neighborhood search method. RNKC designs a new random restart method to deal with the serious cycling problem of local search algorithms. Thanks to the novel neighborhood search method that allows a neighborhood exploration of as many feasible search areas as possible, the RNKC can obtain some greatly solution qualities. Comprehensive results on the classical instances show that the RNKC algorithm competes very favorably with a famous commercial solver CPLEX. In particular, it discovers some improved and great results and matches the same solution quality for some instances.

• 出版日期2018-5
• 单位东北师范大学; 吉林大学