服装厂布料铺裁问题的启发式算法
A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories
摘要：
研究服装厂的布料铺放与裁剪问题。为了节省材料成本，在不增加服装部件的情况下，应准确地满足裁剪要求。为了降低生产成本，应最小化与使用切割床的频率相对应的铺设数量。提出了一种迭代贪心算法来求解织物展开和裁剪问题。该算法包含一个构造过程和一个改进循环。首先，构造过程按顺序创建一组层，然后改进循环尝试从层集合中拾取每个层，并将剩余层重新排列成较小的层集合。改进回路将一直运行，直到它不能获得任何小的捻置或时间限制到期。对500个案例的实验结果表明，该算法是有效的。
英文摘要：
We study the fabric spreading and cutting problem in apparel factories. For the sake of saving the material costs, the cutting requirement should be met exactly without producing additional garment components. For reducing the production costs, the number of lays that corresponds to the frequency of using the cutting beds should be minimized. We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem. This algorithm contains a constructive procedure and an improving loop. Firstly the constructive procedure creates a set of lays in sequence, and then the improving loop tries to pick each lay from the lay set and rearrange the remaining lays into a smaller lay set. The improving loop will run until it cannot obtain any small lay set or the time limit is due. The experiment results on 500 cases shows that the proposed algorithm is effective and efficient.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
