共 50 条
Hybrid Heuristics for Marker Planning in the Apparel Industry
被引:0
|作者:
Yu-Chung Tsao
Chia-Hsin Hung
Thuy-Linh Vu
机构:
[1] National Taiwan University of Science and Technology,Department of Industrial Management
[2] National Taiwan University of Science and Technology,Artificial Intelligence for Operations Management Research Center
[3] Asia University,Department of Business Administration
[4] China Medical University Hospital,Department of Medical Research
[5] China Medical University,undefined
来源:
关键词:
Heuristics;
Marker planning;
Genetic algorithm;
Simulated annealing;
Hybrid algorithm;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
Given the diversity of styles and sizes in apparel, marker planning which aims to arrange and move all the pattern parts of garments onto a long thin paper before the cutting process is a very important process for the apparel industry. In order to decrease the wastage of fabric after the cutting process, the marker layout essentially needs to be as compact as possible. In this paper, hybrid heuristics are proposed to conduct and achieve an optimized marker layout and length. First, a moving heuristic is presented as a new packing method to arrange and move the patterns without overlapping; here, an initial marker is presented to calculate the length. This heuristic considers multiple rotated angles and flipping positions of the patterns in order to obtain more diverse arrangements. With different arrangements, there is a higher chance of achieving an optimized marker layout and length. To further improve the solution received from the moving heuristic, soft computing algorithms are taken into account, including the genetic algorithm (GA), simulated annealing (SA), and hybrid genetic algorithm-simulated annealing (HGASA) to achieve a shorter length in the marker layout. The best marker length can be obtained from HGASA, which can save almost 28% of the length. Special cases with specific combinations in rotated angles are considered so that the industry can make informed choices on the algorithms suitable to address the marker planning problem.
引用
收藏
页码:10077 / 10096
页数:19
相关论文