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. © 2012 Springer-Verlag.
CITATION STYLE
Atanassova, V., Fidanova, S., Chountas, P., & Atanassov, K. (2012). A generalized net with an ACO-algorithm optimization component. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7116 LNCS, pp. 190–197). https://doi.org/10.1007/978-3-642-29843-1_21
Mendeley helps you to discover research relevant for your work.