Optimized Selective Assembly using Hungarian Algorithm

Abstract

Assembly of discrete parts guided by hardware design specification constitutes the final phase in product manufacturing. In the course of mass production of components, mating parts with geometric or dimensional deviation from their intended design can be made acceptable by the identification of suitable pairs after analysing design fit and tolerance limits. By transforming this application-specific problem into a unified mathematical model, an optimal solution can be achieved that minimizes the rejection of non-conforming fabricated parts. Regardless of the type and range of a design fit, the problem can be mapped into a matrix using a ranking function defined by the user. The ranking function is modifiable as per the user requirements and may vary based on the selection criteria for an assembly. Based on the type of ranking function used, the tabulated matrix is solved using the Hungarian minimization/maximization algorithm, which is a powerful combinatorial optimization algorithm that solves the classical assignment problem in mathematics. This approach ensures maximum number of suiting pairs as well as nominal suiting of parts with each other resulting in high-quality products and maximum utilization of fabricated resources.