Experiments with a strategic oscillation algorithm for the pallet loading problem

This paper concerns the use of strategic oscillation (SO) for packing problems. The SO algorithm spends a certain time exploring infeasible solutions rather than restricting the search to feasible solutions only. The main features of the algorithm are explained and suggestions on different implementations are given. The pallet-loading problem is probably the simplest form of packing problem and is thus suitable for initial experiments with SO. The results obtained suggest that SO is successful for this problem and that it will probably be fruitful to extend the use of SO to other, harder, packing problems.