Revisiting Traveling Salesman Problem (TSP): Analysis of GA and SA based Solutions
The purpose of this study to analyze genetic algorithm (GA) and simulated an-nealing (SA) based approaches applied to well-known Traveling Salesman Prob-lem (TSP). As a NP-Hard problem, the goal of TSP is to find the shortest route possible to travel all the cities, given a set of cities and distanc...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
International Association of Online Engineering (IAOE)
2021-06-01
|
| Series: | International Journal of Recent Contributions from Engineering, Science & IT |
| Subjects: | |
| Online Access: | https://online-journals.org/index.php/i-jes/article/view/22317 |