Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...

Details

Autor(en) / Beteiligte
Titel
Concurrent optimal allocation of geometric and process tolerances based on the present worth of quality loss using evolutionary optimisation techniques
Ist Teil von
  • Research in engineering design, 2017-04, Vol.28 (2), p.185-202
Ort / Verlag
London: Springer London
Erscheinungsjahr
2017
Link zum Volltext
Quelle
SpringerLink (Online service)
Beschreibungen/Notizen
  • Concurrent tolerancing becomes an optimisation problem to find out the optimum allocation of the process tolerances in the given design function constraints. In traditional optimisation methods, finding out the optimum solution for this advanced tolerance design problem is complex. The proposed algorithms (elitist non-dominated sorting genetic algorithm) and differential evolution extensively do better than the previous algorithms for attaining the optimum result. The aim of this paper is to suggest a model for optimal tolerance allocation by considering both tolerance cost and the present worth of quality loss such that the total manufacturing cost/loss is minimised. The suggested model takes into account the time value of money for quality loss and product degradation over time and consists of two new parameters: the planning horizon and the product user’s discount rate. From the outcome of this study, a longer planning horizon results in an increase in both tolerance cost and quality loss; however, a larger value of discount rate gives up a decrease in both tolerance cost and quality loss. Finally, a practical example is brought into reveal the effectiveness of the suggested method.
Sprache
Englisch
Identifikatoren
ISSN: 0934-9839
eISSN: 1435-6066
DOI: 10.1007/s00163-016-0230-7
Titel-ID: cdi_crossref_primary_10_1007_s00163_016_0230_7

Weiterführende Literatur

Empfehlungen zum selben Thema automatisch vorgeschlagen von bX