In this paper, the possible numerical treatments of a new compliance-function-shape-oriented robust truss sizing model with directionally uncertain loads have been analyzed. The applied robustness measure is the total-compliance-variation; the corresponding model is a total-compliance-variation minimization model. The model, according to the number of uncertain loads, can be classified as a curve-length, surface-area, volume, and generalized volume minimization problem where the objective is integral and the weight increase is constrained. The numerical treatment of the model is a challenging problem. In this paper, for the numerical treatment a one-step asymptotically optimal algorithm and a two-steps heuristic algorithm are presented. The central element of the one-step algorithm is a mesh with mesh-point-specific displacements, stress constraints, and compliance values. The algorithm can be formulated as a sample-based iterative process using one of the two alternative objectives. The one-step algorithm is computationally expensive but able to find an optimal solution with appropriate maximum running time and mesh-size settings. The two-steps algorithm firstly defines a lower dimensional searching space without displacements and stress constraints and uses it as the searching space in the second step. The hybrid metaheuristic search method is a modified ANGEL algorithm, which is a hybridization of the ant-colony (AN), the genetic (GE) and a local search (L) algorithms. The two-steps algorithm is faster but its result is not necessary optimal. To illustrate the efficiency of the solution possibilities the popular ten-bar truss sizing problem will be used with one, two, and four directionally uncertain point loads as the benchmark problem.

在本文中，分析了具有方向不确定载荷的，新的以柔度函数形状为导向的鲁棒桁架模型的可能数值处理方法。应用的鲁棒性度量是总合规性变化；相应的模型是总合规性最小化模型。根据不确定载荷的数量，该模型可以归类为曲线长度，表面积，体积和广义体积最小化问题，其中目标是不可分割的，并且重量增加受到限制。模型的数值处理是一个具有挑战性的问题。针对数值处理，提出了一种渐近最优算法和两步启发式算法。一步的核心要素该算法是一个具有特定于网格点的位移，应力约束和柔度值的网格。使用两个替代目标之一，可以将该算法公式化为基于样本的迭代过程。该一步法算法是计算量很大，但能够找到适当的最大运行时间的最佳解决方案和网格大小设置。的两步算法首先限定了下部维搜索空间而不位移和应力约束，并使用它作为第二步骤中的搜索空间。混合元启发式搜索方法是一种改进的ANGEL算法，它是蚁群（AN），遗传（GE）和局部搜索（L）算法。该两步算法是速度快，但它的结果是没有必要的优化。为了说明解决方案的效率，将使用常见的十杆桁架尺寸问题，将一，二和四个方向不确定的点载荷作为基准问题。