Genetic algorithm for minimizing assembly variation in selective assembly

Genetic algorithm for minimizing assembly variation in selective assembly

0.00 Avg rating0 Votes
Article ID: iaor20041518
Country: United Kingdom
Volume: 41
Issue: 14
Start Page Number: 3301
End Page Number: 3313
Publication Date: Jan 2003
Journal: International Journal of Production Research
Authors: , ,
Keywords: genetic algorithms
Abstract:

Selective assembly is a method of obtaining high-precision assemblies from relatively low-precision components. In selective assembly, the mating parts are manufactured with wide tolerances. The mating part population is partitioned to form selective groups, and corresponding selective groups are then assembled interchangeably. If the mating parts are manufactured in different processes and in different machines, their standard deviations will be different. It is impossible that the number of parts in the selective group will be the same. A large number of surplus parts are expected according to the difference in the standard deviations of the mating parts. A method is proposed to find the selective groups to minimize the assembly variation and surplus parts when the parts are assembled linearly. A genetic algorithm is used to find the best combination of the selective groups to minimize the assembly variation. Selective assembly is successfully applied using a genetic algorithm to achieve high-precision assemblies without sacrificing the benefit of wider tolerance in manufacturing.

Reviews

Required fields are marked *. Your email address will not be published.