In this thesis I examine stacking problems with both known and unknown arrival and departure orders. I investigate different stacking strategies that attempt to minimize the number of reshuffling moves that have to be performed to move all containers in and out of the stacking area. First I generate the sequences of arriving and departing containers, which will be used to test the heuristics. Next I implement a brute force approach that checks every possible unique combination of placing the containers and reshuffling them. This method by definition finds the most optimal solution of a problem, but will only be practical for small problem sets as the calculation time increases exponentially with larger problem sets. Using the results from this method I create a function the calculates the minimum number of reshuffling moves that have to be performed for a given problem. Finally some more practical heuristics are developed and tested.

Dekker, R.
hdl.handle.net/2105/11701
Econometrie , Economie & Informatica
Erasmus School of Economics

Timmer, R. (2012, July 27). Container stacking and retrieval strategies for problems with full information. Economie & Informatica. Retrieved from http://hdl.handle.net/2105/11701