arrow
返回

An efficient deterministic heuristic for two-dimensional rectangular packing

delete2012-07-01
delete52
PRE
AI
何
何琨 (Kun He)
W
Wenqi Huang *
金
金燕 (Jin Yan)
DOI:10.1016/j.cor.2011.08.005delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper proposes a deterministic heuristic, a best fit algorithm (BFA), for solving the NP-hard two-dimensional rectangular packing problem to maximize the filling rate of a rectangular sheet. There are two stages in this new approach: the constructive stage and the tree search stage. The former aims to rapidly generate an initial solution by employing the concepts of action space and fit degree in evaluating different placements. The latter seeks to further improve the solution and searches for promising placements by a partial tree search procedure. We then compare BFA with other approaches in terms of solution quality and computing time. We carry out computational experiments on two sets of well-known benchmark instances, C21 proposed by Hopper and Turton, and N13 proposed by Burke et al. BFA gained an average filling rate of 100% for the C21 instances within short times, indicating that all the layouts obtained are optimal. To the best of our knowledge, this is the first time that optimal layouts on all the 21 instances were obtained by a deterministic algorithm. As for the N13 instances, to date, researchers have found optimal solutions to the first three instances, whereas BFA solved seven, including the first three, within a reasonable period. An additional work is to adapt BFA to solve a relevant problem, the constrained two-dimensional cutting (or packing) problem (CTDC). Though BFA is not for the CTDC in the original design such that some specific characteristics of CTDC are not considered, the adapted algorithm still performed well on 21 public CTDC instances. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
NP-hard
Heuristic
Rectangular packing
Action space
Smooth degree
Fit degree
AI总结

AI总结

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

期刊

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

机构

暂无机构信息
引用论文

引用论文

Immunohistochemistry of Lung Cancer: Cell differentiation and Growth Properties
err1989-01-01
err0
PREAI
errYukio Shimosato; Setsuo Hirohashi; Takashi Nakajima; Masayuki Noguchi
err分享
err收藏
Simulation of geosynchronous radar and atmospheric phase compensation constraints
err2013-01-01
err0
PREAI
errS.E. Hobbs; C. Mitchell; B. Snapir; R. Burren; P. Whittaker; B. Forte; R. Corstanje; K. Graham; R. Holley
err分享
err收藏
Prohibitin 1 inhibits cell proliferation and induces apoptosis via the p53-mediated mitochondrial pathway in vitro
err2024-02-15
err0
errOAAI
errJuan-Juan Shi; Yi-Kai Wang; Mu-Qi Wang; Jiang Deng; Ning Gao; Mei Li; Ya-Ping Li; Xin Zhang; Xiao-Li Jia; Xiong-Tao Liu; Shuang-Suo Dang; Wen-Jun Wang
err分享
err收藏
err分享
err收藏
The effect of 3-nitropropionic acid on behavioral dysfunction, neuron loss and gliosis in the brain of adult male rats: The case of prefrontal cortex, hippocampus and the cerebellum
err2020-08-01
err0
PREAI
errAbolfazl Torabi; Mohammadjavad Joneidi; Ibrahim Mohammadzadeh; Mohammad-amin Abdollahifar; Aysan Khatmi; Samira Ezi; Meysam Hassani Moghaddam; Romina Rafiei; Farshad Kahrizirad; Mohsen Norozian; Abbas Aliaghaei
err分享
err收藏
An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets
err2003-04-15
err0
PREAI
errSalvatore Orlando; Paolo Palmerini; Raffaele Perego; Fabrizio Silvestri
err分享
err收藏
学者 查看更多内容