摘要
针对基本蚁群算法搜索时间长,易产生停滞现象等缺点,提出一种求解旅行商问题的改进最大最小蚁群算法.通过对有优质解的蚂蚁个体所走路径的信息素τ的最大最小值进行固定及信息素的更新方式的改变,可以避免在算法运行过程中信息素轨迹的差异过大.仿真结果表明,该改进算法有更高的执行效率和更好的计算稳定性.
Basic ant colony algorithm to search for a long time,easy to produce stagnation and other shortcomings.We presents a modified algorithm for solving traveling salesman（TSP） problem by use of max-min ant colony algorithm.Solution through a high-quality individuals are taking the path of ants pheromone the maximum and minimum for fixed and update the pheromone change in the way,can easily be avoided during the operation in the algorithm the pheromone path difference is too large.Simulation results show that the improved algorithm has higher efficiency and better stability of the calculation.
出处
《西安工程大学学报》
CAS
2010年第6期818-821,共4页
Journal of Xi’an Polytechnic University
关键词
蚁群算法
旅行商问题
优质解
最大最小化
ant colony algorithm
traveling salesman problem（TSP）
quality solutions
max-min
