基于改进烟花算法的嵌套轮廓切割路径优化方法
Improved Fireworks Algorithm-Based Path Optimization Method of Nested Contour Cutting
-
摘要: 针对裁切加工中嵌套层数多、数量大的复杂轮廓切割路径优化中存在求解效率低和精度差等问题, 提出基于改进烟花算法的嵌套轮廓切割路径优化方法. 首先, 在满足先内后外约束下, 建立包含起始点位置和切割顺序的空行程路径优化模型; 然后, 提出基于分层策略的轮廓顺序编码方法, 实现对嵌套轮廓进行逐层分解和排序, 有效地降低了该路径优化问题的求解复杂性; 最后, 提出基于自适应变异算子的改进烟花算法, 通过变异火花数量自适应地调整减小路径交叉的发生概率, 提高了路径优化算法的计算效率以及全局寻优能力. 面向服装、广告以及钣金行业的实际案例, 通过对比实验验证了所提方法的有效性和优越性, 为解决相关行业问题提供了有价值的解决方案.Abstract: To address the challenges of low efficiency and poor accuracy in optimizing complex contour cutting paths with multiple nested layers and a large number of cuts, an improved fireworks algorithm-based nested contour cutting path optimization method is proposed. First, an empty travel path optimization model that includes the starting point position and cutting sequence is established under the constraint of internal-to-external first. Second, a hierarchical strategy-based encoding method for contour sequences is designed to achieve layer-wise decomposition and ordering of nested contours. In addition, an improved fireworks algorithm based on an adaptive mutation operator is proposed, which adaptively adjusts the number of mutated sparks to reduce the path intersection probability, improving the computational efficiency and global optimization capability of the path optimization algorithm. Finally, the experimental results of practical cases in the clothing, advertising and sheet metal industries are analyzed to validate the effectiveness and superiority of the proposed approach, which provides a valuable solution for solving related industry problems.