Journal of Shanghai Jiao Tong University

Journal of Shanghai Jiaotong University >

2021 , Vol. 55 >Issue 5: 536 - 543

DOI: https://doi.org/10.16183/j.cnki.jsjtu.2020.208

Promotion of a No Fit Polygon Algorithm Based on Trajectory

Expand
  • 1. Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
    2. Shanghai Fangling Software Co., Ltd., Shanghai 200241, China

Received date: 2020-07-06

  Online published: 2021-06-01

Fold

Abstract

The nesting problem is how to nest objects of a specified shape in a two-dimensional space to obtain the maximum space utilization rate, which is of great significance in industrial production. The solution to the nesting problem requires frequent cross-checking of the objects to determine whether the nesting position is legal. The No Fit Polygon algorithm can be used to accelerate the procedure of cross-checking, but the algorithm cannot be used to calculate shapes containing curves, which limits its application. An algorithm based on orbit sliding can calculate No Fit Polygon between shapes which includes arc, but its effectiveness is not satisfactory. Aimed at this problem, and based on trajectory algorithm, the trajectory generation strategy and the profile algorithm are analyzed and improved. The improved algorithm can calculate the No Fit Polygon between shapes containing arc in a shorter time, solving both accuracy and effectiveness problems. Finally, the algorithm is tested in the real punch production process and the results of the test confirms the correctness and effectiveness of the algorithm.

Key words： No Fit Polygon; trajectory algorithm; nesting problem

Cite this article

ZHOU Xin, LAI Xiaoyang, MENG Xiangqun, WANG Kun, TANG Houjun . Promotion of a No Fit Polygon Algorithm Based on Trajectory[J]. Journal of Shanghai Jiaotong University, 2021 , 55(5) : 536 -543 . DOI: 10.16183/j.cnki.jsjtu.2020.208

References

[1] ADAMOWICZ M, ALBANO A. Nesting two-dimensional shapes in rectangular modules[J]. Computer-Aided Design, 1976, 8(1):27-33.
[2] TERRY W, AMICO M D, IORI M. Bin packing problem with general precedence constraints[J]. IFAC-PapersOnLine, 2015, 48(3):2027-2029.
[3] MARTELLO S, PISINGER D, VIGO D. The three-dimensional bin packing problem[J]. Operations Research, 2000, 48(2):256-267.
[4] 孙佳正. 基于不完整临界多边形的二维排样问题的研究[D]. 上海: 华东师范大学, 2018.
[4] SUN Jiazheng. Research on 2D Layout problem based on incomplete No-Fit Polygon[D]. Shanghai: East China Normal University, 2018.
[5] XU J J. An optimization algorithm based on no fit polygon method and hybrid heuristic strategy for irregular nesting problem [C]//The 36th China Control Memories Collection. Dalian: Technical Committee on Control Theory, Chinese Association of Automation, 2017: 1234-1239.
[6] YANG Q. No Fit Polygon for nesting problem solving with hybridizing ant algorithms[J]. Journal of Software Engineering and Applications, 2014, 7(5):433-439.
[7] VALVO E L. Meta-heuristic algorithms for nesting problem of rectangular pieces[J]. Procedia Engineering, 2017, 183:291-296.
[8] 杨卫波, 王万良. 改进临界多边形生成算法[J]. 计算机工程与应用, 2013, 49(1):32-35.
[8] YANG Weibo, WANG Wanliang. Improved algorithm for No-Fit Polygon calculation[J]. Computer Engineering and Applications, 2013, 49(1):32-35.
[9] 杨卫波, 王万良, 张景玲, 等. 基于遗传模拟退火算法的矩形件优化排样[J]. 计算机工程与应用, 2016, 52(7):259-263.
[9] YANG Weibo, WANG Wanliang, ZHANG Jingling, et al. Packing optimization of rectangles based on improved genetic annealing algorithm[J]. Computer Engineering and Applications, 2016, 52(7):259-263.
[10] 刘海明, 周炯, 吴忻生. 应用临界多边形方法与小生境遗传算法求解不规则排样问题[J]. 小型微型计算机系统, 2016, 37(5):1002-1007.
[10] LIU Haiming, ZHOU Jiong, WU Xinsheng. Using No Fit Polygon method and niche genetic algorithm to solve irregular layout problems[J]. Small Microcomputer System, 2016, 37(5):1002-1007.
[11] 周炯. 基于临界多边形方法的二维不规则件排样问题及其算法研究[D]. 广州:华南理工大学, 2015.
[11] ZHOU Jiong. Two-dimensional irregular parts layout problem based on No Fit Polygon method and its algorithm research[D]. Guangzhou: South China University of Technology, 2015.
[12] 汤德佑, 周子琳. 基于临界多边形的不规则件启发式排样算法[J]. 计算机应用, 2016, 36(9):2540-2544.
[12] TANG Deyou, ZHOU Zilin. No-Fit-Polygon-based heuristic nesting algorithm for irregular shapes[J]. Journal of Computer Applications, 2016, 36(9):2540-2544.
[13] 刘胡瑶, 何援军. 基于轨迹计算的临界多边形求解算法[J]. 计算机辅助设计与图形学学报, 2006, 18(8):1123-1129.
[13] LIU Huyao, HE Yuanjun. New algorithm for No Fit Polygon calculation[J]. Journal of Computer-Aided Design & Computer Graphics, 2006, 18(8):1123-1129.
[14] BURKE E K, HELLIER R S R, KENDALL G, et al. Irregular packing using the line and arc No-Fit Polygon[J]. Operations Research, 2010, 58(4):948-970.
Options
Outlines

/

〈 〉