This article shows some techniques based on simulated annealing and genetic alghoritms for the resolution of a filling problem of a container of two dimensions using rectangular pieces of sizes not congruent. This problem is quite related to problems like bin-packing or strip-packing. The comparative was made using several type problems and having into account parameters like run time, number o...

In rectangle packing problems we are given the task of positioning some axis-aligned rectangles inside a given plane region, so that they do not overlap with each other. In the Maximum Weight Independent Set of Rectangles (MWISR) problem, their position is already fixed and we can only select which rectangles to choose, while trying to maximize their total weight. In the Strip Packing problem, ...

Cutting and packing (C & P) problem is to allocate a set of items to larger rectangular standardized units by minimizing the waste. Bin packing, strip packing and cutting stock problem is well-known classical C & P problem. An overview is provided of several meta-heuristics algorithms of swarm intelligence from the literature for the 2D C & P problem. The objective of this paper is to present a...

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