An attempt at improving the Genetic Algorithm employed for solving the travelling salesman problem based on faster convergence and minimum path cost. A basic implementation of the Genetic Algorithm and a short comparative analysis on the performance of the naive and the improved version with possible reasons can also be found alongside.