期刊文献+

矩形布局问题吸引子法研究 被引量:2

Research on attractive factor approach in rectangular packing problem
下载PDF
导出
摘要 吸引子法是布局定位函数中的一种,在解决布局问题中取得了较好的效果。论文的研究,获得了吸引子法的一些基本性质:诸如定位函数的三维图像为一个平面、定位函数值相等的点共线、吸引子法使矩形块堆积在一个角上等。此外,通过研究布入点的几何意义,提出了一种手动快速布局方法。最后通过研究吸引子放置位置对布局的影响,还得出了隐性吸引子这一重要的性质。 The attractive factor approach,which is one of the location function approach,has gotproduces better results in the packing problems.This paper researches the attractive factor approach and gets some basic properties of it as follows: Such as the 3D image of the location function is a plane,the points with equal values of the location function are on the same straight line,the rectangular items are piled in a corner by the attractive factor approach,and so on.In addition,a manual rapid-packing method is given by studying the geometry significance of the pack-in point.In the end,the property which is about the of being an invisible attractive factor is obtained by studying the effect of the position of the attractive factors.
作者 王金敏 齐杨
出处 《图学学报》 CSCD 北大核心 2012年第6期38-44,共7页 Journal of Graphics
基金 国家自然科学基金资助项目(60975046)
关键词 布局问题 启发式算法 定位函数 吸引子法 packing problem heuristic algorithms location function attractive factor approach
  • 相关文献

参考文献9

二级参考文献56

共引文献80

同被引文献17

  • 1王金敏,杨维嘉.动态吸引子在布局求解中的应用[J].计算机辅助设计与图形学学报,2005,17(8):1725-1730. 被引量:16
  • 2Dyckhoff H. A typology of cutting and packing problems [J]. European Journal of Operational Research, 1990, 44(2): 145-159.
  • 3Wascher G, HauBner H, Schumann H. An improved typology of cutting and packing problems [J]. European Journal of Operational Research, 2007, 183(3): 1109-1130.
  • 4Cagan J, Shinada K, Yin S. A survey of computational approaches to three-dimensional layout problems [J]. Computer-Aided Design, 2002, 34(8): 597-611.
  • 5Egeblad J, Pisinger D. Heuristic approaches for the two- and three-dimensional knapsack packing problem [J]. Computer & Operations Research, 2009, 36(4): 1026-1049.
  • 6Burke E K, Hyde M, Kendall G, et al. A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics [J]. IEEE Transaction on Evolutionary Computation, 2010, 14(6): 1-17.
  • 7Zhang D F, Yu P, Leung S C H. A heuristic block-loading algorithm based on multi-layer search for the container loading problem [J]. Computers & Operations Research, 2012, 39(10): 2267-2276.
  • 8Wei L J, Oon W C, Zhu W B, et al. A reference length approach for the 3D strip packing problem [J]. European Journal of Operational Research, 2012, 220(1): 37-47.
  • 9Cui Y P, Cui Y D, Tang T B. Sequential heuristic for the two-dimensional bin-packing problem [J]. European Journal of Operational Research, 2015,240(1): 43-53.
  • 10杨春霞,王诺.改进Memetic算法求解集装箱码头泊位岸桥调度问题[J].计算机工程与应用,2011,47(22):233-235. 被引量:4

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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