An Enhanced Genetic Algorithm for Tool-Path Optimization

A new chromosome and related operators are presented for minimizing non-productive time (airtime) of cutting tool in a laser or water jet cutting device. Also to improve the quality of solutions the well-known 2-opt heuristic has been utilized. This problem can be formulated as a Generalized Traveling Salesman Problem (GTSP) which is a more complicated case of the well-known Traveling Salesman Problem (TSP). In GTSP, points are divided into a number of groups or clusters and one is interested in finding the shortest closed path that passes through all clusters, given that only one point is selected from any one cluster. The function of the proposed new chromosome and its operators are studied using a sample problem and the solutions are presented. All solutions were obtained in less than 6 seconds and were optimal in most cases.

کلیدواژه ها:

Generalized Traveling Salesman Problem (GTSP) ، Genetic Algorithm (GA) ، heuristic ، Traveling Salesman Problem (TSP)