Solving TSP using Genetic Algorithm and Nearest Neighbour Algorithm and their Comparison

@inproceedings{Arora2016SolvingTU,
  title={Solving TSP using Genetic Algorithm and Nearest Neighbour Algorithm and their Comparison},
  author={Khushboo Arora and Samiksha Agarwal and Rohit Tanwar},
  year={2016}
}
Travelling Salesman Problem is an intensively studied problem in the field of Combinatorial Optimization. Being an NP-Hard problem it is widely studied in the area of optimization. A problem is NP-Hard if its approximate solution is derived from the solution of NP problem, i.e. an algorithm that is used to solve NP problem can be modified to find the approximate solution to NP-hard problem.The main objective of TSP is to find the minimum distance by traversing each of the given set of cities… CONTINUE READING

Similar Papers

Loading similar papers…