Review Paper on Genetic Algorithm and Simulated Annealing for solving Travelling Salesman Problem
Author(s):
Shivani Vats, Nikita Bakshi
Keywords:
Travelling Salesman Problem, Genetic Algorithm, Simulated Annealing, SAGA
Abstract
The Travelling Salesman problem is one of the very important problems in Computer Science and Operations Research. It is used to find the minimum cost of doing a work while covering the entire area or scope of the work in concern. In this paper we will review the past work done in solving the travelling salesman problem using two different techniques- genetic algorithm, simulated Annealing algorithm.
Article Details
Unique Paper ID: 147062

Publication Volume & Issue: Volume 5, Issue 3

Page(s): 272 - 275
Article Preview & Download




Go To Issue



Call For Paper

Volume 6 Issue 4

Last Date 25 September 2019


About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews

Contact Details

Telephone:8200 61 5067
Email: editor@ijirt.org
Website: ijirt.org

Policies