Abstract: In this paper, a Genetic Algorithm (GA) is used for the travelling salesman problem (TSP) to reduced total time and distance of tool travel for drilling sequence. By using Traveling salesman problem, it become a little bit simple and less time consuming. But there are many possible sequences in TSP. So there is need to find out the best possible solution so that the process becomes more efficient and less time consumer. By using GENETIC ALGORITHM in MTLAB software, I got best possible sequence in TSP.