Application of an improved Spider Monkey Optimization algorithm for component assignment problem in PCB assembly

This paper presents a new optimization method for printed circuit board assembly (PCBA) process based on improved spider monkey optimization (SMO) algorithm, and a production model for PCBA is created. The proposed method proves to be suitable for product-service system(PSS). PCBA process mainly consists of three parts. First is the assignment of PCB, second is the assignment of machines, the last is the component assignment problem. In this research, the SMO algorithm is applied on optimization of component assignment which is divided into two stages: local leader phase (LLP) and global leader phase (GLP). In the first stage, the electronic components are assigned to the feeders by GLP. In the second stage, the component placement sequence, which is apparently known as a travelling salesman problem (TSP), is determined by LLP. Numerical experiments are performed to compare the performance of SMO algorithm with others under various experimental settings, the results show that the proposed method is more effective than other traditional methods. A production model is created with the proposed method, which is calimed to be able to increase the efficiency of the product services. (C) 2019 The Authors. Published by Elsevier B.V. Peer-review under responsibility of the scientific committee of the 11th CIRP Conference on Industrial Product-Service Systems