Tool path optimization for computer Numerical control machines based on parallel ACO

Nataly Medina-Rodríguez, Oscar Montiel-Ross, Roberto Sepúlveda, Oscar Castillo

Research output: Contribution to journalArticleResearchpeer-review

16 Citations (Scopus)

Abstract

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).
Original languageAmerican English
JournalEngineering Letters
StatePublished - 27 Feb 2012
Externally publishedYes

Fingerprint

Traveling salesman problem
Ant colony optimization
Cutting tools
Printed circuit boards

Cite this

@article{332981bd69604b3dbe35d93561306591,
title = "Tool path optimization for computer Numerical control machines based on parallel ACO",
abstract = "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).",
author = "Nataly Medina-Rodr{\'i}guez and Oscar Montiel-Ross and Roberto Sep{\'u}lveda and Oscar Castillo",
year = "2012",
month = "2",
day = "27",
language = "American English",
journal = "Engineering Letters",
issn = "1816-093X",
publisher = "International Association of Engineers",

}

Tool path optimization for computer Numerical control machines based on parallel ACO. / Medina-Rodríguez, Nataly; Montiel-Ross, Oscar; Sepúlveda, Roberto; Castillo, Oscar.

In: Engineering Letters, 27.02.2012.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Tool path optimization for computer Numerical control machines based on parallel ACO

AU - Medina-Rodríguez, Nataly

AU - Montiel-Ross, Oscar

AU - Sepúlveda, Roberto

AU - Castillo, Oscar

PY - 2012/2/27

Y1 - 2012/2/27

N2 - 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).

AB - 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).

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84857706945&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84857706945&origin=inward

M3 - Article

JO - Engineering Letters

JF - Engineering Letters

SN - 1816-093X

ER -