Implementation 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, ACO
Abstract
The Travelling Salesman problem is one of the very main problems in Computer Science and Operations Research. It is used to evaluate the lowest cost of doing a work while covering the complete area. In this research article proposed work is a new approach which is simulated annealing and a genetic algorithm for solving Travelling Salesman Problem in order to gather the benefits of SA. Also it diminishes the time that GA spend fixed at local minima. The proposed algorithms tend to produce superior quality results in smallest amount of time.
Article Details
Unique Paper ID: 147040

Publication Volume & Issue: Volume 5, Issue 3

Page(s): 241 - 248
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