A generalized net with an ACO-algorithm optimization component

In the paper we describe a generalized net G ACOA realizing an arbitrary algorithms for ant colony optimization. In this sense, this net is universal for all standard algorithms for ant colony optimization, since it describes the way of functioning and results of their work. Then, we discuss the way of constructing a GN that includes the G ACOA as a subnet. In this way, we ensure the generalized net tokens’ optimal transfer with regard to the results of G ACOA . Thus, we construct a generalized net, featuring an optimization component and thus optimally functioning