搜索资源列表
DynamicantcolonyoptimisationforTSP
- 从基本蚁群算法出发,基于 *+,(-./012345 6/2167/4 8.9:217)的邻域结构,提出了一种改进的优 化算法,给出了具体的算法步骤-from basic ant algorithm, based on *, (6/2167/4 8.9:217 greater measurement error) the neighborhood structure, propose an improved algorithm, the concrete steps Algorithm
TSPisaproblemofcombinatio
- [%] 基本蚁群算法 的不足主要表现在算法收敛速度慢,系统开销大-[%] Ant basic algorithm of the main performance in slow convergence, large overhead system
