A Simple Yet Effective Three Dimensional Container Packing Algorithm

A. Lim and Y.-X. Yang (Singapore)

Keywords

packing, heuristics, combinatorial optimization, logistics

Abstract

In this paper, we study the three dimensional container packing problem. The problem is sub-divided into the sub problems of box selection, space selection, box orientation and new space generation. We devise a simple yet effective method to handle the sub-problems. This, together with an improvement phase based on a taboo list, enables us to ob tain results that are superior to those that were published in the literature.

Important Links:



Go Back


IASTED
Rotating Call For Paper Image