Joining sequence optimization is a combinatorial problem, requiring extensive computational time. The significance of determination of an optimal sequence for improved geometrical quality is substantial. Previously, genetic algorithms have been studied for defining the optimal sequence. However, these algorithms are highly dependent on the internal parameters, requiring additional computational analysis and thereby extended evaluation time. In this article, a novel robust stepwise algorithm is introduced to determine the optimal weld sequence. Application of the proposed algorithm leads to drastic time improvements for defining the optimal weld sequence of each assembly. Three industrial assemblies are evaluated. Comparison with the previously applied population-based optimization algorithms indicates that the optimization time can be reduced drastically with the proposed stepwise algorithm. The stepwise algorithm is intended to be applied in a geometry assurance digital twin, where the assembly parameters are being optimized for each individual assembly.

中文翻译：

---

使用新型逐步算法对点焊进行快速序列优化以提高几何质量

加入序列优化是一个组合问题，需要大量的计算时间。确定最佳序列对于改进几何质量的重要性是巨大的。以前，已经研究了遗传算法来定义最佳序列。然而，这些算法高度依赖于内部参数，需要额外的计算分析，从而延长评估时间。在本文中，引入了一种新颖的稳健逐步算法来确定最佳焊接顺序。所提出的算法的应用导致用于定义每个组件的最佳焊接顺序的显着时间改进。评估了三个工业组件。与以前应用的基于种群的优化算法的比较表明，使用所提出的逐步算法可以大大减少优化时间。逐步算法旨在应用于几何保证数字孪生，其中正在为每个单独的组件优化装配参数。