In this contribution, a parallel hybrid local search algorithm for the three-dimensional container loading problem (CLP) is proposed. First a simulated annealing method for the CLP is developed, which is then combined with an existing tabu search algorithm to form a hybrid metaheuristic....

Der Beitrag präsentiert einen hybriden genetischen Algorithmus für das Containerbeladeproblem mit quaderförmigen Packstücken verschiedener Größe und einem zu beladenden Container. Erzeugte Staupläne umfassen mehrere vertikale Schichten, in denen jeweils einige Kisten plaziert sind....

Given a finite set of circles of different sizes we study the Strip Packing Problem (SPP) as well as the Knapsack Problem (KP). The SPP asks for a placement of all circles (without overlap) within a rectangular strip of fixed width so that the variable length of the strip is minimized. The KP...

Given a finite set of spheres of different sizes we study the three-dimensional StripPacking Problem (3D-SPP) as well as the three-dimensional Knapsack Problem (3D-KP).The 3D-SPP asks for a placement of all spheres within a cuboidal strip of fixed width andheight so that the variable length of...

Der Beitrag stellt das Konzept eines genetischen Algorithmus (GA) für ein dynamisches Dispositionsproblem vor, das als Verallgemeinerung der Planungssituation einer Teilladungsspedition im Gelegenheitsverkehr aufgefaßt werden kann. Im Unterschied zu verwandten Problemen in der Literatur wird...

The paper presents a genetic algorithm (GA) for the two-dimensional strip-packing problem (SPP) with rectangular shaped pieces. Both the non-guillotinable SPP and the guillotinable SPP can be tackled. The genetic algorithm has been derived from a GA that was proposed earlier for solving the...

The capacitated vehicle routing problem with three‐dimensional loading constraints combinescapacitated vehicle routing and three‐dimensional loading with additional packing constraints whichconcern, for example, unloading operations. An efficient hybrid algorithm including a tabu...

The paper presents a tree search algorithm for the three-dimensional container loading problem(3D-CLP). The 3D-CLP is the problem of loading a subset of a given set of rectangularboxes into a rectangular container so that the packed volume is maximized. The method hastwo variants: the packing...