A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Solving Travelling Salesman Problem (TSP) by Hybrid Genetic Algorithm (HGA)
2020
International Journal of Advanced Computer Science and Applications
The Traveling Salesman Problem (TSP) is easy to qualify and describe but difficult and very hard to be solved. There is known algorithm that can solve it and find the ideal outcome in polynomial time, so it is NP-Complete problem. The Traveling Salesman Problem (TSP) is related to many others problems because the techniques used to solve it can be easily used to solve other hard Optimization problems, which allows of circulating it results on many other optimization problems. Many techniques
doi:10.14569/ijacsa.2020.0110649
fatcat:cvdk7k2cebczlikzsj6nyh46hm