Markovian ants in a queuing system

Authors:
Ilija Tanackov;Dragan Simić;Siniša Sremac;Jovan Tepić;Sunčica Kocić-Tanackov
Affiliations:
Faculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia;Faculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia;Faculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia;Faculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia;Faculty of Technology, University of Novi Sad, Novi Sad, Serbia
Venue:
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part I
Year:
2010

Citing 4
Cited 2

A proof of convergence for Ant algorithms

Information Sciences—Informatics and Computer Science: An International Journal
Ant-based approach for determining the change of measure in importance sampling

Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Insect sensory systems inspired computing and communications

Ad Hoc Networks
The spatial pheromone signal for ant colony optimisation

IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning

The application of artificial intelligence hybrid in traffic flow

HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
Golden ratio (sectiona aurea) in markovian ants AI hybrid

ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.