Abstract: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 distances between cities. In order to solve the problem and achieve the optimal solution, all permutations need to be checked, which gets exponentially large as more cities are added. Our aim in this study is to provide co… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.