Least cost tolerance allocation and bicriteria extension

Due to the combinatorial scheme, the least cost tolerance allocation proble m is an NP class problem. There have therefore been many studies into how t o reduce the computational burden to solve the problem. However, in die pra ctical situation, reducing both cost and tolerance is an interesting area f or the decision maker (designer). In this paper, a simple and effective heu ristic algorithm for the problem is presented to generate efficient solutio ns with respect to cost and tolerance. When there is no total assembly tole rance constraint, the proposed algorithm can find all efficient solutions o f a bicriteria tolerance allocation problem. In order to test the performan ce of the presented algorithm, eight examples are taken from Chase et al. ( 1990). According to the computational results, the algorithm finds all effi cient solutions of each example in a few seconds.