Simulated Annealing Approach with an Exhaustive Greedy Search for the Optimal Machining Region Decomposition in CNC Roughing Tool Path Generation

다국어 초록 (Multilingual Abstract)

For machining various parts, it is important to generate efficient tool paths for productivity. At the stage of roughing, the workspaceis sliced and the paths are generated outside the part in each sliced plane. One of important decision variables in planar tool pathgeneration is the direction in which paths are aligned. This paper is about decomposing the machining region and deciding the pathdirection in each subregion so that machining time can be reduced. The machining region is decomposed into discretized meshes andthe path planning problem is formulated as a combinatorial optimization problem. The formulated problem is solved by the simulatedannealing technique. To speed up the overall optimization procedure, the annealing procedure is rather prematurely terminated anda clearing algorithm is applied to remove small subregions. This is needed since the cost function of this problem has many ‘flat’areas and provides ‘narrow’ passages to its optimum.

참고문헌 (Reference)

1 김태정, "선형계획법을 이용한 경로 배정 문제 풀이" 한국경영공학회 14 (14): 31-38, 2009

2 김태정, "그래프의 s-t 절단을 이용한 경로 배정 문제 풀이" 한국정밀공학회 26 (26): 141-147, 2009

3 Sarma, S. E., "The Crossing Function and Its Application to Zig-Zag Toolpaths" 31 (31): 881-890, 1999

4 Kim, T., "Optimal Sweeping Paths on a 2-Manifold:a New Class of Optimization Problems Defined by Path Structures" 19 (19): 613-636, 2003

5 Press, W. H., "Numerical Recipes in C" Cambridge University Press 444-455, 2002

6 Kim, B. H., "Machining Efficiency Comparison of Direction-Parallel Tool Path with Contour-Parallel Tool Path" 34 (34): 89-95, 2002

7 Bang, T., "A Solution of the “Plank Problem”" 2 (2): 990-993, 1951