engleski

Application of Sequence Pair on 2D-Irregular Strip-Packing Problem

Strip-packing problem is a common problem in textile industry that occurs in the process of automated marker making. Problem goal is to find optimal placement i.e. optimal positions of cutting patterns on material so the following conditions are met: each pair of cutting patterns must not overlap and their surface area needs to be within the boundary of rectangular material area. An optimal placement that utilizes material usage needs to be created. In this paper the problem is approached using sequence pair abstract presentation method to obtain a non-overlapping placement. Cutting patterns positions and material dimensions are calculated using longest common subsequence (LCS) method. This method is combined with simulated annealing algorithm to find optimal items placement. Experiments have been performed on three datasets of a male robe with material utilization of about 76%.

irregular items ; longest common subsequence ; nesting problem ; optimization ; sequence pair ; strip-packing problem

nije evidentirano