A note on an L-approach for solving the manufacturers pallet loading problem

发布时间：2011-06-22 18:39:25

A note on an L-approach for solving the manufacturer’spallet loading problemErnesto G.Birgin∗Reinaldo Morabito†Fabio H.Nishihara‡November19th,2004.AbstractAn L-approach for packing(l,w)-rectangles into an(L,W)-rectangle was intro-duced 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.Inthis note it is shown that,by simply using a different data structure,the runtime isconsiderably reduced in spite of larger(but affordable)memory requirements.Thisreduction is important for practical purposes since it makes the algorithm much moreacceptable for supporting actual decisions in pallet loading.Intensive numerical ex-periments showing the efficiency and effectiveness of the algorithm are presented.Key words:Cutting and packing,pallet and container loading,recursive algorithm,implementation.IntroductionAn interesting case of cutting and packing problems is loading products(packaged in boxes)on a rectangular pallet in such a way as to optimize pallet utilization.This problem is known as the manufacturer’s pallet loading problem if all boxes are identical.This is the situation of a manufacturer that produces goods packaged in identical boxes of size (l,w,h),which are then arranged in horizontal layers on pallets of size(L,W,H)(where H is the maximum height of the loading).It is assumed that the boxes are available in large quantities and are orthogonally loaded on each pallet(that is,with their sides parallel to the pallet sides).

A note on an L-approach for solving the manufacturers pallet loading problem

推荐内容

相关推荐