arrow
返回

An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem

delete2010-06-01
delete14
PRE
AI
D
Duanbing Chen *
J
Jingfa Liu
Y
Yan Fu
M
Mingsheng Shang
DOI:10.1016/j.cor.2009.09.011delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

暂无机构信息
引用论文

引用论文

Chloride Accumulation by Mung Bean Root Tips
err1972-11-01
err0
errOAAI
errDonald F. Gerson; Ronald J. Poole
err分享
err收藏
Information transmission over an amplitude damping channel with an arbitrary degree of memory
err2015-12-29
err0
errOAAI
errAntonio D'Arrigo; Giuliano Benenti; Giuseppe Falci; Chiara Macchiavello
err分享
err收藏
err分享
err收藏
学者 查看更多内容