한국해양공학회지 (Journal of Ocean Engineering and Technology)

  • 제26권4호
  • /
  • Pages.8-14
  • /
  • 2012
  • /
  • 1225-0767(pISSN)
  • /
  • 2287-6715(eISSN)
한국해양공학회 (Korean Society of Ocean Engineers)
권호 표지
DOI QR코드

DOI QR Code

휴리스틱 탐색 기법을 이용한 네스팅 전문가 시스템

Nesting Expert System using Heuristic Search

  • 신동목 (울산대학교 조선해양공학부)
  • Sheen, Dong-Mok (School of Naval Architecture and Ocean Engineering, University of Ulsan)
  • 투고 : 2012.05.17
  • 심사 : 2012.07.12
  • 발행 : 2012.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Two dimensional nesting is a common problem in industries such as the shipbuilding, automotive, clothing, shoe-making, and furniture industries, in which various parts are cut off from stock or packed in a flat space while minimizing waste or unoccupied space. Nesting is known as an NP-complete problem, which has a solution time proportional to the superpolynomial of the input size. It becomes practically impossible to find an optimal solution using algorithmic methods as the number of shapes to nest increases. Therefore, heuristic methods are commonly used to solve nesting problems. This paper presents an expert system that uses a heuristic search method based on an evaluation function for nesting problems, in which parts and stock are represented by pixels. The system is developed in CLIPS, an expert system shell, and is applied to four different kinds of example problems to verify its applicability in practical problems.

키워드

참고문헌

  1. 이철수, 박광렬 (1996). "선박용 플랫바의 자동네스팅 및 가스/플라즈마에 의한 NC 절단", 산업공학, 제9권, 제3호, pp 283-297.
  2. 한국찬, 나석주 (1994). "레이저 절단공정에서 절단부재의 최적 배치를 위한 네스팅 알고리즘", 대한용접학회지, 제12권, 제2호, pp 11-19.
  3. 한창봉, 박제웅 (1999). "파라메트릭 매크로를 이용한 부재생성 및 네스팅에 관한 연구", 한국해양공학회지, 제13권, 제2호, pp 176-185.
  4. Babu, A.R. and Babu, N.R. (2001). "A Generic Approach for Nesting of 2-D Parts in 2-D Sheets using Genetic and Heuristic Algorithms", Computer-Aided Design, Vol 33, pp 879-891.
  5. Bennell, J.A. and Oliveira, J.F. (2008). "The Geometry of Nesting Problems: A Tutorial", European Journal of Operational Research, Vol 184, pp 397-415. https://doi.org/10.1016/j.ejor.2006.11.038
  6. Burke, E.K., Hellier, R.S.R., Kendall, G. and Whitwell, G. (2007). "Complete and Robust No-fit Polygon Generation for the Irregular Stock Cutting Problem", European Journal of Operational Research, Vol 179, pp 27-49. https://doi.org/10.1016/j.ejor.2006.03.011
  7. Lee, W.-C., Ma, H. and Cheng, B.-W. (2008). "A Heuristic for Nesting Problems of Irregular Shapes", Computer-Aided Design, Vol 40, pp 625-633. https://doi.org/10.1016/j.cad.2008.02.008
  8. Tay, F.E., H. Chong, T.Y. and Lee, F.C. (2002). "Pattern Nesting on Irregular-shaped Stock using Genetic Algorithms", Engineering Applications of Artificial Intelligence, Vol 15, pp 551-558. https://doi.org/10.1016/S0952-1976(03)00009-5
  9. Weng, W.C. and Kuo, H.C. (2011). "Irregular Stock Cutting System Based on AutoCAD", Advances in Engineering Software, Vol 42, pp 634-643. https://doi.org/10.1016/j.advengsoft.2011.04.009

피인용 문헌

  1. Study on the Application of an Expert System to Arrangement Design of Submarine vol.51, pp.2, 2014, https://doi.org/10.3744/SNAK.2014.51.2.138
  2. An analysis of shipyard spatial arrangement planning problems and a spatial arrangement algorithm considering free space and unplaced block vol.95, pp.9-12, 2018, https://doi.org/10.1007/s00170-017-1525-1