International Journal of Scientific and Research Publications

About Us
Editorial Board

Online Publication

Review Process
Publication Ethics

Call For Papers

Call for Research Paper


Online Submission
Paper Submission Guidelines
Online Publication Charge
Print Publication Charge
How to publish research paper
Publication Certificate
Research Catalogue


Join Reviewer Panel
Reviewer Guidelines

IJSRP Publications

Print Journal


IJSRP Paper Format

Contact Us

Feedback Form
Contact Us
Site Map

IJSRP, Volume 8, Issue 12, December 2018 Edition [ISSN 2250-3153]

      Thi Thi Htun

Abstract: Travelling Salesman Problem (TSP) is one of the best known NP-hard problems. It is also a classic tour problem in which a hypothetical salesman must find the most efficient sequence of destinations in his territory, stopping only once at each, and ending up at the initial starting location. To handle with this problem there is no suitable algorithm that solves it in polynomial time. Many algorithms were applied to solve TSP with more or less success. There are many ways to classify algorithms, each with its own merits. This paper is a review on various algorithms like Ant Colony Optimization Algorithms (ACO), Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) available with respective attributes to find the nearest optimal solution for the traveling salesman problem. It also relates the traveling salesman problem with the available algorithms and provides the advantages in providing a solution for TSP.

[Reference this Paper]   [BACK]

Ooops! It appears you don't have a PDF plugin for this barrPostingser. you can click here to download the PDF file.

Reference this Research Paper (copy & paste below code):

Thi Thi Htun (2018); A Survey Review on Solving Algorithms for Travelling Salesman Problem (TSP); International Journal of Scientific and Research Publications (IJSRP) 8(12) (ISSN: 2250-3153), DOI:



About Us
Editorial Board
Call for Paper

Call for Research Paper
Paper Status
IJSRP Paper Format
Join Us

Download e-journal
Join Forum
Invite Friends
Get Social with Us!

Copyright © 2011-2021, IJSRP Inc., All rights reserved.