An Analysis of various techniques to solve Travelling Salesman Problem: A Review
Main Article Content
Abstract
Travelling Salesman problem is a nondeterministic polynomial time hard problem in combinatorial optimization studied in operational research and theoretical computer science. In this review paper several techniques like brute-force method, nearest neighbour, branch and bound, dijkstra shortest path algorithm, bellman ford, Floyd warshall algorithm and some heuristic techniques like ant colony optimization and genetic algorithm used to solve the travelling salesman problem are analysed. The comparison between these techniques is accomplished to state which is the better one for solving travelling salesman problem.
Keywords: Travelling Salesman Problem (TSP), Shortest Path Algorithm, Hamiltonian cycle Ant Colony Optimization (ACO), Genetic Algorithm (GA), Pheromone, Particle Swarm Optimization (PSO)
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.