Optimizing Tool Path Sequence Of Plasma Cutting Machine Using TSP Approach

Abstract

The paper consists of optimizing the total distance traveled by the Plasma Cutting Tool Head. It is cross-functional implementation traveling salesman problem to the core manufacturing process of plasma cutting. This study contributes to reduce the total rapid traverse length (Total Through-Air Travelled Distance) by the cutting tool (Plasma Beam), which is totally a non-productive as well as non-value adding process contributing to the machine running costs and cycle time of the product directly and indirectly. For deriving this optimal sequence for the plasma cutting head, a heuristic algorithm is used. This algorithm calculates an optimal solution for a problem creating the best possible sequence. The greedy algorithm follows the problem-solving heuristics of making a locally optimal choice at every stage, finally integrating a globally optimal solution. Hence after deducing this optimal sequence and when accompanied by the Plasma Cutting tool, it resulted in the least distance traveled, contributing to minimizing cost and energy savings of the machine and simultaneously reducing the total traveled distance and similarly the cycle time.