期刊文献+

基于临界多边形的不规则件启发式排样算法 被引量:17

No-fit-polygon-based heuristic nesting algorithm for irregular shapes
在线阅读 下载PDF
导出
摘要 为提高不规则件启发式排样的材料利用率,提出一种基于重心临界多边形和边适应度的不规则件启发式排样算法GEFHNA。首先,定义了边适应度以衡量排样过程中原材料与不规则件间贴合程度,在此基础上给出了将边适应度与重心NFP(GNFP)相结合的排放策略以减少排样过程中可能产生的空隙面积;其次,给出了基于WeilerAtherton多边形裁剪算法的剩余原材料求解方法,重用排样过程中产生的孔洞,减少孔洞面积;最后,给出了基于上述排样策略和材料重用策略的启发式排样算法GEFHNA,给出了与智能算法和同类软件的实验比较。对欧洲排样问题兴趣小组提供的基准测试用例的实验结果表明,GEFHNA的耗时约为基于智能算法的排样方法的千分之一,同时在与两款商业软件Nest Lib和Sigma Nest的11个基准测试的对比中,GEFHNA获得了7/11个相对最优的排样面积利用率。 To raise the material utilization ratio of heuristic nesting for irregular shapes, a Gravity No-Fit-Polygon (NFP) and Edge Fitness-based Heuristic Nesting Algorithm (GEFHNA) was proposed. Firstly, the definition of Edge Fitness (EF) to measure the fitness between the material and irregular shape produced in the process of packing was defined, and a packing strategy combining Gravity NFP (GNFP) with edge fitness was proposed to reduce the area of gap generated in packing. Secondly, a Weiler-Atherton-based algorithm was presented to compute remained materials and add holes produced in each round of packing to the list of materials. The heuristic packing algorithm prefered the holes in next rounds of packing to reduce proportion of holes in released layout. Finally, a heuristic algorithm based on the previous packing strategy and reuse strategy was put forward and the comparison experiments of GEFHNA with intelligent algorithm and similar softwares were presented. Experimental results on benchmarks provided by ESICUP ( EURO Special Interest Group on Cutting and Packing) show that GEFHNA only has about 1/1000 time consumption of intelligent algorithm-based nesting scheme and achieves 7/11 relatively optimal utilization rate in contrast with two commercial softwares NestLib and SigmaNest.
出处 《计算机应用》 CSCD 北大核心 2016年第9期2540-2544,共5页 journal of Computer Applications
基金 广东省重大科技专项(2012A010701011) 广州市科技计划项目(201200000034)~~
关键词 二维不规则件 排样 临界多边形 启发式方法 two-dimensional irregular packing No-Fit-Polygon (NFP) heuristic method
  • 相关文献

参考文献13

  • 1DYCKHOFF H. A typology of cutting and packing problems [J]. European Journal of Operational Research, 1990, 44(2): 145-159.
  • 2LóPEZ-CAMACHO E, OCHOA G, TERASHIMA-MARíN H, et al. An effective heuristic for the two-dimensional irregular bin packing problem [J]. Annals of Operations Research, 2013, 206(1): 241-264.
  • 3BAKER B S, COFFMAN E G, RIVEST R L. Orthogonal packings in two dimensions [J]. SIAM Journal on Computing, 1980, 9(4): 846-855.
  • 4ALLEN S D, BURKE E K, KENDALL G. A hybrid placement strategy for the three-dimensional strip packing problem [J]. European Journal of Operational Research, 2011, 209(3): 219-227.
  • 5LIU D Q, TENG H F. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles [J]. European Journal of Operational Research, 1999, 112(2): 413-420.
  • 6HOPPER E, TURTON B C H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem [J]. European Journal of Operational Research, 2001, 128(1): 34-57.
  • 7UDAY A, GOODMAN E D, DEBNATH A A. Nesting of irregular shapes using feature matching and parallel genetic algorithms [C]// GECCO 2011: Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation. New York: ACM, 2001: 429-434.
  • 8ALBANO A, SAPUPPO G. Optimal allocation of two-dimensional irregular shapes using heuristic search methods [J]. IEEE Transactions on Systems, Man and Cybernetics, 1980, 10(5): 242-248.
  • 9DOWSLAND K A, VAID S, DOWSLAND W B. An algorithm for polygon placement using a bottom-left strategy [J]. European Journal of Operational Research, 2002, 141(2): 371-381.
  • 10LAMBERT M, MARIAM T, SUSAN F. Weiler—Atherton Clipping Algorithm [M]. Beau Bassin: Betascript Publishing, 2010:35-61.

二级参考文献8

  • 1HOLLAND J H.Adaption in natural and artificial systems[M].Zast Lansing:The University of Michigan Press,1975.
  • 2GOLDBERG D.Genetic algorithm in search,optimization and machine learning[M].New York:Addison-Wesley Publishing Company,1989.
  • 3GLOVER F.Further paths for integer programming and links to artificial intelligence[J].Comput & Ops Res,1986,13(5):533-549.
  • 4GLOVER F,KELLY J,LAGUNA M.Genetic algorithms and tabu search:hybrids for optimization[J].Comput & Ops Res,1995,22(1):111-134.
  • 5MEHRDAD Salami,TIM Hendtlass.A fast evaluation strategy for evolutionary algorithms [J].Applied Soft Computing,2003,2(3),156-173.
  • 6ANDRZEJ Jaszkiewicz.Genetic local search for mult-objective combinatorial optimization[J].European Journal of Operational Research,2002,137(1):50-71.
  • 7KARG R L,THOMPSON L.A heuristic approach to solving travelling saleman problems[J].Management Science,1964,10(2):225-248
  • 8孙艳丰,郑加齐.GATS混合算法及其收敛性研究[J].铁道学报,2000,22(2):94-98. 被引量:11

共引文献29

同被引文献109

引证文献17

二级引证文献58

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部