Due to the combinatorial scheme, the least cost tolerance allocation problem is an NP class problem. There have therefore been many studies into how to reduce the computational burden to solve the problem. However, in the practical situation,reducing both cost and tolerance is an interesting area for the decision maker (designer). In this paper, a simple and effective heuristic algorithm for the problem is presented to generate efficient solutions with respect to cost and tolerance. Whenthere is no total assembly tolerance constraint, the proposed algorithm can find all efficient solutions of a bicriteria tolerance allocation problem. In order to test the performance of the presented algorithm, eight examples are taken from Chase et al.(1990). According to the computational results, the algorithm finds all efficient solutions of each example in a few seconds.
展开▼
机译：由于组合方案，最小的成本公差分配问题是NP类问题。因此，已经进行了许多有关如何减轻计算负担以解决该问题的研究。但是，在实际情况下，降低成本和容忍度对于决策者（设计者）来说是一个有趣的领域。在本文中，提出了一种简单有效的启发式算法来生成有关成本和容忍度的有效解决方案。当没有总装配公差约束时，该算法可以找到双标准公差分配问题的所有有效解。为了测试所提出算法的性能，从Chase et al。（1990）中选取了八个例子。根据计算结果，该算法可在几秒钟内找到每个示例的所有有效解。
展开▼
