Simulated-annealing algorithm to solve multi-component matching problems in generalised selective assembly

Generalized Selective Assembly is a strategy of intelligently matching components based on their measured feature values. This strategy requires algorithms that, given a list of components, their measured feature values, and a list of quality constraints between the components, returns a list of assemblies and their comprising components, maximizing the number of in-spec assemblies. Although assemblies in practice often involve one-to-many, many-to-one or many-to-many constraints, most algorithms reported in literature involve one-to-one constraints. Therefore, in this paper a Simulated Annealing algorithm is developed that involves these types of constraints and that is able to solve the problem fast enough to be practical in manufacturing environments. The developed Simulated Annealing algorithm outperforms other heuristic approaches proposed in literature by finding consistently more in-spec assemblies in the same running time.

ISBN:9789492859181

Jaar van publicatie:2021

Toegankelijkheid:Closed