On improving the productivity of numerically controlled punch presses
- 1 September 1981
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 19 (5) , 471-480
- https://doi.org/10.1080/00207548108956678
Abstract
Numerically Controlled (NO) machines have in recent years revolutionized the production process, but their productivity may yet be increased by the application of new theory to the controlling computer software. This paper describes the improvement in productivity of a class of NC punch presses which operate from either an off-line computer prepared tape or under direct numerical control. The problem of tool selection and table motion during the manufacture of a product by punching an array of holes in a metal sheet with a sequence of various size and shape tools is formulated as a travelling salesman problem (TSP). Two TSP heuristics, one old and one proposed by the authors, are employed in a comparison test with the.NC press manufacturer's heuristic. Both TSP heuristics generally outperform the manufacturer's heuristic by 10% or more.Keywords
This publication has 3 references indexed in Scilit:
- Computational Experience with an M-Salesman Traveling Salesman AlgorithmManagement Science, 1973
- Pathology of Traveling-Salesman Subtour-Elimination AlgorithmsOperations Research, 1971
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964