• Title, Summary, Keyword: Nesting time

Search Result 33, Processing Time 0.035 seconds

Determination of Nesting Algorithm Fitness Function through Various Numerical Experiments (수치 실험을 통한 조선 강판 전용 Nesting Algorithm의 적합도 함수의 결정)

  • Lee, Hyebin;Ruy, WonSun
    • Journal of Ocean Engineering and Technology
    • /
    • v.27 no.5
    • /
    • pp.28-35
    • /
    • 2013
  • In this paper, a research on the composition of the nesting algorithm fitness function is carried out by performing various numerical experiments to inspect how it affects the scrap efficiency, allocation characteristics, and time consumption, targeting the nesting results of ship parts. This paper specifically concentrates on a method to minimize the scrap ratio and efficiently use the well-defined remnants of a raw plate after the nesting process for the remnant nesting. Therefore, experiments for various ship parts are carried out with the weighting factor method, one of the multi-objective optimum design methods. Using various weighting factor sets, the nesting results are evaluated in accordance with the above purposes and compared with each set for each ship part groups. Consequently, it is suggested that the nesting algorithm fitness function should be constructed differently depending on the characteristics of the parts and the needs of the users.

A New Multi-Stage Layout Approach for Optimal Nesting of 2-Dimensional Patterns with Boundary Constraints and Internal Defects (경계구속 및 내부결함을 고려한 이차원 패턴의 최적배치를 위한 다단계 배치전략)

  • 한국찬;나석주
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.12
    • /
    • pp.3236-3245
    • /
    • 1994
  • The nesting of two-dimensional patterns onto a given raw sheet has applications in a number industries. It is a common problem often faced by designers in the shipbuilding, garment making, blanking die design, glass and wood industries. This paper presents a multi-stage layout approach for nesting two-dimensional patterns by using artificial intelligence techniques with a relatively short computation time. The raw material with irregular boundaries and internal defects which must be considered in various cases of nesting was also investigated in this study. The proposed nesting approach consists of two stages : initial layout stage and layout improvement stage. The initial layout configuration is achieved by the self-organizing assisted layout(SOAL) algorithm while in the layout improvement stage, the simulated annealing(SA) is adopted for a finer optimization.

Nesting Expert System using Heuristic Search (휴리스틱 탐색 기법을 이용한 네스팅 전문가 시스템)

  • Sheen, Dong-Mok
    • Journal of Ocean Engineering and Technology
    • /
    • v.26 no.4
    • /
    • pp.8-14
    • /
    • 2012
  • 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.

A Study on the Optimal Allocation of Irregular Shapes and Cutting Path Optimization (임의 형상 부재의 최적배치 및 절단 경로 최적화에 관한 연구)

  • 한윤근;장창두
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • /
    • pp.27-33
    • /
    • 1999
  • This paper describes a new algorithm for irregular shapes allocation (known as nesting) and cutting path optimization, both implemented in PC-based software with graphic user interface (GUI). Main characteristic of the nesting W is that it deals with only vertices of Placed Pieces to reduce calculation time and for effective allocation. And the other characteristic of the nesting program is that every parts are grouped with respect to their areas and placed along the column of placement region. The cutting paths can be determined by an optimization method called simulated annealing. It was shown that the developed code is superior to other previous nesting H in elapsed time and waste ratio.

  • PDF

Parametric Macro for Two-Dimensional Layout on the Auto-CAD System

  • Kim, Yunyong;Park, Jewoong
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • /
    • pp.253-260
    • /
    • 2000
  • In recent years, a number of successful nesting approaches have been developed by using the various heuristic algorithms, and due to their application potential several commercial CAD/CAM packages include a nesting module for solving the layout problem. Since a large portion of the complexity of the part nesting problem results from the overlapping computation, the geometric representation is one of the most important factors to reduce the complexity of the problem. The proposed part representation method can easily handle parts and raw materials with widely varying geometrical shape by using the redesigning modules. This considerably reduces the amount of processed data and consequently the run time of the computer. The aim of this research is to develop parametric macro for two-dimensional layout on the Auto-CAD system. Therefore, this research can be called "pre-nesting".

  • PDF

