Abstract
Purpose – In this study, the hybrid Taguchi genetic algorithm (HTGA) was used to optimize the computer numerical control-printed circuit boards drilling path. The optimization was performed by searching for the shortest route for the drilling path. The number of feasible solutions is exponentially related to the number of hole positions. The paper aims to discuss these issues. Design/methodology/approach – Therefore, a traveling cutting tool problem (TCP), which is similar to the traveling salesman problem, was used to evaluate the drilling path; this evaluation is considered an NP-hard problem. In this paper, an improved genetic algorithm embedded in the Taguchi method and a neighbor search method are proposed for improving the solution quality. The classical TCP problems proposed by Lim et al. (2014) were used for validating the performance of the proposed algorithm. Findings – Results showed that the proposed algorithm outperforms a previous study in robustness and convergence speed. Originality/value – The HTGA has not been used for optimizing the drilling path. This study shows that the HTGA can be applied to complex problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
