14 September 2023 in IEEE Transactions on Industrial Informatics
Surface mount technology is essential to the development of the electronic manufacturing industry. This article studies optimizing the surface mount process for the beam-head placement machine. A mixed-integer programming (MIP) model is proposed for this problem, which is decomposed into three interconnected hierarchical parts: feeder allocation; component assignment; and pick-and-place (PAP) sequence problems. This article proposes an efficient hierarchical framework with three elaborately designed heuristics to solve the above problem. The design of the scan-based algorithms optimizes the subobjectives of feeder allocation and component assignment. First, the allocation heuristic arranges the feeders into slots as a prerequisite for other problems. Then, the component assignment heuristic determines the component type for each head with a variety of criteria and long short-term objectives. Finally, the PAP sequence problem is solved using a modified beam search algorithm. The proposed algorithm offers advantages in terms of effectiveness, efficiency, and extension, which can satisfy various customization demands. Experiments are conducted on our self-designed placement machine using industrial and randomly generated data. Computational experiments show that the scan-based heuristic algorithm obtains near-optimal solutions with a gap of 9.93% averagely compared with the proposed MIP model and provides efficiency improvement over the mainstream studies.
23 April 2025 in IEEE Transactions on Cybernetics
Printed circuit board assembly line scheduling (PCBALS) is a difficult task in the electronic industry for assembly lines using surface mounters, which is critical for production efficiency. This is a special type of line optimization problem that uses different allocation techniques, resulting in wide differences in assembly times between machines. This article proposes a hyper-heuristic optimizer embedded with a multifeature fusion ensemble estimator (HHO-MFEE) for PCBALS using linear-aligned-heads surface mounters. The objective and constraints of the problem are discussed, and a min-max integer model for small-scale problems is built. At the hyper-heuristic low level, seven data-and target-driven heuristics are presented for allocating components to different machines. Strategies for duplicated conditions with component types and placement points allocation are proposed to improve the applicability of the algorithm and the quality of the solution. An ensemble assembly time estimator that incorporates the coding of multifeatures, including estimated subobjectives, is proposed for evaluating the quality of the solution. Experimental results show that: 1) the gaps between the solution from HHO-MFEE and the optimal solution of the model are 3.44%~7.28% for small-scale data; 2) the proposed time estimator has higher accuracy than regression and heuristic-based ones, with mean absolute error of 2.01% and 3.43% for training and testing data, respectively; and 3) HHO-MFEE is better than other state-of-the-art algorithms, with average improvement of 7.21%~9.47%.
15 August 2024 in IEEE Transactions on Industrial Informatics
The optimization of printed circuit board assembly (PCBA) for a beam head placement machine is a multivariable and multiconstraint combinatorial problem. Current techniques falter in solving a variety of PCBA problems since heuristic algorithms lack theoretical guarantees of optimality, and mathematical modeling methods have high computational complexity for the whole problem. This article proposes a novel two-phase optimization for PCBA, integrating the advantages of mathematical modeling with heuristic algorithms. We divide the problem into the head task assignment and the placement route schedule. For the former, an effective integer linear programming model with component partition is proposed, encompassing key efficiency-influencing factors. A recursive heuristic-based initial solution speeds up the solving convergence, while the reduction strategies enhance model solvability. For the placement route schedule, a tailored greedy algorithm yields high-quality solutions, leveraging the results of the model, and an aggregated route relink heuristic does further optimization. In addition, we propose a selection criterion for the solution pool of the model to pre-evaluate the placement movement, which builds the connection between the two phases. Finally, we validate the performance of the two-phase optimization, which provides an average efficiency improvement of 8.66%–21.83% compared to other mainstream research.
16 February 2026 in IEEE Transactions on Industrial Informatics
Matrix placement machines improve production efficiency of printed circuit board assembly (PCBA), addressing critical needs for flexible and intelligent electronics manufacturing. However, their complex head structure renders solutions for traditional beam-head placement machines inefficient for matrix placement machines. This article proposes a phased hybrid algorithm with adaptive hyper-nondominated sorting genetic algorithm II (NSGA-II) for PCBA optimization. A bidirectional search mechanism is applied to derive feeder distributions and nozzle configurations, and iteratively tighten the solution space using priority-based search strategies. The softmax, max greatest common divisor, and max matching mechanisms are proposed for placement and pickup sequences, which facilitates construction of solution pools. Initial solutions are extracted from the pool and, subsequently, hyperheuristic mechanisms dynamically adjust genetic operators within NSGA-II to minimize placement, pickup, and recognition times with better convergence speed. Experimental validation with real-world production data demonstrates that the proposed algorithm achieves 6.05%–38.18% performance improvements compared to state-of-the-art solutions.
1 January 2026 in IEEE Transactions on Industrial Informatics
1 January 2026 in IEEE Transactions on Industrial Informatics