Abstract
Line-seru conversion is an innovative assembly system applied widely in the electronics industry. However, extant algorithms can hardly come into play in solving the line-seru conversion problem. The reason lies in that the line-seru conversion problem consists of two interacting subproblems, i. e., seru formation and seru loading, so it is difficult to obtain high quality solutions with affordable computation efficiency. Thus, an evolutionary algorithm with a cooperation mechanism is proposed in this paper. With the cooperation mechanism, the two subproblems can cooperatively evolved as two subpopulations simultaneously so as to address the aforementioned problem. Moreover, the coding of chromosomes representing scheduling result is modified to satisfy the specific requirement of the conversion and acquire solutions with enhanced performance and balancing ability. Computational result shows a better performance of the proposed method in minimizing total throughput time, total labor hours and computational costs.
Translated title of the contribution | A Line-seru Conversion Approach by Means of Cooperative Coevolution |
---|---|
Original language | Chinese (Traditional) |
Pages (from-to) | 1015-1027 |
Number of pages | 13 |
Journal | Zidonghua Xuebao/Acta Automatica Sinica |
Volume | 44 |
Issue number | 6 |
DOIs | |
Publication status | Published - Jun 2018 |