Korean Journal of Computational Design and Engineering (한국CDE학회논문집)

Society for Computational Design and Engineering (한국CDE학회)
권호 표지

A Study and Implementation of the Heuristic Autonesting Algorithm in the 2 Dimension Space

2차원 공간에서의 휴리스틱 배치 알고리즘 및 구현에 관한 연구

  • Published : 1999.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

Keywords

References

  1. European Computing Congress on Interactive Systems A method to improve two-dimensional layout Albano, A.
  2. European Journal of Operation Research v.84 Solution approaches to irregular nesting problems Dowsland, K.A.;Dowsland, W.B.
  3. European Journal of Operation Research v.84 Compaction and separation algorithms for non-convex polygons and their applications Li, Z;Milenkovic, V.
  4. Computer Aided Design v.81 no.1 Nesting two dimensional shapes in rectangular modules Adamowicz, M.;Albano, A.
  5. 판재부품의 가공 자동화를 위한 CAD/CAM 통합 시스템 조경호
  6. Communications of the ACM v.81 no.7 Determining the minumum area encasing rectangle for an arbitrary closed curve Freeman, H.;Shapiram R.
  7. Communications of the ACM v.27 no.3 Efficient nesting of congruent convex figures Dori, D.;Ben-Bassat, M.
  8. International Journal of Production Research v.29 no.8 Accommodating diverse shapes within hexagonal pavers Karoupi, F.;Loftus, M.
  9. Reports of the Ukranian SSR Academy of Science, Series A 10 Minkowski's sum and the hodograph of the dense allocation vector function Stoyan, Y.G.;Ponomarenko, L.D.
  10. Proceedings of the $4^{th}$ Canadian Conference on Computational Geometry Placement and compaction of non-convex polygons for clothing manufacture Milenkovic, V.;Daniels, K.;Li, Z.
  11. European Journal of Operation Research v.84 A new algorithm for the minimal-area convex enclosure problem Grinde, R.B.;Cavalier, T.M.
  12. 레이저 절단공정의 자동화를 위한 자동배치 및 최적 절단 경로 계획에 관한 연구 한국찬
  13. International Journal of Production Research v.30 no.4 New approaches for the nesting of two-dimensional shapes for press tool design Ismail, H.S.;Hon, K.K.B.
  14. European Journal of Operation Research v.88 On genetic algorithms for the packing of polygons Jakobs, S
  15. IEEE Transactions of Systems Man and Cybernetics v.10 no.5 Optimal allocation of two-dimensional irregular shapes using heuristic search methods Albano, A.;Sapuppo, G.
  16. Proceedings of the $4^{th}$ Canadian conference on Computational Geometry Placement and compaction of non-convex polygons for clothing manufacture Milenkovic, V.;Daniels, K.;Li, Z.
  17. Computers and Graphics v.14 no.1 Marker making using automatic placement of irregular shapes for the garment industry Amaral, C.;Bernardo, J.;Jorge, J.
  18. IBM Cambridge Scientific Centre Report 36-Y08 An approach to the two-dimensional irregular cutting stock problem Art, R.C.
  19. Working Paper EBMS/1993/13. European Business Management School UC Swansea Heuristic approaches to irregular cutting problems Dowsland, K.A;Dowsland, W.B.