Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization

Godfrey C. Onwubolu, Maurice Clerc

International Journal of Production Research · 2004 · 177 citations · 24 references

Concepts

TL;DR

The operating path of automated drilling is a traveling salesman problem, and its travel time dominates production costs in large‑batch PCB manufacturing, motivating cost‑reducing heuristics. The study proposes a new heuristic to minimize the operating path of automated drilling operations. Particle swarm optimization is applied to the traveling salesman formulation of the drilling path, and a model predicts drilling time from the heuristic solution. The method uses few control variables and is versatile, robust, and easy to use.

Abstract

A new heuristic approach for minimizing the operating path of automated or computer numerically controlled drilling operations is described. The operating path is first defined as a travelling salesman problem. The new heuristic, particle swarm optimization, is then applied to the travelling salesman problem. A model for the approximate prediction of drilling time based on the heuristic solution is presented. The new method requires few control variables: it is versatile, robust and easy to use. In a batch production of a large number of items to be drilled such as in printed circuit boards, the travel time of the drilling device is a significant portion of the overall manufacturing process, hence the new particle swarm optimization–travelling salesman problem heuristic can play a role in reducing production costs.

References

24