Hybrid Algorithm Based on Max And Min Ant System And Particle Swarm Optimization for Solving TSP Problem

摘要

A hybrid algorithm which combines ant colony optimization algorithm and particle swarm optimization algorithm (ACO-PSO) is proposed to solve travelling salesman problem. Max-Min Ant System, whose parameters are optimized by PSO, is utilized to solve the problems. Massive of benchmark problems are utilized to test the performance of proposed algorithm.