85 0

개수 제한이 없는 2차원 절단문제를 위한 향상된 최적해법

Title
개수 제한이 없는 2차원 절단문제를 위한 향상된 최적해법
Other Titles
An Improved Exact Algorithm for the Unconstrained Two-Dimensional Cutting Problem
Author
강맹규
Keywords
optimization; two-dimensional; cutting; packing
Issue Date
2001-12
Publisher
Korean Institute Of Industrial Engineers
Citation
Journal of the Korean Institute of Industrial Engineers, v. 27, no. 4, page. 424-431
Abstract
This paper is concerned with the unconstrained two-dimensional cutting problem of cutting small rectangles (products), each of which has its own profit and size, from a large rectangle (material) to maximize the profit-sum of products. Since this problem is used as a sub-problem to generate a cutting pattern in the algorithms for the two-dimensional cutting stock problem, most of researches for the two-dimensional cutting stock problem have been concentrated on solving this sub-problem more efficiently. This paper improves Hifi and Zissimopoulos's recursive algorithm, which is known as the most efficient exact algorithm, by applying newly proposed upper bound and searching strategy. The experimental results show that the proposed algorithm has been improved significantly in the computational amount of time as compared with the Hifi and Zissimopulos's algorithm.
URI
https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE01914691?https://repository.hanyang.ac.kr/handle/20.500.11754/160458
ISSN
1225-0988; 2234-6457
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE