Optimization of Cutting Tool Travel Path using Genetic Algorithm

Travelling salesman problem (TSP) has been a subject of study for more than a decade. It has been applied to various field of studies. Industries are relying heavily on automation and searching for solutions which could reduce their production time and thereby reduce production cost. Here in this study the concept of TSP has been applied to a cutting tool travel path problem (CTTP). It is seen that CNC used for drilling multiple holes, placed asymmetrically, in a part has higher non-productive air time. To overcome this and to optimize the tool travel path Genetic algorithm (GA) was used in this study. The optimization algorithm was tested for M4, M6, M8, M10 and M12 holes. In all cases our algorithm bettered the present CNC tool path followed, reducing the travel time for the tool.