Parametric Macro for Two-Dimensional Layout on the Auto-CAD System

  • Kim, Yunyoung;Park, Jewoong
    • Journal of Ship and Ocean Technology
    • /
    • v.4 no.3
    • /
    • pp.13-20
    • /
    • 2000
  • In recent years, a number of successful nesting approaches have been developed by using the various heuristic algorithms, and due to their application potential several commercial CAD/CAM packages include a nesting module for solving the layout problems. Since a large portion of the complexity of the part nesting problem results from the overlapping computation, the geometric representation is one of the most important factors to reduce the complexity of the problem. The proposed part representation method can easily handle parts and raw materials with widely varying geometrical shape by using the redesigning modules. This considerably reduces the amount of processed data and consequently the run time of the computer. The aim of this research is to develop parametric macro for two-dimensional layout on the Auto-CAD system. Therefore, this research can be called "pre-nesting".ing".uot;.

  • PDF

A Study and Implementation of the Heuristic Autonesting Algorithm in the 2 Dimension Space (2차원 공간에서의 휴리스틱 배치 알고리즘 및 구현에 관한 연구)

  • 양성모;임성국;고석호;김현정;한관희
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.3
    • /
    • pp.259-268
    • /
    • 1999
  • 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.

  • PDF

Nesting Problem for Two Dimensional Irregular Shapes using Heuristic (휴리스틱을 이용한 2차원 임의형상 부재 배치 문제)

  • Jeong, Sung-Kyo;Jeon, Geon-Wook
    • IE interfaces
    • /
    • v.21 no.1
    • /
    • pp.8-17
    • /
    • 2008
  • A new search procedure, VLT(Vertex Line Tracing) heuristic, for two dimensional irregular shapes nesting problem was suggested in this study. The VLT heuristic was suggested to the nesting problem to overcome disadvantages of the existing NFP(No-Fit-Polygon) method. This VLT heuristic was compared with the results of the existing benchmark problems suggested by Albano, Hopper, and Burke. The results of the VLT heuristic give efficient solutions in the point of the scrap ratio and computation time. A computer program, NestLogic, using C++ for VLT heuristic was also developed for this nesting problem.

A Study on Development of Automatic Westing Software by Vectorizing Technique (벡터라이징을 이용한 자동부재배치 소프트웨어 개발에 관한 연구)

  • Lho T.J.;Kang D.J.;Kim M.S.;Park Jun-Yeong;Park S.W.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • /
    • pp.748-753
    • /
    • 2005
  • Among processes to manufacture parts from footwear materials like upper leathers, one of the most essential processes is the cutting one optimally arranging lots of parts on raw footwear materials and cutting. A new nesting strategy was proposed for the 2-dimensional part layout by using a two-stage approach, where which can be effectively used for water jet cutting. In the initial layout stage, a SOAL(Self-Organization Assisted Layout) based on the combination of FCM(Fuzzy C-Means) and SOM was adopted. In the layout improvement stage, SA(Simulated Annealing) based approach was adopted for a finer layout. The proposed approach saves much CPU time through a two-stage approach scheme, while other annealing-based algorithm so far reported fur a nesting problem are computationally expensive. The proposed nesting approach uses the stochastic process, and has a much higher possibility to obtain a global solution than the deterministic searching technique. We developed the automatic nesting software of NST(ver.1.1) software for footwear industry by implementing of these proposed algorithms. The NST software was applied by the optimized automatic arrangement algorithm to cut without the loss of leathers. if possible, after detecting damage areas. Also, NST software can consider about several features in not only natural loathers but artificial ones. Lastly, the NST software can reduce a required time to implement generation of NC code. cutting time, and waste of raw materials because the NST software automatically performs parts arrangement, cutting paths generation and finally NC code generation, which are needed much effect and time to generate them manually.

  • PDF

Parametric Macro for Two-Dimensional Cutting Stock in Optimal Processing System of FMS

  • Park, Je-Woong;Kim, Yun-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • /
    • pp.552-552
    • /
    • 2000
  • In recent years, a number of successful nesting approaches have been developed by using the various heuristic algorithms, and due to their application potential several commercial CAD/CAM packages include a nesting module for solving the layout problem. Since a large portion of the complexity of the part nesting problem results from the overlapping computation, the geometric representation is one of the most important factors to reduce the complexity of the problem. The proposed part representation method can easily handle parts and raw materials with widely varying geometrical shape by using the redesigning modules. This considerably reduces the amount of processed data and consequently the run time of the computer. The aim of this research is to develop parametric macro for two-dimensional cutting stock on the Auto-CAD system. Therefore, this research can be called "pre-nesting"

  • PDF