The paper is devoted to the investigation of an ant colony algorithm which allows to increase the efficiency of the routing process in self-organized networks. This algorithm is successfully used to solve complex optimization problems like search and determination of the most suitable solution for optimizing the target function from a discrete set of possible solutions. In this paper, we consider the time of data delivery as a target function. We introduce a modification to the ant colony algorithm that prevents from establishing of premature loops.
展开▼
