Abstract
Drilling holes on a Printed Circuit Board is a complicated task and it is usually ensured via a Computer Numerical Control (CNC) machine using a drilling robot arm. Commonly, to increase the performance of the CNC, the movement of its robot arm is minimized via the optimization of the holes drilling route. Hence, different metaheuristics are used to plan the shortest drilling route. In this purpose, we designed a novel metaheuristic namely Dhouib-Matrix-4 (DM4) and in this paper DM4 is enhanced with a Tabu list (T) and adapted to plan the shortest route for the drilling robot arm: the proposed method is entitled Dhouib-Matrix-4-Tabu (DM4-T). In fact, DM4-T combines two techniques in a multi-start structure: (i) An initial basic solution is generated using the novel Dhouib-Matrix-TSP1 heuristic (ii) this initial solution is intensified via the innovative Far-to-Near local search technique with the Tabu list. Experimental results indicate the performance and robustness of DM4-T to solve several instances up to 2152 holes. Indeed, DM4- T outperforms several existing metaheuristics in the literature such as Genetic Algorithm, Ants Colony Optimization, Integrated Genetic Simulated Annealing and Modified Shuffled Frog Leaping Algorithm.
Keywords
Get full access to this article
View all access options for this article.
