A restart local search algorithm for solving 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.
KeywordsRandom restart Neighborhood search Maximum set k-covering problem
We would like to thank the anonymous referees for their helpful comments. This work was supported in part by NSFC under Grant Nos. (61402196, 61272208, 61672261, 61133011, 61170092, 61003101) and the China Postdoctoral Science Foundation under Grant No. 2013M541302.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflicts of interest to this work. We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.
- 1.Saha B, Getoor L (2009) On maximum coverage in the streaming model & application to multi-topic blog-watch. SDM 9:697–708Google Scholar
- 3.Chierichetti F, Kumar R, Tomkins A (2010) Max-cover in map-reduce. In: Proceedings of the 19th international conference on World wide web. ACM, 2010: 231–240Google Scholar
- 4.Yu H, Yuan D (2013) Set coverage problems in a one-pass data stream. In: Proceedings of the 2013 SIAM international conference on data mining, pp 758-766Google Scholar
- 5.Stergiou S, Tsioutsiouliklis K (2015) Set cover at web scale. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, 2015: 1125–1133Google Scholar
- 6.Dasgupta A, Ghosh A, Kumar R et al (2007) The discoverability of the web. In: Proceedings of the 16th international conference on World Wide Web. ACM, 2007: 421–430Google Scholar
- 7.Yiyuan W, Jianan W (2016) An effective local search algorithm for a special hitting set problem. Transylv Rev 24(80):1–12Google Scholar
- 23.Shin K, Jung J, Lee S et al (2015) BEAR: block elimination approach for random walk with restart on large graphs. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data. ACM, 2015: 1571–1585Google Scholar
- 28.Ruizhi L, Shuli H, Yiyuan W, Minghao Y, A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem. Neural Comput Appl. doi: 10.1007/s00521-015-2172-9
- 30.Wang Y, Cai S, Yin M (2016) Two efficient local search algorithms for maximum weight clique problem. Thirtieth AAAI Conf Artif Intell, pp 805–811Google Scholar
- 37.Wang Y, Ouyang DT, Zhang L et al (1007) A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity. Sci China Inf Sci 2015:10Google Scholar
- 40.Zhangjie F, Xingming S, Qi L et al (2015) Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans Commun 98(1):190–200Google Scholar
- 41.Ren YJ, Shen J, Wang J et al (2015) Mutual verifiable provable data auditing in public cloud storage. J Internet Technol 16(2):317–323Google Scholar
- 42.Tinghuai MA, Jinjuan Z, Meili T et al (2015) Social network and tag sources based augmenting collaborative recommender system. IEICE Trans Inf Syst 98(4):902–910Google Scholar