【摘要】 在目前求解TSP问题效果最好的混合算法——最大最小蚂蚁算法和3-opt局部搜索算法的基础上,提出了一种改进的混合蚂蚁算法。算法前期使用局部搜索的解初始化信息素矩阵,加快收敛速度,后期依Metropolis接受准则概率接受局部优化解,有效地避免陷入局部最优,自适应的信息素调节机制使算法更加灵活,而K近邻候选集则使之适应大规模问题求解,理论分析和TSPLIB中部分实例仿真结果表明,此算法能比其他改进蚁群算法具有更多优越性。更多还原

【Abstract】 This paper presents IHAS,an improved hybrid algorithm combines Max-Min Ant System(MMAS) with a local search strategy.IHAS also uses adaptive pheromone trail information,neighbourhood candidate list and Metropolis rules to instruct solutions,which can speed up convergence,avoid local optimization and solve scalable instances.Theory analysis and experimental result show that IHAS outperforms other hybrid ant colony algorithms due to its ability to find the satisfactory results effectively when applied to the Traveling Salesman Problem.更多还原