IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v113y2002i2d10.1023_a1014826824323.html
   My bibliography  Save this article

Worst-Case Tolerance Design and Quality Assurance via Genetic Algorithms

Author

Listed:
  • B. Forouraghi

    (St. Joseph's University)

Abstract

In many engineering designs, several components are often placed together in a mechanical assembly. Due to manufacturing variations, there is a tolerance associated with the nominal dimension of each component in the assembly. The goal of worst-case tolerance analysis is to determine the effect of the smallest and largest assembly dimensions on the product performance. Furthermore, to achieve product quality and robustness, designers must ensure that the product performance variation is minimal. Recently, genetic algorithms (GAs) have gained a great deal of attention in the field of tolerance design. The main strength of GAs lies in their ability to effectively perform directed random search in a large space of design solutions and produce optimum results. However, simultaneous treatment of tolerance analysis and robust design for quality assurance via genetic algorithms has been marginal. In this paper, we introduce a new method based on GAs, which addresses both the worst-case tolerance analysis of mechanical assemblies and robust design. A novel formulation based on manufacturing capability indices allows the GA to rank candidate designs based on varying the tolerances around the nominal design parameter values. Standard genetic operators are then applied to ensure that the product performance measure exhibits minimal variation from the desired target value. The computational results in the design of a clutch assembly highlight the advantages of the proposed methodology.

Suggested Citation

  • B. Forouraghi, 2002. "Worst-Case Tolerance Design and Quality Assurance via Genetic Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 113(2), pages 251-268, May.
  • Handle: RePEc:spr:joptap:v:113:y:2002:i:2:d:10.1023_a:1014826824323
    DOI: 10.1023/A:1014826824323
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1014826824323
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1014826824323?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. dos Santos Coelho, Leandro, 2009. "Self-organizing migration algorithm applied to machining allocation of clutch assembly," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 80(2), pages 427-435.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:113:y:2002:i:2:d:10.1023_a:1014826824323. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.