TY - JOUR
T1 - Least cost tolerance allocation and bicriteria extension
AU - Kim, Chae Bogk
AU - Pulat, P. Simin
AU - Foote, Bobbie L.
AU - Lee, Dong Hoon
PY - 1999/1/1
Y1 - 1999/1/1
N2 - 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. When there 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.
AB - 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. When there 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.
UR - http://www.scopus.com/inward/record.url?scp=0010099228&partnerID=8YFLogxK
U2 - 10.1080/095119299130155
DO - 10.1080/095119299130155
M3 - Article
AN - SCOPUS:0010099228
SN - 0951-192X
VL - 12
SP - 418
EP - 426
JO - International Journal of Computer Integrated Manufacturing
JF - International Journal of Computer Integrated Manufacturing
IS - 5
ER -