A strategy for finish cutting path generation of compound surfaces

This paper deals with generating paths for cutting irregular parts nested on a metal sheet. The objective is to minimize the total non-cutting time for the cutter head starting at a known location, cutting all the required elements and returning to the known location. In contrast to most literature on this topic, a part does not have to be cut at once. If this reduces the total non-cutting time, it is possible to cut a number of elements on a given part, then cut other parts and then return later to finish cutting the given part. The problem is modeled as a generalized traveling salesperson problem with special precedence constraints. An initial feasible solution is generated and improved by local moves embedded in a tabu search framework. The proposed algorithm shows promising results in comparison with a commercial software package on a limited set of test cases.

Download Full-text

Interference-free cutting-path generation based on scanning data

The International Journal of Advanced Manufacturing Technology ◽

10.1007/bf01176297 ◽

1997 ◽

Vol 13 (8) ◽

pp. 535-547 ◽

Cited By ~ 4

Author(s):

Chih-Young Lin ◽

Yu-Yu Hwang ◽

Jiing-Yih Lai

Keyword(s):

Path Generation ◽

Cutting Path

Download Full-text

Cutting path generation of the Stewart-Platform-Based Milling Machine using an end-mill

International Journal of Production Research ◽

10.1080/00207540010023529 ◽

2001 ◽

Vol 39 (7) ◽

pp. 1367-1383 ◽

Cited By ~ 14

Author(s):

Dein Shaw ◽

Yen-Sheng Chen

Keyword(s):

Stewart Platform ◽

Path Generation ◽

Milling Machine ◽

End Mill ◽

Cutting Path

Download Full-text

An Approach to Efficient Nesting and Cutting Path Optimization of Irregular Shapes

Journal of Ship Production ◽

10.5957/jsp.1999.15.3.129 ◽

1999 ◽

Vol 15 (03) ◽

pp. 129-135

Author(s):

Chang Doo Jang ◽

Yun Keun Han

Keyword(s):

Path Optimization ◽

Raw Material ◽

Path Generation ◽

Generation Algorithm ◽

Calculation Time ◽

Initial Allocation ◽

Irregular Shapes ◽

Cutting Path

A new nesting and cutting path generation algorithm is proposed and a PC-based GUI system is established for user convenience. The proposed algorithm can reduce the calculation time by updating the boundary of raw material after each part is placed and by selecting the vertices of the boundary as initial allocation points. Grouping the parts by their areas and applying the column nesting can improve the nesting efficiency, e.g., waste ratio. Also, optimal cutting paths are found based on an algorithm by allowing all the convex vertices of the parts to be piercing points compared with existing work that used only fixed piercing points.

Download Full-text