Genetic Algorithms (GAs) are an important class of meta-heuristic suitable for a variety of np-hard problems that would otherwise be intractable using deterministic approaches. However, the effectiveness of GAs often rely on their ability to converge to acceptable solutions within a limited amount of time and / or resources. Discuss, with respect to the Travelling Salesman Problem (TSP) in particular, the role of convergence in GAs and the factors affecting convergence in reaching sufficiently optimal solutions.