| CNC punching machine is wildly used in the manufacturing industry as one of themain equipments. Most working-time of punching machine lies on the process of movingand punching materials, so does the efficiency. The move and punch depend on the orderthose holes are machined, AKA path planning of the CNC punch machine. Working timecan be reduce by using path planning. Study of path planning of CNC punching has broadapplication. In large-scale production case, following the optimized path calculated bypath planning program, energy consumption can be effectively reduced and productionefficiency can be increased, therefore it can create magnific environmental and economicvalues.The work of this paper can be summarized as follows:Firstly, based on working ofCNC punching, using TSP model to build model for path planning, introduced the theoryof ACO algorithm, the steps to solve TSP problem using ACO algorithm and how to setsome important parameters.Secondly, considering the features belong to punch machine when working, that is:travelling at least once per dot but exactly once to make the hole, the impacts caused bythe tool-change time and tool-punch time. For that reason distance variable needs bepreprocessed, replaced by the concept of equivalent distance to solve the second impacts,meanwhile studied the step to realize nearest neighbor algorithm and explained why NNwas more suitable for embedded systems.Lastly, the paper referred a way to code optimization by picking up hole coordinatorfrom G code generated by hand, then using path planning to get an optimized path thengenerate the new code. |