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

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

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 journal › Article › peer-review

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 language	English
Journal	Engineering Letters
Volume	20
Issue number	1
State	Published - 27 Feb 2012
Externally published	Yes

Keywords

ACO
Ant colony optimization
CNC
Computer numerical control
Drilling
TSP
Traveling salesman problem

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).",

keywords = "ACO, Ant colony optimization, CNC, Computer numerical control, Drilling, TSP, Traveling salesman problem",

author = "Nataly Medina-Rodr{\'i}guez and Oscar Montiel-Ross and Roberto Sep{\'u}lveda and Oscar Castillo",

year = "2012",

month = feb,

day = "27",

language = "Ingl{\'e}s",

volume = "20",

journal = "Engineering Letters",

issn = "1816-093X",

number = "1",

}

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

KW - ACO

KW - Ant colony optimization

KW - CNC

KW - Computer numerical control

KW - Drilling

KW - TSP

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=84857706945&partnerID=8YFLogxK

M3 - Artículo

SN - 1816-093X

VL - 20

JO - Engineering Letters

JF - Engineering Letters

IS - 1

ER -

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

Abstract

Keywords

Other files and links

Fingerprint

Cite this