Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing

Abstract

In this work, the packing of rectangles is modeled based on divisions of the available area, a binary tree codification is used to arrange the pieces so that the guillotines type cutting is guaranteed. A three stages algorithm with individual strategies inspired by algorithms of variable neighborhood search simulated annealing and constructive techniques are used to obtain the solution of the problem. The results obtained are compared using the objective function and percentage used of available area with fifty test cases of the specialized literature and their respective well-known answer with excellent results.

Keywords

• Guillotine
• two-dimensional cutting
• variable neighborhood search
• optimization