In this paper, a new routing approach based on discrete particle swarm optimization algorithm is briefly discussed to obtain the optimum path between two nodes in the network.
针对不同的网络实际条件，提出一种改进的离散粒子群算法来寻找网络中任意两个节点间的最优路由。
In this paper, a new routing approach based on discrete particle swarm optimization algorithm is briefly discussed to obtain the optimum path between two nodes in the network.
针对不同的网络实际条件，提出一种改进的离散粒子群算法来寻找网络中任意两个节点间的最优路由。
应用推荐