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...

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....

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al....

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...

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...