Abstract
An optimal packing problem of non-convex polygons on a sheet is considered and applied to a textile nesting problem. We propose a procedure of grouping objects and adaptive meta-heuristics. The grouping procedure classifies objects into groups which are then allocated on the sheet using adaptive meta-heuristics. As a result, effectiveness of the meta-heuristics is improved. The performance of the proposed method is compared with other meta-heuristics using simulation experiments. The result shows that the present method is superior to cases where adaptive meta-heuristics without grouping are used.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Takahara, S., Kusumoto, Y. & Miyamoto, S. Solution for textile nesting problems using adaptive meta-heuristics and grouping. Soft Computing 7, 154–159 (2003). https://doi.org/10.1007/s00500-002-0203-9
Issue Date:
DOI: https://doi.org/10.1007/s00500-002-0203-9