2011 | OriginalPaper | Buchkapitel
Ant Colony Optimization Approach to Tokens’ Movement within Generalized Nets
verfasst von : Vassia Atanassova, Krassimir Atanassov
Erschienen in: Numerical Methods and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Generalized Nets (GNs) is a concept, extending the concept of Petri Nets and the rest of its modifications: an apparatus for modelling of parallel and concurrent processes. GNs have been applied to modelling of processes in the field of artificial intelligence, and in particular to metaheuristic methods for solving of optimizational problems, like the transportational problem, the travelling salesman problem, the knapsack problem, etc. An important venue of application of GNs is the area of Ant Colony Optimization (ACO). So far, GNs have been used as a method for description of the ACO procedures. The present article for the first time adopts the opposite approach: it discusses the possibility for optimization of the GN tokens’ movement, using ACO algorithms.