Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape

Authors:
Aline M. Del Valle;Thiago A. De Queiroz;FláVio K. Miyazawa;Eduardo C. Xavier
Affiliations:
Institute of Computing, IC, UNICAMP, 13084-971 Campinas - SP, Brazil;Department of Mathematics, DM, UFG/CAC, 75704-020 Catalão - GO, Brazil;Institute of Computing, IC, UNICAMP, 13084-971 Campinas - SP, Brazil;Institute of Computing, IC, UNICAMP, 13084-971 Campinas - SP, Brazil
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 5
Cited 1

A heuristic for nesting problems of irregular shapes

Computer-Aided Design
Recursive computational procedure for two-dimensional stock cutting

IBM Journal of Research and Development
Simulated annealing applied to the irregular rotational placement of shapes over containers with fixed dimensions

Expert Systems with Applications: An International Journal
Mathematical model and efficient algorithms for object packing problem

Computational Geometry: Theory and Applications
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing

Computers and Operations Research

A decision support system for public logistics information service management and optimization

Decision Support Systems

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this paper, the two-dimensional cutting/packing problem with items that correspond to simple polygons that may contain holes are studied in which we propose algorithms based on no-fit polygon computation. We present a GRASP based heuristic for the 0/1 version of the knapsack problem, and another heuristic for the unconstrained version of the knapsack problem. This last heuristic is divided in two steps: first it packs items in rectangles and then use the rectangles as items to be packed into the bin. We also solve the cutting stock problem with items of irregular shape, by combining this last heuristic with a column generation algorithm. The algorithms proposed found optimal solutions for several of the tested instances within a reasonable runtime. For some instances, the algorithms obtained solutions with occupancy rates above 90% with relatively fast execution time.