engleski

Hybridizing Sequence Pair and Bottom-Left Heuristic on Solving 2D-Irregular Strip Packing Problem

Strip-packing problem is a common combinatorial optimization problem from the textile industry. The goal is to find optimal placement of cutting patterns where they do not overlap and do not exceed the boundary of rectangular material area. In this paper a sequence pair abstract representation of cutting patterns is used alongside bounding box approximation. Cutting patterns’ positions and material dimensions are decoded using longest common subsequence method and combined with simulated annealing algorithm. A bottom-left heuristic is then used to improve and to obtain a dense packing. Experiments were conducted in MATLAB on 4 benchmark datasets.

strip-packing problem ; longest common subsequence ; simulated annealing ; sequence pair ; bottom-left heuristic

nije evidentirano