Simulated Annealing Algorithm for Minimising the Surplus Parts in Selective Assembly-A Software Approach

Malaichamy, T; Sivasubramanian, R; Kumar, Siva; Sundaram, Mathalai C

doi:10.5958/2249-7315.2016.00890.x

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Malaichamy et al (2016B) [15] introduced a software approach to help engineers to visualize the tolerance cost curve for a given process or a good combination of processes in no time. The tolerance cost was calculated using the reciprocal power cost model.…”

Section: Selective Assemblymentioning

confidence: 99%

Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly

et al. 2021

View full text Add to dashboard Cite

The proposed work aims to acquire the maximum number of non-linear assemblies with closer assembly tolerance specifications by mating the different bins’ components. Before that, the components are classified based on the range of tolerance values and grouped into different bins. Further, the manufacturing process of the components is selected from the given and known alternative processes. It is incredibly tedious to obtain the best combinations of bins and the best process together. Hence, a novel approach using the combination of the univariate search method and the harmony search algorithm is proposed in this work. Overrunning clutch assembly is taken as an example. The components of overrunning clutch assembly are manufactured with a wide tolerance value using the best process selected from the given alternatives by the univariate search method. Further, the manufactured components are grouped into three to nine bins. A combination of the best bins is obtained for the various assembly specifications by implementing the harmony search algorithm. The efficacy of the proposed method is demonstrated by showing 24.9% of cost-savings while making overrunning clutch assembly compared with the existing method proposed by Ganesan et al. (2001). The results show that the contribution of the proposed novel methodology is legitimate in solving selective assembly problems.

show abstract

Section: Selective Assemblymentioning

confidence: 99%

Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly

et al. 2021

View full text Add to dashboard Cite

show abstract

“…e authors had used different optimization tools during different periods for solving the selective assembly problems. Authors have used optimization tools such as GA, parallel population GA [14], and simulated annealing [15] in the literature to determine the best bin combination. e artificial bee colony (ABC) algorithm has not yet been implemented in selective assembly techniques.…”

Section: Literature Reviewmentioning

confidence: 99%

Minimizing Cost of Assembly of an Interrelated Dimensional Chain Product Using ABC Algorithm

Sivakumar

Nagarajan

Kandasamy

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Selective assembly is a method where components made with wider tolerance are grouped into a number of bins. Based on the best combination of the bin, the corresponding group components are randomly selected and matched together to make an assembly. Existing techniques focused on equal group number partitioning of components, equal probability, equal group width, and equal area methods to minimize either clearance variation or surplus parts using different optimization techniques. Mostly, simple assemblies with two or three components are worked by various authors in the literature without considering their original dimension by considering only their component’s tolerance. In the present work, components are classified into different unequal group numbers based on their tolerance values. The interrelated dimensional assemblies are made in a single stage by matching the parts based on the best bin combination obtained by the artificial bee colony algorithm. A simple linear assembly and a three-armed knuckle joint assembly are considered examples of problems to demonstrate the effectiveness of the proposed method by minimizing the manufacturing cost.

show abstract

Simulated Annealing Algorithm for Minimising the Surplus Parts in Selective Assembly-A Software Approach

Cited by 2 publications

References 0 publications

Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly

Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly

Minimizing Cost of Assembly of an Interrelated Dimensional Chain Product Using ABC Algorithm

Contact Info

Product

Resources

About