Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{147062,
        author = {Shivani Vats and Nikita Bakshi},
        title = {Review Paper on Genetic Algorithm and Simulated Annealing for solving Travelling Salesman Problem},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {5},
        number = {3},
        pages = {272-275},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=147062},
        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.},
        keywords = {Travelling Salesman Problem, Genetic Algorithm, Simulated Annealing, SAGA},
        month = {},
        }