Particle Swarm Optimization Algorithm Based on Traveling Salesman Problem
Yun Wu · Microcomputer Information · 2012
Traveling Salesman Problem is a class of discrete and Non-deterministic Polynomial complete combinatorial optimization problem.It has widely applied and numerous methods for solving.This paper introduces using Particle Swarm Optimization Algorithm for solving TSP problem,and compare with Simulated Annealing Algorithm and Genetic Algorithm.Through the analysis of experiment results,explains the Particle Swarm Optimization Algorithm is effectiveness and feasibility in solving large-scale combinatorial optimization problems.