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

  • Authors:
  • Leandro dos Santos Coelho

  • Affiliations:
  • Industrial and Systems Engineering Graduate Program, Pontifical Catholic University of Paraná, Imaculada Conceição, 1155, 80215-910 Curitiba, PR, Brazil

  • Venue:
  • Mathematics and Computers in Simulation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.