We examine the 2D strip packing problems with guillotine-cut constraint, where the objective is to pack all rectangles into a strip with fixed width and minimize the total height of the strip. We combine three most successful ideas for the orthogonal rectangular packing problems into a single...

In this paper, we examine the two-dimensional variable-sized bin packing problem (2DVSBPP), where the task is to pack all given rectangles into bins of various sizes such that the total area of the used bins is minimized. We partition the search space of the 2DVSBPP into sets and impose an order...

This paper considers a single container loading problem with practical constraints that address the U.S. legal requirements stipulated in the California Vehicle Code (CVC) related to truck axle weight. The problem is computationally intractable for practical problem cases. We propose an...

The two-dimensional vector packing problem with piecewise linear cost function (2DVPP-PLC) is a practical problem faced by a manufacturer of children׳s apparel that ships products using courier service. The manufacturer must ship a number of items using standard-sized cartons, where the cost of...

In the multiple container loading cost minimization problem (MCLCMP), rectangular boxes of various dimensions are loaded into rectangular containers of various sizes so as to minimize the total shipping cost. The MCLCMP can be naturally modeled as a set cover problem. We generalize the set cover...

The container relocation problem (CRP) is one of the most crucial issues for container terminals. In a single bay, containers belonging to multiple groups should be retrieved by an equipped yard crane in accordance with their retrieval priorities. An operation of the crane can either relocate a...