ON THE GLOBAL OPTIMUM OF THE NUMERICAL CONTROLLED PUNCH PRESS TOOL LOCATION AND HIT SEQUENCING PROBLEM

Abstract

Walas and Askin developed a heuristic algorithm for the NC (Numerical Controlled) punch press tool location and hit sequencing problem. However, no exact algorithm to this problem has been discussed. This technical note pesents a different formulation of such problems which leads to an exact algorithm for a global optimum. Such an exact algorithm can be established based on the concept of minimum spanning 1-tree in network theory and Lagrangian relaxation

Keywords:

• Numerical control
• Lagrangian relaxation
• traveling salesman problem
• assignment problem