论文部分内容阅读
该文提出限制范围的Max-Min蚁群算法解决最短路径问题.该算法不易陷入局部搜索最优,并且利用实际交通网络的空间分布特性,合理限制算法的搜索区域,能较快收敛到全局最优解.“,”The MAX-MIN Ant Colony algorithm which restricts the searching area is used for the shortest path problem. The algorithm can not easily run into the local optimum. The algorithm also uses the spatial distribution feature of the real road network to restrict the searching area reasonably. It can converge at the global optimum quickly.