Optimization Of Cutting Path Of Steam Turbine Plate Based On Heuristic Algorithm

After 40 years of reform and opening up,China’s manufacturing industry is experiencing unprecedented transformation and upgrading.With the proposal of“2025 made in China”,all kinds of advanced intelligent automation devices are widely applied in manufacturing industry.NC cutting is an important process in modern industrial manufacturing.Whether the cutting path is reasonable will directly affect the effect and efficiency of cutting.Aiming at the optimization of cutting path of steam turbine,the greedy algorithm and genetic algorithm are used to study the cutting path,in order to reduce the cutting path and improve the cutting efficiency.In this paper,the realization method of greedy algorithm on the optimization of cutting path of steam turbine is first studied.After a definite solution of the target,the optimal solution is sought in a limited time by determining the greedy criterion.The algorithm can quickly and accurately find the optimal path in the solution of the cutting path optimization problem,and the cutting space path is shortened by 12.09%with the greedy algorithm in the example.Aiming at the shortcoming that greedy algorithm can not find the global optimal solution,the application of genetic algorithm in cutting path optimization is studied in this paper.The algorithm uses binary coding,after determining the fitness function,through the steps of replication,cross,mutation and other steps,through the optimization of a certain genetic algebra,the optimal path is finally obtained.It is verified by examples that the optimized path after cutting by genetic algorithm is reduced by12.47%.The results of validation analysis show that greedy algorithm is simple and feasible,and achieves good results under the condition of small scale and low requirement.Compared with the instability of greedy algorithm,genetic algorithm can reliably evaluate the optimization results by population size,genetic algebra and other parameters.Because of the problem of cutting path optimization,these two algorithms can not guarantee the optimal results.Therefore,when solving the problem,we should consider the relevant factors and choose the most suitable algorithm to achieve the best results.