基于蚁群算法求解TSP

蚁群算法是通过模拟蚂蚁觅食而发展出的一种新的启发式算法,被广泛地用于解决组合优化问题,它是新兴的仿生进化算法,具有并行计算、正反馈等特点,具有较强的发现问题的能力,在许多领域得到应用。文章应用蚁群算法求解TSP问题,分析了蚁群算法的原理、特征、参数及求解TSP问题的具体实现步骤。

Solving TSP Based on Ant Colony Algorithm

Ant colony algorithm （ACA） is a new heuristic algorithm . It is developed through simulating the process of ants searching for food and has been widely applied to solving complicated combinatorial optimization problems. It is a new bionic evolution algorithm, having characteristics such as parallel computing, positive feedback the stronger ability of finding problems, In many fields it is applied. The paper uses ant colony algorithm to solve TSP, and analyses the principle , characteristic, parameter of ant colony algorithm, detailed steps.