Stack-up algorithms for palletizing at delivery industry

Stack-up algorithms for palletizing at delivery industry

0.00 Avg rating0 Votes
Article ID: iaor20013905
Country: Netherlands
Volume: 128
Issue: 1
Start Page Number: 74
End Page Number: 97
Publication Date: Jan 2001
Journal: European Journal of Operational Research
Authors: ,
Keywords: computational analysis, distribution
Abstract:

We study the following multi-objective combinatorial stack-up problem from delivery industry. Given a sequence q of labeled bins and two positive integers s and p. The aim is to stack-up the bins by iteratively removing one of the first s bins of the sequence and putting it in one of p stack-up places. Each of these places has to contain bins of only one label, bins of different labels have to be placed in different places. If all bins of a label are removed from q, the corresponding place becomes available for bins of another label. We analyze the worst-case performance of simple algorithms for the stack-up problem that are very interesting from a practical point of view. In particular, we show that the so-called Most-Frequently on-line algorithm is (2,2)-competitive and has optimal worst-case on-line performance.

Reviews

Required fields are marked *. Your email address will not be published.