%0 Journal Article
%T Ant colony optimization algorithm for the set covering problem
%A Schiff, Krzysztof
%J Technical Transactions
%V 2013
%R 10.4467/2353737XCT.14.004.1992
%N Automatic Control Issue 1-AC (2) 2013
%P 39-52
%K set covering problem, ant colony optimization, heuristic rule
%@ 0011-4561
%D 2013
%U https://ejournals.eu/en/journal/czasopismo-techniczne/article/ant-colony-optimization-algorithm-for-the-set-covering-problem
%X 
	This article describes a new hybrid ant colony optimization algorithms for the set covering problem. The problem is modeled by means of a bipartite graph. New heuristic patterns, which are used in order to choose a vertex to a created covering set have been incorporated into modified hybrid algorithms. Results of tests on investigated algorithms are discussed