Review Paper on Genetic Algorithm and Simulated Annealing for solving Travelling Salesman Problem
Shivani Vats, Nikita Bakshi
Travelling Salesman Problem, Genetic Algorithm, Simulated Annealing, SAGA
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

Share This Article

Join our RMS

Conference Alert

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

Call For Paper

Volume 11 Issue 1

Last Date for paper submitting for Latest Issue is 25 June 2024

About Us enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on

Social Media

Google Verified Reviews