PCB drill path optimization by combinatorial cuckoo search algorithm

30Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Optimization of drill path can lead to significant reduction in machining time which directly improves productivity of manufacturing systems. In a batch production of a large number of items to be drilled such as printed circuit boards (PCB), the travel time of the drilling device is a significant portion of the overall manufacturing process. To increase PCB manufacturing productivity and to reduce production costs, a good option is to minimize the drill path route using an optimization algorithm. This paper reports a combinatorial cuckoo search algorithm for solving drill path optimization problem. The performance of the proposed algorithm is tested and verified with three case studies from the literature. The computational experience conducted in this research indicates that the proposed algorithm is capable of efficiently finding the optimal path for PCB holes drilling process. © 2014 Wei Chen Esmonde Lim et al.

Cite

CITATION STYLE

APA

Lim, W. C. E., Kanagaraj, G., & Ponnambalam, S. G. (2014). PCB drill path optimization by combinatorial cuckoo search algorithm. The Scientific World Journal, 2014. https://doi.org/10.1155/2014/264518

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free