##This is a project to exercise on designing and implementing an evolutionary algorithm to solve the Traveling Salesman Problem(TSP)

##Problem description: The TSP is to find a shortest possible tour that visits each city exactly once for a given list of cities and back to the starting city.