Ant colony optimization approach to tokens' movement within generalized nets

Authors:
Vassia Atanassova;Krassimir Atanassov
Affiliations:
IICT, Bulgarian Academy of Sciences, Sofia, Bulgaria;CLBME, Bulgarian Academy of Science, Sofia, Bulgaria
Venue:
NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
Year:
2010

Citing 3
Cited 1

Generalized Nets

Generalized Nets
Ant Colony Optimization

Ant Colony Optimization
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

On a game-method for modelling with intuitionistic fuzzy estimations: part 1

LSSC'11 Proceedings of the 8th international conference on Large-Scale Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.