Traveling Salesman Problem Using Particle Swarm Optimization Algorithm

Title: Traveling Salesman Problem Using Particle Swarm Optimization Algorithm
Publisher: Guru Nanak Publications
ISSN: 2278-0947
Series: Volume 4 Issue 1
Authors: P.Vamshi Krishna, M. Omkarsharma


Abstract

The traveling salesman problem is one of the most frequently used real time problems. Many applications involve robot arm movement to fix the nuts in a large production environment, postal van services etc. Shortest path finding technique in a communication environment can be more beneficial by implementing the TSP – PSO in multithreaded environment. It is one of the combinatorial problems that comes under NPHard problems. NP-Hard problems are the problems which can be solved by a nondeterministic turing machine in polynomial time, that is, NP-Problems consume nonpolynomial amount of time. Particle Swarm Algorithm is one type of algorithm used to solve traveling salesperson problem which is somewhat better than genetic algorithms in certain parameters. If the PSO algorithm is applied in multicore processors with multi threading approach the overall performance of the system can be improved.

Keywords

Multithread, Particle swarm optimazation, Performance, Travelling salesman.

Download Full Text

(For complimentary copy, please contact Chief_editor@innovationjournals.com)