A* 알고리즘을 적용한 금속 그레이팅 생산 공정에서의 절단문제 해결

• 영문명: Application of A* Algorithm to solve a Cutting Problem in Metal Manufacturing Process
• 발행기관: 한국시뮬레이션학회
• 저자명: 김진명(Jin Myoung Kim) 조대호(Tae Ho Cho)
• 간행물 정보: 『한국시뮬레이션학회 논문지』제14권 제4호, 1~8쪽, 전체 8쪽
• 주제분류: 공학 > 기타공학
• 파일형태: PDF
• 발행일자: 2005.12.30

영문 초록

In a metal grating manufacturing process, the cutting operation allocates the gratings and cut them out from given panels or a plate sheets. Before the cutting operation an operator generates a cutting plan. The cutting plan should decide how pieces of metal rectangles i.e., gratings, are allocated and cut from the panel. This plan generation is a deal of weight on the production cost. the generation of cutting plan is similar to the general two dimensional cutting problem. In this paper, we first define cutting problem and A* algorithm of Artificial Intelligence to solve the problem. Also, through a simulation, we compare the proposed cutting algorithm to an existing method in terms of material loss

목차

1. 서론

2. 배경연구

3. 금속 그레이팅 생산 공정

4 . A* 알고리즘의 적용

5. 휴리스틱 평가함수

6. 시뮬레이션 결과

7. 결론

참고문헌

키워드

Cutting Problem Combinatorial optimization Intelligent search