Title: Particle Swarm Optimization Algorithm for Traveling Salesman Problem Program Design
Abstract: Particle swarm optimization algorithm with the global searching abilities is one of the swarm intelligence algorithms.For solving the traveling salesman problem(TSP) that is one of the discrete and NP-complete combinatorial optimization problems,the paper intro-duced two improved methods and the ideas of the main program designing.Comparing with genetic algorithm for the 20 city numbers TSP problem,the experiment results show the effectiveness and efficiency of the proposed method.
Publication Year: 2009
Publication Date: 2009-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot