Resumen
In this paper, we present an efficient solution to determine the best sequence of G commands of a set of holes for a printed circuit board in order to find the hole-cutting sequence that shortens the cutting tool travel path. A Parallel proposal of Ant Colony Optimization was used to find an optimal travel path, then the new G-codes sequence is used instead the original sequence as part of the process program. This application can be formulated as a special case of the Traveling Salesman Problem (TSP).
Idioma original | Inglés |
---|---|
Publicación | Engineering Letters |
Volumen | 20 |
N.º | 1 |
Estado | Publicada - 27 feb. 2012 |
Publicado de forma externa | Sí |