A new metaheuristic genetic-based placement algorithm for 2D strip packing

Solving 2d-strip Packing Problem Using Genetic Algorithm

A genetic algorithm for the two-dimensional strip-packing problem

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 container-loading problem (CLP) with a single container to be loaded. The characteristic features of the ...

A Genetic Algorithm for a 2D Industrial Packing Problem

Cutting and packing problems are encountered in many industries, with different industries incorporating different constraints and objectives. The wood-, glassand paper industry are mainly concerned with the cutting of regular figures, whereas in the ship building, textile and leather industry irregular, arbitrary shaped items are to be packed. In this paper two genetic algorithms are described...

A Reinforced Tabu Search Approach for 2D Strip Packing

This paper deals with a particular “packing” problem, namely the two dimensional strip packing problem, where a finite set of objects have to be located in a strip of fixed width and infinite height. The variant studied here considers regular items (they are rectangular to be more precise) that must be packed without overlap, rotations being not allowed. The objective is to minimize the height ...

An Exact Method for the 2D Guillotine Strip Packing Problem

We consider the two-dimensional strip packing problem with guillotine cuts. The problem consists in packing a set of rectangular items on one strip of width W and infinite height. The items packed without overlapping must be extracted by a series of cuts that go from one edge to the opposite edge guillotine constraint . To solve this problem, we use a dichotomic algorithm that uses a lower boun...

A Harmonic Algorithm for the 3D Strip Packing Problem

In the three dimensional strip packing problem, we are given a set of three dimensional rectangular items and a three dimensional box B. The goal is to pack all the items in B such that the height of the packing is minimized. We consider the most basic version of the problem, where the items must be packed with their edges parallel to the edges of B and cannot be rotated. Building upon Caprara’...