论文部分内容阅读
将多轮廓加工走刀空行程路径优化归结为广义旅行商问题,基于蚁群算法和最近邻算法,提出一种走刀空行程路径优化算法。采用蚁群算法优化任意选择的走刀路径,得到一条轮廓排列序列,对该轮廓序列,采用最近邻算法在相邻轮廓上寻找节点构建走刀路径,再采用蚁群优化及最近邻算法由此路径构建新的走刀路径,如此反复迭代,就得到一条优化的走刀路径。给出一个优化实例,验证了算法可有效构建走刀空行程路径。采用单因素分析和均匀试验设计的方法,详细给出了优化参数选择方法。
Based on the ant colony algorithm and the nearest neighbor algorithm, a path optimization algorithm for the free-travel path is proposed, which is a generalized traveling salesman problem. The ant colony algorithm is used to optimize the arbitrarily chosen path and a contour sequence is obtained. For the contour sequence, the nearest neighbor algorithm is used to search for nodes in the adjacent contour to construct the path of the path. Ant colony optimization and nearest neighbor algorithm Path to build a new path path, so iterative, you get an optimized path to go. An optimization example is given, which verifies that the algorithm can effectively construct the path of free-travel path. Using single factor analysis and uniform experimental design method, the optimization parameter selection method is given in detail.