The printed circuit boards (PCBs) grouping problem (PGP) is an essential part of PCBs assembly that has attracted much attention in recent years. In this paper, we propose a mathematical model and an iterated greedy (IG) algorithm, called IGP, for solving the PGP with setup time criterion. Based on the problem characteristics, two speed-up theorems are proposed and applied in the IGP. In the IGP, a new solution representation consisting of PCBs assignment sequence and component assignment sequence is adapted, and a heuristic based on PCB pairs and an iterated scheme is presented to create an initial solution. Then a merge operator is introduced to further improve the initial solution. A local search method based on the shift and swap operators is applied to improve solutions from the construction phase. To ensure the diversity of solutions, an acceptance criterion with probability is presented. Additionally, a detailed design experiment is carried out to calibrate the parameters for the presented IGP algorithm. The IGP is assessed by comparing it with the state-of-the-art algorithms in the literature. The experimental results show that the proposed IGP achieves the best performance among the tested methods for PGP.

印刷电路板 (PCB) 分组问题 (PGP) 是近年来备受关注的 PCB 组装的重要组成部分。在本文中，我们提出了一个数学模型和一种称为 IGP 的迭代贪婪 (IG) 算法，用于解决具有设置时间标准的 PGP。基于问题的特点，提出了两个加速定理并在IGP中应用。在 IGP 中，采用了由 PCB 分配序列和元件分配序列组成的新解决方案表示，并提出了基于 PCB 对和迭代方案的启发式方法来创建初始解决方案。然后引入合并算子以进一步改进初始解。应用基于移位和交换算子的局部搜索方法来改进构建阶段的解决方案。为确保解决方案的多样性，给出了一个带有概率的验收标准。此外，还进行了详细的设计实验以校准所提出的 IGP 算法的参数。通过将 IGP 与文献中最先进的算法进行比较来评估 IGP。实验结果表明，所提出的 IGP 在 PGP 的测试方法中取得了最好的性能。