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

Given a set of rectangular pieces and a rectangular container, the two-dimensional knapsackproblem (2D-KP) consists of orthogonally packing a subset of the pieces within the container suchthat the sum of the values of the packed pieces is maximized. If the value of a piece is given by itsarea...

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 Pickup and Delivery Problem with Time Windows (PDPTW) is a generalization of the well studied Vehicle Routing Problem with Time Windows (VRPTW). Since it models several typical planning situations in operational transportation logistics and public transit, the PDPTW has attracted growing...

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