Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
497257 | Applied Soft Computing | 2010 | 14 Pages |
Abstract
The task of marker optimization in clothing production is to eliminate pieces from a work order using an optimal sequence of markers and plies, where the work order is given as a matrix of colors by sizes, markers are vectors of sizes to be laid-out and cut together, and the number of plies determines how many pieces are eliminated from the work order each time. Although the optimality of a marker sequence can be determined in several ways, we consider minimum preparation cost as a key objective in clothing production. The traditional algorithms and the simple evolutionary algorithms used in marker optimization today have relied on minimizing the number of markers, which only indirectly reduces production costs. In this paper we propose a hybrid self-adaptive evolutionary algorithm (HSA-EA) for marker optimization that improves the results of the previous algorithms and successfully deals with the objective of minimum preparation cost.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Iztok Fister, Marjan Mernik, Bogdan FilipiÄ,