Title : Optimizing the holes drilling path problem via Dhouib-Matrix Methods
Abstract:
Optimizing the movement of the robot arm in drilling holes leads to increase the productivity through saving time, cost and energy. In the literature, there are different methods that ensure the process of optimization and very recently we have invented the concept of Dhouib-Matrix (DM) which also does. DM gathers several optimization methods (exact, heuristics and metaheuristics). In this presentation, we consider the holes drilling path problem as a Travelling Salesman Problem where the salesman is the robot arm, the cities are the holes and the shortest route cycle for the salesman will be the shortest robot arm movement. Actually, we propose three optimization techniques: 1) the deterministic heuristic Dhouib-Matrix-TSP1 (DM-TSP1) 2) the local search method Far-to-Near (FtN) 3) the novel multi-start metaheuristic Dhouib-Matrix-4 (DM4). The performance of the proposed methods is proved on several standard Printed Circuit Board (PCB) instances (from TSP-LIB). Figure 1 graphically illustrates the drilling path for the u159 problem using DM4.
