This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ustive search. 5. CONCLUSION The tolerance allocation of a mechanical assembly has great impact on production cost, functionality and quality. This paper includes a review of earlier work on the subject of tolerance allocation. An algorithm is proposed that solves the discrete tolerance allocation problem in an efficient way and guarantees that an optimal solution is found (as opposed to for instance genetic algorithms and simulated annealing). A module has been implemented in C++ together with the algorithm. The implementation is such that the tolerances can be allocated in a way that fulfils defined critical measures and minimizes the manufacturing cost. It is also possible to add loss functions that imply a high quality product. Finally, the allocation module is very effective. It solves a model that consists of eight measures and 21 dimensions with five defined tolerance-cost couples about 120 times faster than exhaustive search. 124
REFERENCES J. Lööf, T. Hermansson and R. Söderberg [Chase and Parkinson, 1991] Chase, K.; Parkinson, A. R.; “A Survey of Research in the Application of...
View Full Document
- Spring '10
- The Land