Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex...

Purpose: The purpose of this paper is to study the Manufacturers pallet-loading problem (MPLP), by loading identical small boxes onto a rectangle pallet to maximise the pallet utilization percentage while reducing the Complexity of loading. Design/methodology/approach: In this research a Block...

Research on container loading problems has helped increase the occupation rate of containers in different practical situations. We consider these problems within a context which might pressure the loading process, leading to sub-optimal solutions. Some facilities like cross-docks have reduced...

This research effort presents a tabu search algorithm to solve the dynamic airlift loading problem. Given a set of palletized cargo items which require transportation from an aerial port of embarkation to an aerial port of debarkation within a pre-specified time frame, the dynamic airlift...

We consider a real-world packing problem faced by a logistics company that loads and ships hundreds of trucks every day. For each shipment, the cargo has to be selected from a set of heterogeneous boxes. The goal of the resulting container loading problem (CLP) is to maximize the value of the...