钢构打字路径优化中旅行商问题的解决

Steel structural typing path in the process of optimization traveling salesman problem solving

针对工业钢构打字加工路径的组合优化目标,为尽量减少换刀次数和优化刀具移动轨迹,使走刀时间最短,提出建立基于旅行商问题(TSP)的非确定型多项式数学模型,并应用遗传算法(GA)对钢构打字刀具路径的优化问题进行分析、研究和解答。通过合理安排工序和换刀、走刀路径,在不改变机床硬件的前提下,尽可能缩短加工时间。经MATLAB工具箱仿真实验证明,该研究能很好地解决目前我国钢构打字路径寻优问题,使打字过程中的定位精度和加工效率都得到较大提高。

Industrial steel typing processing path optimization goal, to minimize the number of tool changing and optimizing tool moving trajectory, so that the tool path with the shortest time, proposed the establishment based on the traveling salesman problem （TSP） of nondeterministic polynomial mathematical models, and the application of genetic algorithms （GA） on steel typing tool path optimization of analysis, research and solve. Through reasonable arrangement of process and tool, tool path, without changing the machine hardware under the premise, as far as possible to shorten the processing time. The MATLAB toolbox simulation experiments, the study can well solve at present our country steel typing route optimization problem, so that the typing process precision and processing efficiency has been greatly improved.