Solution of a Generalized Problem of Covering by means of a Generic Algorithm

Abstract

An algorithm of solution of a generalized problem of covering is offered. Generalization is made on the basis of subsets with diverse values of minimal summary weight of the given set. In difference from a standard problem of covering, this problem implies selection of particular covering, when rank sum of covering columns (from the covering matrix) gives the particular vector and corresponding values of this vector exceeds not a singular vector, but pre-existing vector b (with nonsingular components). Offered algorithm is based on a general genetic algorithm. It uses variable operator of non-standard mutation.