Implementation on Genetic Algorithm and Simulated Annealing for solving Travelling Salesman Problem

Shivani Vats; Nikita Bakshi

Implementation on Genetic Algorithm and Simulated Annealing for solving Travelling Salesman Problem

Authors: Shivani Vats, Nikita Bakshi

Unique Paper ID: 147040
Volume: 5
Issue: 3
PageNo: 241-248

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.

Download article

email to a friend

Cite This Article

ISSN: 2349-6002
Volume: 5
Issue: 3
PageNo: 241-248

Implementation on Genetic Algorithm and Simulated Annealing for solving Travelling Salesman Problem

Available:https://ijirt.org/Article?manuscript=147040

28 Feb, 2018

Potential of 2.7m2 Scheffler Reflector for Making Solar Powered Bricks in Indian Climatic Conditions

Impact Factor
8.01 (Year 2024)

UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now