Review of different heuristic algorithms for solving Travelling Salesman Problem
Main Article Content
Abstract
Travelling Salesperson Problem (TSP) is one of the leading problems that are considered as an NP-hard. To tackle with this problem we don’t have any best suitable algorithm that solves it in polynomial time. Although we have certain algorithms that gave better results. This paper reviews the heuristic algorithms which are used to solve the problem & account for optimal solution in case of smaller problem size & give sub-optimal solution for bigger problem size. A survey for each & every strategy used for solving TSP i.e. how they are modified with time & corresponding results obtained as per the modification. Here we take into account well recognized heuristic algorithms which are genetic algorithm, ant colony optimization, particle swarm optimization.
Downloads
Download data is not yet available.
Article Details
Section
Articles
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.