An Evolutionary Algorithmic Approach for Improving the Success Rate of Selective Assembly through a Novel EAUB Method

Abstract

This work addresses an evolutionary algorithmic approach to reduce the surplus pieces in selective assembly to increase success rates. A novel equal area amidst unequal bin numbers (EAUB) method is proposed for classifying the parts of the ball bearing assembly by considering the various tolerance ranges of parts. The L16 orthogonal array is used for identifying the effectiveness of the proposed EAUB method through varying the number of bins of the parts of an assembly. Because of qualities such as minimal setting parameters, ease of understanding and implementation, and rapid convergence, the moth–flame optimization (MFO) algorithm is put forward in this work for identifying the optimal combination of bins of the parts of an assembly toward maximizing the percentage of the success rate of making assemblies. Computational results showed a 5.78% improvement in the success rate through the proposed approach compared with the past literature. The usage of the MFO algorithm is justified by comparing the computational results with the harmony search algorithm.

Keywords

• selective assembly
• success rate
• EAUB method
• evolutionary algorithm
• MFO algorithm