Least cost tolerance allocation and bicriteria extension

Chae Bogk Kim, P. Simin Pulat, Bobbie L. Foote, Dong Hoon Lee

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)418-426
Number of pages9
JournalInternational Journal of Computer Integrated Manufacturing
Volume12
Issue number5
DOIs
Publication statusPublished - 1999 Jan 1

ASJC Scopus subject areas

  • Aerospace Engineering
  • Mechanical Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Least cost tolerance allocation and bicriteria extension'. Together they form a unique fingerprint.

  • Cite this