臺灣博碩士論文加值系統

台灣薄膜電晶體液晶顯示器(thin film transistor liquid crystal display, TFT-LCD)面板製造產業之技術、研發及產能，已具備全球最大製造國的競爭優勢。近來台灣面板業者擴廠情形相當熱絡，對於台灣TFT-LCD面板中段製造業者來說，設施選址已成為一項重要議題。再者，TFT-LCD產業為三層供應鏈結構，因此面板業者在決定工廠位置時必須同時考慮如何決定最佳的配送策略，做出有效的策略以獲得最大利潤。本研究建立二階與三階供應鏈之隨機規劃模型，此模型主要議題考慮需求風險下，決定工廠選址及配送策略問題，求取最大收益。本研究整合基因演算法(GA)及貪婪法則(Greedy)，發展GA-Greedy 演算法求解隨機規劃模型。實驗結果證明GA-Greedy 演算法求解的品質不錯並且求解速度快，經由敏感度分析證明本研究提出的演算法十分強健。

Many Taiwan TFT-LCD panel manufacturing firms are undergoing new plant deployment plans; however, they suffer from investment and market risks at the same time. Therefore, the decisions about building new generation TFT-LCD plants become an important issue to success. Furthermore, a typical TFT-LCD supply chain (SC) network is a three-echelon structure, so a manager must determine how to decide the best distribution strategy to application domain customers in an effective way.
In this study, we investigate the two-echelon and three-echelon SCs by scenario-based stochastic programming approaches in which the issues of selecting facility location and deciding delivery problem, accounting for uncertainty in demand. This is accomplished by integrating genetic algorithm (GA) and greedy algorithm to solve the stochastic programming model. Experiments reveal that the proposed GA-Greedy algorithm can solve successfully the problem in a timely way. The Experiment outcomes were also compared to the optima of the mathematical programming model. Sensitive analysis confirms the robustness of the proposed algorithm under a variety of the algorithmic parameters.

致謝 I
ABSTRACT II
中文摘要 IV
CONTENTS V
LIST OF FIGURES VIII
LIST OF TABLES X
CHAPTER 1. INTRODUCTION 1
CHAPTER 2. LITERATURE SURVEY 4
2.1 Location modeling 4
2.2 Solution methods 5
2.3 Preliminary of TFT-LCD industry 7
2.4 Summary 11
CHAPTER 3. A BI-LEVEL STOCHASTIC PROGRAMMING MODEL FOR FACILITY LOCATION SELECTION PROBLEM IN TWO-ECHELON SUPPLY CHAIN OF TFT-LCD PANEL MANUFACTURING INDUSTRY 13
3.1 Problem formulation 13
3.2 Solution algorithms 18
3.2.1 Genetic algorithm with linear programming 20
3.2.2 Genetic algorithm with greedy heuristic 26
3.3 Experiments and discussions 27
3.3.1 Illustration 28
3.3.2 Comparison between ILOG, GA-LP and GA -Greedy 31
3.3.3 Sensitivity analysis regarding algorithmic parameters 36
3.4 Industry cluster characteristic 40
3.5 Summary 49
CHAPTER 4. A BI-LEVEL STOCHASTIC PROGRAMMING MODEL FOR FACILITY LOCATION SELECTION PROBLEM IN THREE-ECHELON SUPPLY CHAIN OF TFT-LCD PANEL MANUFACTURING INDUSTRY 51
4.1 Introduction 51
4.2 Problem formulation 52
4.3 Genetic algorithm with greedy heuristic 56
4.4 Experiments and discussions 58
4.4.1 Comparison between ILOG, GA-LP and GA -Greedy 58
4.4.2 Sensitivity analysis regarding algorithmic parameters 61
4.5 Industry cluster characteristic 64
4.6 Summary 72
CHAPTER 5. CONCLUSION 74
REFERENCES 76
APPENDIX I : PROGRAMMING CODE OF ILOG OPL 79

工研院光電所ITIS計畫，「我國顯示器產業大未來」，民國88年6月。
拓墣產業研究所，「透視TFT-LCD面板暨顯示器產業未來發展趨勢」，民國88年9月。
Ayuso-Ayuso, A., Escudero, L. F., Garin, A., Ortuno, M, T. and Perez, G. (2003) “An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming”, Journal of Global Optimization, 26, 97-124.
Franca, P. M. and Luna, H. P. L. (1982) “Solving stochastic transportation-location problems by generalized benders decomposition”, Transportation Science, 16(2), 113-126.
Holland, J. H. (1975) Adaptation in natural and artificial systems (University of Michigan Press, Ann Abor, MI).
ILOG (2000) Optimization suite white Paper.
Kamath, K. R. and Pakkala, T. P. M. (2002) “A Bayesian approach to a dynamic inventory model under an unknown demand distribution”, Computers & Operations Research, 29,403-422.
Laporte, G. , Louveaux, F. V. and Hamme, L. V. (1994) “Exact solution to a location problem with stochastic demands”, Transportation Science, 28(2), 95-103.
Mak, W. K. , Morton, D. P. and Wood, R. K. (1999) “Monte carlo bounding techniques for determining solution quality in stochastic programs”, Operations Research Letters, 24, 47-56.
MirHassani, S. A. , Lucas, C. , Mitra, G. , Messina, E. and Poojari, C. A. (2000) “Computation solution of capacity planning models under uncertainty”, Parallel Computing, 26, 511-538.
Qi, L. (1985) “Forest iteration method for stochastic transportation problems”, Mathematical Programming Study, 25, 142-163.
Santoso, T. , Ahmed, S. , Goetschalckx, M. and Shapiro, A. (2005) “A stochastic programming approach for supply chain network design under uncertainty”, European Journal of Operational Research, 167, 96–115.
Tomonobu, S., Kai, S., Hirohito, Y., Katsumi, U. and Toshihisa, F. (2004) “Determination of location and capacity of power facilities by genetic algorithm”, Electric Power Components and Systems, 32(4), 375-390.
Walters, D. C. and Sheble, G. B. (1993) “Genetic algorithm solution of economic dispatch with valve point boding”, IEEE Transactions on Power Systems, 8(3), 1325-1332.
Yalcinoz, T. and Short, M. J. (1998) “Neural networks approach for solving economic dispatch problem with transmission capacity constraints”, IEEE Transactions on Power Systems, 13(2), 307-313.