期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 61, 期 2, 页码 306-320出版社
TAYLOR & FRANCIS LTD
DOI: 10.1057/jors.2008.141
关键词
cutting and packing; manufacturer's pallet loading problem; woodpulp stowage problem; non-guillotine cutting pattern; dynamic programming; raster points
资金
- PRONEX-Optimization [E-26/171.510/2006-APQ1]
- FAPESP [2006/53768-0, 2006/03496-3, 2005/57984-6]
- CNPq [PROSUL 490333/2004-4, 522973/1995-4]
In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heuristic and an L-approach for packing rectangles into larger rectangles and L-shaped pieces. The combined approach is able to rapidly find the optimal solutions of all instances of the pallet loading problem sets Cover I and II (more than 50 000 instances). It is also effective for solving the instances of problem set Cover III (almost 100 000 instances) and practical examples of a woodpulp stowage problem, if compared to other methods from the literature. Some theoretical results are also discussed and, based on them, efficient computer implementations are introduced. The computer implementation and the data sets are available for benchmarking purposes. Journal of the Operational Research Society (2010) 61, 306-320. doi: 10.1057/jors.2008.141 Published online 4 February 2009
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据