earticle

영어

In this study, the path planning problem in 3D automated optical inspection (AOI) machines is considered. In the problem, the primary objective is finding a path that minimizes the total working time among all possible paths for the camera. In 3D AOI machines, a very precise level of image processing has to be performed when inspecting the mounted components on printed circuit boards (PCBs). Therefore, both the routing time of the camera path and the image processing time have to be considered when calculating the total working time of the camera in the AOI machines. In this paper, we propose efficient heuristic algorithms that can find the paths that have the shortest total working times. The performances of the proposed methods primarily depend on the NEH-based procedure, which is one of our proposed improvement procedures. We introduce several construction and improvement procedures, and select the best combination as our proposed approach. The results of computational experiments conducted on real data to evaluate the performance of our proposed approach show that our proposed methods improve on the original path planning performances. In addition, tests done on randomly generated data indicate that our proposed approach is superior to other benchmark approaches, including metaheuristic algorithms, in terms of computing time and performance measures.