In this paper we present a hybrid metaheuristic approach called PVS (Progress and Verify Strategy) for the two-dimensional strip packing problem (2SPP). relies on two procedures: local search algorithm that delivers satisfying placements of items horizontal axis, an exact procedure searches positions vertical axis. This last one explores all possibilities, starting with most promising ones, can...

The two dimensional strip packing problem occurs in industries such as metal, wood, glass, paper, and textiles. The problem involves cutting shapes from a larger stock sheet or roll of material, while minimising waste. This is a well studied problem for which many heuristic methodologies are available in the literature, ranging from the basic ‘one-pass’ best-fit heuristic, to the state of the a...

Abstract The minimal convex hulls of disks problem is to find such arrangements circular in the plane that minimize length hull boundary. mixed-integer non-linear programming model, named [17], works only for small moderate-sized problems. Here we propose a polylithic framework big instances by combining following algorithms and models: (i) A fast disk-packing algorithm based on Voronoi diagram...