考虑一类轮廓切割顺序受限的加工路径优化问题。遵循由内到外的轮廓切割约束条件,以遍历所有待切割轮廓且刀头在轮廓间移动的空行程距离最短为优化目标,把约束条件转化到遗传算法编码问题。采用启发式搜索技术以加快遗传算法的爬山速度,并且能自适应调整交叉和变异概率。实际应用结果表明所提算法能有效缩短空行程。 Consider a class of machining path optimization problems with limited contour cutting sequence. Following the contour cut constraint from the inside to the outside to traverse all the to-be-cut profiles with the shortest distance between the heads moving between the contours as the optimization target, the constraints are transformed into the genetic algorithm coding problem. Heuristic search technology is used to speed up the climbing of genetic algorithm, and adaptively adjust the crossover and mutation probability. The practical application shows that the proposed algorithm can shorten the empty travel effectively.