Correspondingly, we change the selection formula and pheromone update formula.
并且相应的修改概率选择公式和信息素更新公式。
In the process of implementation, the system is divided into pheromone update module of ants, next step node selection module of ants, random number generator modules and so on.
在实现过程中首先对系统进行模块划分，主要分为蚂蚁信息素更新模块，蚂蚁下步节点选择模块，随机数产生模块等。
In this paper, we present a cross-layer load-aware based ant colony optimization routing protocol with bi-directional and hop-by-hop pheromone update for ad hoc networks(CLABHPU).
本文将跨层优化和蚂蚁优化方法结合起来解决自组网中的负载均衡问题，提出了一种基于跨层负载感知和双向逐跳更新信息素的蚂蚁优化路由协议（CLABHPU）。
This new algorithm USES the history optimization information to update pheromone, avoids prematurity and accelerates the convergence of algorithm in later period.
该算法利用历史最优信息来更新信息素，避免出现早熟现象，加速算法的后期收敛。
In the algorithm, the pheromone is expressed by quantum bits, and quantum rotation gates are used to update the ant pheromone.
算法采用量子比特表示信息素，用量子旋转门来更新信息素。
In the algorithm, the pheromone is expressed by quantum bits, and quantum rotation gates are used to update the ant pheromone.
算法采用量子比特表示信息素，用量子旋转门来更新信息素。
应用推荐