IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v80y2009i2p427-435.html
   My bibliography  Save this article

Self-organizing migration algorithm applied to machining allocation of clutch assembly

Author

Listed:
  • dos Santos Coelho, Leandro

Abstract

Tolerancing is an important issue in product and manufacturing process designs. The allocation of design tolerances between the components of a mechanical assembly and manufacturing tolerances in the intermediate machining steps of component fabrication can significantly affect the quality, robustness and life-cycle of a product. Stimulated by the growing demand for improving the reliability and performance of manufacturing process designs, the tolerance design optimization has been receiving significant attention from researchers in the field. In recent years, a broad class of meta-heuristics algorithms has been developed for tolerance optimization. Recently, a new class of stochastic optimization algorithm called self-organizing migrating algorithm (SOMA) was proposed in literature. SOMA works on a population of potential solutions called specimen and it is based on the self-organizing behavior of groups of individuals in a “social environment”. This paper introduces a modified SOMA approach based on Gaussian operator (GSOMA) to solve the machining tolerance allocation of an overrunning clutch assembly. The objective is to obtain optimum tolerances of the individual components for the minimum cost of manufacturing. Simulation results obtained by the SOMA and GSOMA approaches are compared with results presented in recent literature using geometric programming, genetic algorithm, and particle swarm optimization.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matcom:v:80:y:2009:i:2:p:427-435
    DOI: 10.1016/j.matcom.2009.08.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475409002377
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2009.08.003?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.

    References listed on IDEAS

    as
    1. Chen, Mu-Chen, 2001. "Tolerance synthesis by neural learning and nonlinear programming," International Journal of Production Economics, Elsevier, vol. 70(1), pages 55-65, March.
    2. Zelinka, Ivan & Senkerik, Roman & Navratil, Eduard, 2009. "Investigation on evolutionary optimization of chaos control," Chaos, Solitons & Fractals, Elsevier, vol. 40(1), pages 111-129.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Leyva, R. & Ribes-Mallada, U. & Garces, P. & Reynaud, J.F., 2012. "Design and optimization of buck and double buck converters by means of geometric programming," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 82(8), pages 1516-1530.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Caputo, Antonio C. & Di Salvo, Girolamo, 2019. "An economic decision model for selective assembly," International Journal of Production Economics, Elsevier, vol. 207(C), pages 56-69.
    2. Yang, Christopher C. & Naikan, V. N. Achutha, 2003. "Optimum design of component tolerances of assemblies using constraint networks," International Journal of Production Economics, Elsevier, vol. 84(2), pages 149-163, May.
    3. Otsuka, Akimasa & Nagata, Fusaomi, 2018. "Quality design method using process capability index based on Monte-Carlo method and real-coded genetic algorithm," International Journal of Production Economics, Elsevier, vol. 204(C), pages 358-364.
    4. Hsu, Chih-Ming, 2004. "An integrated approach to enhance the optical performance of couplers based on neural networks, desirability functions and tabu search," International Journal of Production Economics, Elsevier, vol. 92(3), pages 241-254, December.

    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:eee:matcom:v:80:y:2009:i:2:p:427-435. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.