期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 137, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2019.106097
关键词
Packing; Two-dimensional rectangular packing problem; Angle-occupying placement; Multistart strategy
资金
- National Key R&D Program of China [2017YFB1401300, 2017YFB1401302]
- self-determined research funds of CCNU from the colleges' basic research and operation of MOE [CCNU19ZN011]
This paper presents a deterministic heuristic algorithm for solving the NP-hard two-dimensional rectangular packing problem with the objective of maximizing the filling rate of a rectangular sheet. The key component of the proposed algorithm is a best-fit constructive procedure, according to which, the rectangles are packed into the sheet one by one and each rectangle is packed into the sheet by an angle-occupying placement with maximum fit degree. To further improve the algorithm's searching ability, a look-ahead strategy and a multistart method are introduced. The proposed algorithm is evaluated on five sets of 112 well-known test instances, and the computational results disclose that the proposed algorithm is competitive with the current state-of-the-art algorithms. The effects of the essential components of the proposed algorithm are investigated by a series of experimental analysis. Additionally, we adapt the proposed packing strategy to solve a variant of 2DRP, the constrained two-dimensional cutting (or packing) (CTDC) problem. Computational experiments on 21 classical CTDC problem instances and comparisons with two state-of-the-art algorithms verifies the effectiveness and efficiency of the adapted algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据