期刊文献+

二维板材组包排样问题的离散差分进化算法求解 被引量:4

Solving Two-Dimensional Rectangular Boards Packing and Stacking Problems with Discrete Differential Evolution Algorithm
下载PDF
导出
摘要 为了提高包装箱的空间利用率,提出一种基于离散差分进化算法的方法,以求解二维板材组包排样问题.采用带符号的序列代表一个排样方案,提出了基于最低水平线的空隙可再利用启发式算法,对单个包的子序列进行解码,获得对单包的排样子问题的自动排样方案,使板材充分填充产生的空隙;为了改进排样结果,提出邻近策略以进一步提高空间利用率.实验结果表明,对仿真实验数据,该算法获得了比遗传算法更好的结果;对实际生产数据,该算法所得结果比原有排样方案的空间利用率更高. To improve space utilization of packages, a new approach based on discrete differential evolution algorithm is proposed to solve the two dimensional rectangular board packing and stacking problem. In the algorithm, a signed sequence is used to denote a solution to the problem and in order to make the best use of gaps, a new lowest horizontal line-gap reuse heuristic is proposed to decode the sub-sequence for a single package, which results in a packing solution to the sub-problem for this package. In order to improve the packing results, an adjacent strategy is also proposed to improve the overall space utilization of each solution. The experimental results show that the algorithm performs better than genetic algorithms when tested by the simulation data and it obtains better space utilization than that of the original packing solutions when tested by the real production data.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2012年第3期406-413,共8页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(60804053 60835001) 教育部博士点新教师基金(200805611065) 中央高校基本科研业务费专项资金
关键词 板材组包 离散差分进化算法 排样 rectangular boards stacking discrete differential evolution algorithm packing
  • 相关文献

参考文献11

二级参考文献133

共引文献211

同被引文献26

  • 1刘胡瑶,何援军.基于重心NFP的二维不规则形状排样算法[J].中国机械工程,2007,18(6):723-726. 被引量:12
  • 2陈端兵,黄文奇.求解矩形packing问题的贪心算法[J].计算机工程,2007,33(4):160-162. 被引量:15
  • 3Mitsukuni, Matayoshi. Two dimensional rectilinear polygon packing using genetic algorithm with a hierarchical chromosome [C]//Anchorage, Alaska, USA: IEEE International Conference on Systems, Man, and Cybernetics, 2011: 989-996. 被引量:1
  • 4ZHANG Pengcheng, ZHANG Rongjie. Solved rectangle's NFP by polygon segmentation [C]//CangZhou, China: IEEE International Conference on Power Eng, Hebei Eng & Tech Coll, 2011: 1625-1628. 被引量:1
  • 5宋晓霞.遗传算法中初始群体技术的改进与实现[J].计算机工程与设计,2007,28(22):5485-5487. 被引量:5
  • 6Egeblad J, Nielsen B K, Odgaard A. Fast neighborhood search for two-and three-dimensional nesting problems [J]. European Journal of Operational Research, 2007, 183(3): 1249-1266. 被引量:1
  • 7Gomes A M, Oliveira J F. A 2-exchange heuristic for nesting problems[J]. European Journal of Operational Research, 2002,141(2), 359-370. 被引量:1
  • 8Bennell J A, Dowsland K A, Dowsland W B. The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon[J]. Computer & Operations Research, 2001, 28(3): 271-287. 被引量:1
  • 9Bennell J A, Oliveira J F. The geometry of nesting problems:a tutorial[J]. European Journal of Operational Research, 2008, 184(2): 397-415. 被引量:1
  • 10武猛,张振兴.微分几何[M].北京:中国时代经济出版社,2011. 被引量:1

引证文献4

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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