透過您的圖書館登入
IP:3.136.154.103
  • 學位論文

解決紡織業布料切割問題

Solving textile material cutting problem

指導教授 : 陳育欣

摘要


成衣業裡,減少原布料的浪費是個重要的課題,要有效避免多餘的消耗,必需要有系統的進行切割和加工,此問題在業界裡稱為是馬克作業或是馬克作圖,其作業流程有著特別的專業在處理,是不可小看之作業問題。馬克為剪裁部裡的工作用語,是企業生產中所佔成本較高的單位,因而馬克的剪裁對成本的控制直接的關係到企業的盈虧,具有良好的成本觀念的工作者,除了節省布料的浪費,也可使企業在經營中賺錢,反之企業就會賠錢 本研究為分析成衣工廠如何有效減少裁切原料時所產生的浪費,成衣工廠在製作衣服前會先裁切大物件的原料再裁切成各種小物件的成衣商品,而根據裁切方式所產生的浪費也會不同,如何再滿足顧客需求下有效裁切原料就是我們要探討的問題。本研究用蟻群演算法和模擬退火法計算以及隨機挑選方法,比較各個演算法結果,發現蟻群演算法有最好的結果。最後提出對於成衣業之未來發展之建議。

並列摘要


In clothing industry, lowering the use of extra textile material is an important task. To avoid wasting materials, there must be an effective way to cut these textile material; there is specialty on working these problem, called Marker making. A Marker is a unit that represent as a high costing unit. Controlling the use of Marker can impact a company’s profit and loss. This study is to find out how to reduce wasting textile material in an effective way when producing clothes. A clothing company usually cut its textile material into small segments. Based on how it is cut, the amount of textile waste will be different. Our study is to find an effective way to cut those textile materials to make sure all textile materials are satisfied on all clothing demands. In this study, we use Ant Colo-ny Algorithm and Simulated Annealing Algorithm and random picking to compare their results; Ant Colony Algorithm turns out to have the best result. A suggestion for the future of the textile industry is provided.

參考文獻


瞿宛文 (2007). "重看臺灣棉紡織業早期的發展" 新史學十九卷一期
許棻如 (2006). "台灣織布、染整及成衣業之物質流與其成長環境因素分析."中原大學碩士論文
黃佩鈺 (2008). "紡織成衣業升級模式的省思一以五分埔成."華岡紡織期刊
M.Ali Jan Ghasab, , S. Khamis, F. Mohammad and H. Jahani Fariman (2015). "Feature decision-making ant colony optimization system for an automated recognition of plant species." Expert Systems with Applications 42(5): 2361-2370.
L.Hao-Chun, and H. Yao-Huei (2015). "An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry." European Journal of Operational Research 246(1): 51-65.

延伸閱讀