改进的蚁群算法在TSP问题中的应用  

On application of reformed ant colony algorithm in TSP problems

作　　者：杨仲坡[1] 辛立民[1] 魏云[1] 

机构地区：[1]安徽理工大学

出　　处：《山西建筑》2010年第8期9-10,共2页Shanxi Architecture

摘　　要：应用基本蚁群算法来求解TSP问题,在算法中引入去交叉策略,降低其计算复杂度,仿真算例表明,该方法能有效加快局部搜索能力,加快了大规模TSP问题的求解。The problem of TSP was resolved by the apply the basic ant colony algorithm, cross-cutting strategy was pulled into the algorithm, the computational complexity was reduced. The simulation case was showed that the local search capabilities can be effectively speeded up by this method, the solution of large-scale TSP problems was speeded up.

关 键 词：蚁群算法 TSP 复杂度 大规模 

分 类 号：TU984.191[建筑科学—城市规划与设计]