本文首先提出了基于TSP 的多点位加工路径优化模型以最高生产效率为目标

函数并以数控中心的多孔位加工和多点位焊接两个典型的自动化加工系统为例来

验证该模型的经济性和适用性其次分别为这两个系统建立了基于TSP 的路径优

化模型模型中考虑了实际加工时的系统中约束条件的影响如数控加工中心的换

刀速度主轴移动速度和焊接机器人的工作台转动速度等提出了近似法将数

控加工中心主轴对同一个孔位n 次重复遍历如钻粗镗精镗等简化对n 个

极小间距的相邻点位的一次遍历从而建立相应的多点位数控加工模型然后分

析和比较了罚函数法Tabu 算法等算法这些算法在求解TSP 时存在收敛速度慢

运算过程复杂的不足本文结合了这些算法的一些特点采用了改进的Hopfield 算

法求解基于TSP 的路径优化模型用C 语言编制了该改进算法的优化程序经实例

试算表明该算法具有收敛快权系数变化小迭代次数少的特点-Firstly, multi-point manufacture routine optimum model is referred. The highest

efficient is the object function. Multi-holes machining and multi-weld system are adapted

to verify the economics and adaptability of model. Secondly, separately the routine

optimum models of both systems are built up. Restriction in the real systems is considered

(such as the tool change speed, staple shaft moving speed in CNC and operation platform

rotation speed in weld robot). The approximate way is referred to predigest the n times

visits as 1 times visit, to establish the multi-holes CNC machining model. Thirdly, analyze

and compare the characters and difference of penalty function, Tabu algorithms, point out

their faults　combine with the merits of other algorithms, and adapt the improving Hopfield

algorithms calculate the routine optimum model based on TSP, which is speedily and

easily calculated. The optimum program is compiled in C language to achieve the

improving algorithms.