Set covering on the basis of the ant algorithm

Abstract

The set coverings problem using mathematical methods in which principles of natural mechanisms of solution-making are proposed. For compact representation of the set covering solution the matrix of boundary requirements is used. This allowed forming the space of solutions in which frameworks the search process which is based on simulation of adaptive ant colony behavior is organized. In comparison with existing algorithms improvement of results is reached.