TY - JOUR
TI - Ant colony optimization algorithm for the set covering problem
AU - Schiff, Krzysztof
TI - Ant colony optimization algorithm for the set covering problem
AB - 
	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
VL - 2013
IS - Automatic Control Issue 1-AC (2) 2013
PY - 2013
SN - 0011-4561
C1 - 2353-737X
SP - 39
EP - 52
DO - 10.4467/2353737XCT.14.004.1992
UR - https://ejournals.eu/en/journal/czasopismo-techniczne/article/ant-colony-optimization-algorithm-for-the-set-covering-problem
KW - set covering problem
KW - ant colony optimization
KW - heuristic rule