期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 56, 期 12, 页码 1448-1451出版社
PALGRAVE PUBLISHERS LTD
DOI: 10.1057/palgrave.jors.2601960
关键词
cutting and packing; pallet and container loading; recursive algorithrn; implementation
An L-approach for packing (l, w)-rectangles into an (L,W)-rectangle was introduced in an earlier work by Lins, Lins and Morabito. They conjecture that the L-approach is exact and point out its runtime requirements as the main drawback. In this note it is shown that, by simply using a different data structure, the runtime is considerably reduced in spite of larger (but affordable) memory requirements. This reduction is important for practical purposes since it makes the algorithm much more acceptable for supporting actual decisions in pallet loading. Intensive numerical experiments showing the efficiency and effectiveness of the algorithm are presented.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据