Density-Based Prioritization Algorithm for Minimizing Surplus Parts in Selective Assembly

Abstract

Selective assembly is a manufacturing method that matches and assembles pairs of parts in a manner that offsets the machining errors of these parts. In the production of products requiring high precision and efficient mass production, flow production and search-based selective assembly must be combined for market competitiveness; however, this method increases computational costs and generates many surplus parts. Therefore, research should aim to minimize surplus parts in search-based selective assembly at a low computational cost to suit flow production systems. In this paper, we propose the density-based prioritization (DBP) algorithm, which minimizes surplus parts in the search-based selective assembly of flow production systems. In addition, a method of varying the assembly tolerance is developed and incorporated into DBP to increase its process capability. The proposed algorithm requires an assembly facility to prepare parts with as many different sizes as possible. This paper confirms that DBP reduces computational costs and surplus parts while enhancing process capability.