基于蚁群和粒子群优化的混合算法求解TSP问题

Solving Traveling Salesman Problems by an ACO-and-PSO-Based Hybrid Algorithm

提出了一种基于蚁群优化和粒子群优化的混合算法求解TSP(Traveling Salesm an Prob lem)问题。在应用蚁群算法对TSP问题的求解过程中,利用粒子群算法对蚁群系统的参数进行优化,其目的是提高蚁群系统的优化性能,使蚁群系统的参数不必靠人工经验或反复试验选取,而是通过粒子搜索自适应选取。

A hybrid algorithm is presented to solve traveling salesman problems based on ACO （Ant Colony Optimization） and PSO （Particle Swarm Optimization）. In the proposed algorithm, the PSO is used to optimize the parameters in the ant colony system to improve the performance of the ACO, which makes the parameter selection for the ACO do not depend on artificial experience or repeating trials, but Ely on the self-adaptive search of the particles in the PSO.