Abstract
The unicost set covering problem is a NP-hard and it has many applications. In this paper we propose a new algorithm based on local search for solving the unicost set covering problem. A fitness function is proposed for this problem and different neighborhood relations are considered for the exploration of the neighborhood of the current solution. A new approach is introduced for effective exploration of the neighborhood during the improvement phase. This approach is based on the upper bound of the best cover, which is found during the search, and using only determined moves. Additionally, in order to avoid cycles during the search, a search history is used. The proposed algorithm is experimentally evaluated for 85 well-known random and combinatorial problems in the literature, and it gives very satisfactory results in a reasonable amount of time. The proposed algorithm improves the best existing solutions for 8 problems in the literature. For a class of combinatorial problems, the best existing results are improved significantly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Mathematical Programming 12, 37–60 (1980)
Beasley, J.E.: An algorithm for set covering problems. European Journal of Operational Research 31, 85–93 (1987)
Beasley, J.E.: A lagrangian heuristic for set covering problems. Naval Research Logistics 37, 151–164 (1990)
Beasley, J.E., Chu, P.C.: A genetic algorithm for set covering problem. European Journal of Operational Research 94, 392–404 (1996)
Bodlaender, H.L.: Discovering treewidth. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 1–16. Springer, Heidelberg (2005)
Chvátal, V.: A greedy heuristic for the set-covering problem. Math. of Oper. Res. 4(3), 233–235 (1979)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C. (eds.): Introduction to Algorithms, 2nd edn. The MIT Press, Massachusetts (2001)
Fulkerson, D.R., Nemhauser, G.L., Trotter, L.E.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of steiner triple systems. Mathematical Programming Study 2, 72–81 (1974)
Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Dordrecht (1997)
Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural csp decomposition methods. Artificial Intelligence 124(2), 243–282 (2000)
Grossman, T., Wool, A.: Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research 101, 81–92 (1997)
Kinney, G., Barnes, J.W., Colleti, B.: A group theoretic tabu search algorithm for set covering problems (2004), Working paper, available from: http://www.me.utexas.edu/~barnes/research/
Marchiori, E., Steenbeek, A.: An iterated heuristic algorithm for the set covering problem. In: Proceedings of WEA 1998, Germany (1998)
Nonobe, K., Ibaraki, T.: A tabu search approach to the constraint satisfaction problem as a general problem solver. European Journal of Operational Research 106, 599–623 (1998)
Odijk, M.A., van Maaren, H.: Imporved solutions for the steiner triple covering problems. Technical Report, TU Delft University, 11, 1996 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Musliu, N. (2006). Local Search Algorithm for Unicost Set Covering Problem. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_34
Download citation
DOI: https://doi.org/10.1007/11779568_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35453-6
Online ISBN: 978-3-540-35454-3
eBook Packages: Computer ScienceComputer Science (R0)