期刊
出版社
IEEE
DOI: 10.1109/cpee47179.2019.8949125
关键词
meta-heuristic algorithms; ant algorithm; routing; QoS
The paper is devoted to the study of an ant algorithm for increasing the efficiency of the routing process in networks with dynamically changing structure. This algorithm is successfully used to solve complex optimization problems: the search and determination of the most suitable solution for optimizing the target function from a discrete set of possible solutions. In the paper as a target function is considered the time of data delivery. The modification of an ant algorithm of routing, which prevents the implementation of premature cycles, is presented.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据