Phased Hybrid Algorithm with Adaptive Hyper-NSGA-II for Matrix Placement Machines

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.