返回
An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
DOI:10.1016/j.cor.2009.09.011.png)
摘要
En 中文
Arbitrary shaped rectilinear block packing problem is a problem of packing a series of rectilinear blocks into a larger rectangular container, where arbitrary shaped rectilinear block is a polygonal block whose interior angle is either 90 degrees or 270 degrees. This problem involves many industrial applications, such as VLSI design, timber cutting, textile industry and layout of newspaper. Many algorithms based on different strategies have been presented to solve it. In this paper, we proposed an efficient heuristic algorithm which is based on principles of corner-occupying action and caving degree describing the quality of packing action. The proposed algorithm is tested on six instances from literatures and the results are rather satisfying. The computational results demonstrate that the proposed algorithm is rather efficient for solving the arbitrary shaped rectilinear block packing problem. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Rectilinear block packing
Heuristic algorithm
Corner-occupying action
Caving degree
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Fine-structural Observations on Siliceous Scale Production and Shell Assembly in the Testate Amoeba Paulinella chromatophora硅质鳞片产生和壳体组装的精细结构观察:以有壳阿米巴Paulinella chromatophora为例
Protist
IF0
Factors Determining Implementation of Exclusive Breastfeeding in South Western Oromia, Ethiopia影响埃塞俄比亚奥罗米亚西南部纯母乳喂养实施的因素

