ALGORITHM FOR NC TURRET PUNCH PRESS TOOL LOCATION AND HIT SEQUENCING.

Robert A. Walas, Ronald Askin

Research output: Contribution to journalArticle

41 Citations (Scopus)

Abstract

A new heuristic algorithm is proposed for minimizing part programs for numerical control (NC) punch presses. The part program contains the order in which the holes are punched into the part and the assignments of the tools to the indexing turret. The problem is broken down into two classical subproblems: the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). By generating a feasible solution and then alternatively improving the subproblems, good solutions are obtained in reasonable time. The algorithm is described, and then empirical results are given for applying the algorithm to real and randomly generated problems.

Original languageEnglish (US)
Pages (from-to)280-287
Number of pages8
JournalIIE Transactions (Institute of Industrial Engineers)
Volume16
Issue number3
StatePublished - Sep 1984
Externally publishedYes

Fingerprint

Punch presses
Traveling salesman problem
Heuristic algorithms
Numerical control
Sequencing

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

ALGORITHM FOR NC TURRET PUNCH PRESS TOOL LOCATION AND HIT SEQUENCING. / Walas, Robert A.; Askin, Ronald.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 16, No. 3, 09.1984, p. 280-287.

Research output: Contribution to journalArticle

@article{085932cac634487b92eaa97d481fed7c,
title = "ALGORITHM FOR NC TURRET PUNCH PRESS TOOL LOCATION AND HIT SEQUENCING.",
abstract = "A new heuristic algorithm is proposed for minimizing part programs for numerical control (NC) punch presses. The part program contains the order in which the holes are punched into the part and the assignments of the tools to the indexing turret. The problem is broken down into two classical subproblems: the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). By generating a feasible solution and then alternatively improving the subproblems, good solutions are obtained in reasonable time. The algorithm is described, and then empirical results are given for applying the algorithm to real and randomly generated problems.",
author = "Walas, {Robert A.} and Ronald Askin",
year = "1984",
month = "9",
language = "English (US)",
volume = "16",
pages = "280--287",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "3",

}

TY - JOUR

T1 - ALGORITHM FOR NC TURRET PUNCH PRESS TOOL LOCATION AND HIT SEQUENCING.

AU - Walas, Robert A.

AU - Askin, Ronald

PY - 1984/9

Y1 - 1984/9

N2 - A new heuristic algorithm is proposed for minimizing part programs for numerical control (NC) punch presses. The part program contains the order in which the holes are punched into the part and the assignments of the tools to the indexing turret. The problem is broken down into two classical subproblems: the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). By generating a feasible solution and then alternatively improving the subproblems, good solutions are obtained in reasonable time. The algorithm is described, and then empirical results are given for applying the algorithm to real and randomly generated problems.

AB - A new heuristic algorithm is proposed for minimizing part programs for numerical control (NC) punch presses. The part program contains the order in which the holes are punched into the part and the assignments of the tools to the indexing turret. The problem is broken down into two classical subproblems: the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). By generating a feasible solution and then alternatively improving the subproblems, good solutions are obtained in reasonable time. The algorithm is described, and then empirical results are given for applying the algorithm to real and randomly generated problems.

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

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

M3 - Article

VL - 16

SP - 280

EP - 287

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 3

ER -