Particle swarm optimization (PSO) algorithm for optimal machining allocation of clutch assembly

Nowadays tolerance optimization is increasingly becoming an important tool for manufacturing and mechanical design. This seemingly, arbitrary task of assigning dimension tolerance can have a large effect on the cost and performance of manufactured products. With the increase in competition in today’...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2006-02, Vol.27 (9-10), p.865-869
Main Authors: Noorul Haq, A., Karthikeyan, K., Sivakumar, K., Saravanan, R.
Format: Article
Language:English
Subjects:
Assembly
Clutches
Cost control
Genetic algorithms
Machining
Manufacturing
Mathematical programming
Minimum cost
Optimization
Particle swarm optimization
Production costs
Tolerances
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Nowadays tolerance optimization is increasingly becoming an important tool for manufacturing and mechanical design. This seemingly, arbitrary task of assigning dimension tolerance can have a large effect on the cost and performance of manufactured products. With the increase in competition in today’s market place, small savings in cost or small increase in performance may determine the success of a product. In practical applications, tolerances are most often assigned as informal compromises between functional quality and manufacturing cost. Frequently the compromise is obtained interactively by trial and error. A more scientific approach is often desirable for better performance. In this paper particle swarm optimization (PSO) is used for the optimal machining tolerance allocation of over running clutch assembly to obtain the global optimal solution. The objective is to obtain optimum tolerances of the individual components for the minimum cost of manufacturing. The result obtained by PSO is compared with the geometric programming (GP) and genetic algorithm (GA) and the performance of the result are analyzed .
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-004-2274-5