Simulated annealing algorithm for minimising assembly variation in nonlinear assembly
by R. Sivasubramanian; G. Venkatesan; M. Sivakumar; R. Sivasankaran
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 35, No. 5, 2021

Abstract: Precision assemblies need close tolerance components. A close tolerance component requires secondary operations, which increase the manufacturing cost considerably. Selective assembly (SA) methods like uniform grouping, equal probability, uniform tolerance etc., was discussed in the literature focus generally on reducing surplus parts or minimising clearance variation in the linear assembly. Moreover, the existing techniques use component's tolerance for obtaining the best bin combinations rather than using the component's dimension. The present work aims to obtain maximum number of products with closer assembly specification from wider tolerance sub components of a nonlinear assembly by mating their component's dimensions based on the best bin combinations. Overrunning clutch assembly (OCA) has been considered as an example problem, in which the sub components are manufactured with wide tolerance and partitioned into three to ten bins. Combinations of best bins have been obtained for various assembly specifications by implementing simulated annealing algorithm (SAA). The proposed method has proved its effectiveness by showing 24.9% of cost saving in making OCA.

Online publication date: Mon, 21-Mar-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Technology and Management (IJMTM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email