An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
作者:
DanielsJohn J.,
GhandforoushParviz,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1990)
卷期:
Volume 41,
issue 2
页码: 141-149
ISSN:0160-5682
年代: 1990
DOI:10.1057/jors.1990.22
出版商: Taylor&Francis
关键词: Cutting Stock;Microcomputer;Pallets
数据来源: Taylor
摘要:
AbstractA personal-computer-based algorithm to solve the non-guillotine-constrained two-dimensional cutting-stock problem is developed. The problem is constrained to single-sized rectangles placed orthogonally on a larger containing rectangle. The algorithm uses the linear combination of box lengths and widths that minimizes waste along the cutting stock's length and width to determine an optimal layout. The algorithm's performance is evaluated using two sets of test cases and compared to the results of other algorithms.
点击下载:
PDF (3520KB)
返 回