Universal Generalized Net Model for Description of Metaheuristic Algorithms: Verification with the Bat Algorithm

In the present paper, the apparatus of generalized nets is used to describe the metaheuristic technique Bat algorithm. Generalized nets are considered an effective and appropriate tool for description of the logics of different optimization techniques. As a result, the developed generalized net model executes the Bat algorithm procedures, conducting basic steps and performing optimal search. The paper elaborates on the already proposed Universal generalized net model for description of the population-based metaheuristic algorithms, which was used so far to model the Cuckoo search, Firefly algorithm and Artificial bee colony optimization, and is used here for modelling of Bat algorithm. It is shown that the Bat algorithm can be described in terms of Universal generalized net model by only varying the characteristic functions of the tokens. Thus, verification of the Universal generalized net model is performed.