Markovian Ants in a Queuing System

被引:0
|
作者
Tanackov, Ilija [1 ]
Simic, Dragan [1 ]
Sremac, Sinisa [1 ]
Tepic, Jovan [1 ]
Kocic-Tanackov, Suncica [2 ]
机构
[1] Univ Novi Sad, Fac Tech Sci, Trg Dositeja Obradovica 6, Novi Sad 21000, Serbia
[2] Univ Novi Sad, Fac Technol, Novi Sad 21000, Serbia
关键词
Pheromone signal; probability; convolution; PHEROMONE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The synthesis of memoryless Markovian systems and Ant based concept with memory characteristics of deposit pheromone is the basis for the presented artificial intelligence hybrid. Only the initial elements of the system are specified in this paper by illustrating the routes of two ants. The pheromone capacity was first modelled as an exponential-type random variable. The Ant Queueing System was formed. The pheromone capacity was then used to form two independent exponential random variables. The convolution of these variables induces significant quality and quantity changes, mainly the decrease in entropy. The study also provides a possible method for dealing with stationary queueing systems when we are familiar with the state probability and the arrival rate and service rate are unknown.
引用
收藏
页码:32 / +
页数:3
相关论文
共 50 条