Construction and Implementation of No-Fit Polygon for Packing and Cutting Problem
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The No-Fit Polygon (NFP) can be used for handling of stock packing and cutting problems with two-dimensional non-regular shape. Previously, NFP has not been widely applied because it is difficult to be implemented and is lack of generic approaches that can cope with all problem cases without specific case-by-case handling. This paper introduces an orbital method. The method can handle the typical degenerate cases, such as holes, interlocking concavities. And we make benchmark for ESICUP datasets which from the literature, proving that this approach can be efficient with almost every situation. It has certain reference significance for the research of the packing and cutting problem.

    Reference
    Related
    Cited by
Get Citation

毛良献,王品.板材排样中非拟合多边形的构造实现方法.计算机系统应用,2019,28(9):168-173

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 01,2019
  • Revised:March 29,2019
  • Adopted:
  • Online: September 09,2019
  • Published: September 15,2019
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063