Review Paper on Genetic Algorithm and Simulated Annealing for solving Travelling Salesman Problem

  • Unique Paper ID: 147062
  • Volume: 5
  • Issue: 3
  • PageNo: 272-275
  • 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.
email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 5
  • Issue: 3
  • PageNo: 272-275

Review Paper on Genetic Algorithm and Simulated Annealing for solving Travelling Salesman Problem

Related Articles