標題: 備份件供應鏈系統設計及營運之整合方法
An integrated approach to the design and operation for spare parts logistic systems
作者: 徐楊康
Hsu, Yang-Kang
巫木誠
Wu, Muh-Cherng
工業工程與管理學系
關鍵字: 供應鏈網路設計;零組件結構清單;備份件;基因演算法;類神經網路;禁忌搜尋法;logistic network design;bill of material;spare parts;genetic algorithm;neural network;tabu search
公開日期: 2010
摘要: 資本密集的產業,例如半導體、航太、國防及高鐵等產業而言,備份件管理是非常重要的議題,以建造一座先進半導體晶圓廠而言需要的資本就高達20億美元,其相關的備份件庫存約需總費用的10%~15%左右,其他資本密集產業亦有相同的特點。因此,對這些產業而言,備份件供應鏈系統的設計及營運是非常重要的議題。 本論文提出求解備份件供應鏈系統設計問題的整合方法,供應鏈的設計決策變數包括供應鏈網路設計、供應商選擇以及運輸模式的選擇,論文中提出兩種求解此問題的方法,第一種方法 (approach 1) 是一種同時考量所有設計決策變數的方法,這種方法有兩種演算法 (SGA-1及TGA-1);而第二種方法 (approach 2) 的設計問題求解方法分成兩階段 (two-step approach) 求解。首先,著重於找到供應鏈網路的近似最佳解;接著,從第一階段求解所得到的供應鏈網路解,提出三種演算法分別是 SGA-2、TGA-2 及 NN-GA-Tabu 演算法用以找到備份件供應商與運輸模式選擇的最佳化組合。實驗的數值結果顯示,第二種方法 (approach 2) 勝過第一種方法 (approach 1),而其中 NN-GA-Tabu 演算法更優於其他四種演算法。因此,本論文提出的 NN-GA-Tabu 演算法也可以做為求解其他完整空間搜尋問題得到好解的良好架構。
Spare part management is a very important issue for capitally-intensive industries (e.g., semiconductor manufacturing, aerospace, defense, and high-speed train). Building a leading-edge semiconductor wafer fab may cost up to 2 billion dollars; and the associated spare parts inventory may need 10-15% of the total expenditure. Other capitally-intensive industries also reveal the same characteristics. Thus, the design and operation of a spare part logistic system is very important for these industries. This dissertation attempts to solve a comprehensive design problem for a spare part logistic system. The design factors encompass logistic network design, part vendor selection, and transportation modes selection. Two approaches to solve the problem were proposed. In Approach 1, we simultaneously considered all the design factors and proposed two algorithms (SGA-1 and TGA-1). In Approach 2, the design problem was solved in two stages. Firstly, we aimed to find a near-optimal logistic network. Secondly, with the obtained logistic network, we proposed three algorithms (SGA-2, TGA-2, and NN-GA-Tabu) to find optimal combinations for part vendor and transportation modes selection. Numerical experiments indicate that Approach 2 outperforms Approach 1, and the NN-GA-Tabu outperforms all the other four algorithms. The proposed NN-GA-Tabu might also be a good solution architecture for solving other comprehensive space search problems.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT079033817
http://hdl.handle.net/11536/40267
Appears in Collections:Thesis