This article proposes a new heuristic algorithm 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 alternately 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 language||English (US)|
|Number of pages||8|
|Journal||IIE Transactions (Institute of Industrial Engineers)|
|State||Published - Sep 1984|
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering