簡易檢索 / 詳目顯示

研究生: 吳冠辰
Guan-Chen Wu
論文名稱: 運用緊密基因演算法與變動臨域搜尋法解決群組規劃問題
Applying Compact Genetic Algorithm and Variable Neighborhood Search to Solve Cell Formation Problems
指導教授: 歐陽超
Chao Ou-Yang
口試委員: 楊朝龍
Chao-Lung Yang
阮業春
none
學位類別: 碩士
Master
系所名稱: 管理學院 - 工業管理系
Department of Industrial Management
論文出版年: 2015
畢業學年度: 103
語文別: 中文
論文頁數: 132
中文關鍵詞: 元啟發式演算法緊密基因演算法變動臨域搜尋法製造單元規劃
外文關鍵詞: Compact Genetic Algorithm, Hybrid Method, Cell Formation Problem
相關次數: 點閱:239下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 近代的科技躍進快速且產品變化多樣,在工業發展時期製造過程需要具備
    快速與低成本的性質,然而因應未來的市場需求,生產方式將會趨向於少量多
    樣的生產模式。彈性製造系統為對應此少量多樣生產模式的製造模式,在彈性
    製造系統中常使用群組技術來提升製造效率,而群組技術常使用群組規劃的方
    式協助進行,群組規劃將製成相似的產品工件分為產品族,然後依據產品族將
    機台分群,形成工件與機台組成的群組。透過群組規劃的分群模式使彈性製造
    系統分割成各個小型製造系統,讓每個小系統有更好的製造效率與提升生產
    力。本研究透過緊密基因演算法與變動臨域搜尋法的概念進行群組規劃,透過
    更好的群組規劃結果使製造系統能夠有更好的效率,以協助彈性製造系統的製
    造流程,使其生產力提升、成本降低、品質提高且效率更好。


    Technology is developing quickly and the type of consumption pattern is being varied. In order to Satisfying customer demand, Products are customized to customer. Manufacturer need to adopt the job shop production to produce different products for customer. Because manufacturers implement the job shop production, the cell technology is used for completing job shop production. While manufacturer use group technology, they usually need to find some method to solve the cell formation problem. In this thesis book, we hybrid Compact Genetic Algorithm and Variable Neighborhood Search to solve cell formation problems. We propose the different idea of algorithm which local search is focused in our thesis. We test the 35 problems with various size from literatures are used to test the performance of algorithm. We use Taguchi method for determining the parameter setting and then we compare other methods which was proposed from former research. Finally, we analyze the experimental result and discuss reasons which cause difference scheme.

    摘要 ABSTRACT 誌謝 目錄 圖目錄 表目錄 第一章、緒論 1.1 研究背景 1.2 研究目的 1.3 研究架構 第二章、參考文獻 2.1 群組規劃問題 2.2 分群效率 2.3 群組規劃方法 2.4 混合式演算法 2.4.1 緊密基因演算法 2.4.2 變動臨域演算法 第三章、研究方法 3.1 參數設定 3.2 產生出始機率設定 3.2.1 產生繼承機制之機率 3.2.2 產生各工件與機台分配至各製造單元的機率 3.3 產生子代 3.3.1 繼承機制 3.3.2 緊密基因演算法 3.3.3 變動臨域搜尋法 3.4 計算適應函數 3.5 更新機率值 3.5.1 更新染色體最佳解與維持機率 3.5.2 更新機率輪盤 第四章、實驗分析與討論 4.1 參數內容與設定 4.2 田口參數實驗 4.3 實驗結果與比較 4.4 實驗結果討論 第五章、結論 5.1 研究結果論述 5.2 未來研究方向 文獻參考 附錄(A)-田口實驗 附錄(B)-群組規劃結果

    [1] Ackley, D.H., A connectionist machine for genetic hill climbing, Kluwer Boston Inc., United States (1987).

    [2] Askin, R.G. and S.P. Subramanian, “A cost-based heuristic for group technology configuration,” International Journal of Production Research, 25(1), 101–113 (1987).

    [3] Anvari, M., M. Saidi Mehrabad and F. Barzinpour, “Machine–part cell formation using a hybrid particle swarm optimization,” International Journal of Advanced Manufacturing Technology, 47, 745–754 (2010).

    [4] Arkat, A., L. Hosseini and M. Hosseinabadi Farahani, “Minimization of exceptional elements and voids in the cell formation problem using a multi-objective genetic algorithm,” Expert Systems with Applications, 38, 9597–9602 (2011).

    [5] Black, J., “Cellular Manufacturing Systems Reduce Setup Time, Make Small Lot Production Economical,” Industrial Engineering, 15(11), 36–48 (1983).

    [6] Boctor, F. F., “A linear formation of the machine-part cell formation problem,” International Journal of Production Research, 29(2), 343–356 (1991).

    [7] Baluja, S., Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning, Carnegie Mellon University, Pittsburgh (1994).

    [8] Boe, W.J. and C.H. Cheng, “A close neighbour algorithm for designing cellular manufacturing systems,” International Journal of Production Research, 29(10), 2097–2116 (1991).

    [9] Bortolini, M., R. Manzini, R. Accorsi and C. Mora, “An hybrid procedure for machine duplication in cellular manufacturing systems,” International Journal of Advanced Manufacturing Technology, 57, 1155–1173, (2011).

    [10] Carrie, A.S., “Numerical taxonomy applied to group technology and plant layout,” International Journal of Production Research, 11(4), 399–416 (1973).
    [11] Chan, H.M. and D.A. Milner, “Direct clustering algorithm for group formation in cellular manufacture,” Journal of Manufacturing Systems, 1, 65–75 (1982).

    [12] Chandrasekharan M.P. and R. Rajagopalan, “MODROC: an extension of rank order clustering for group technology,” International Journal of Production Research, 24(5), 1221–1264 (1986a).

    [13] Chandrasekharan M.P. and R. Rajagopalan, “An ideal seed non-hierarchical clustering algorithm for cellular manufacturing” International Journal of Production Research, 24(2), 451–464 (1986b).

    [14] Chandrasekharan M.P. and R. Rajagopalan, “ZODIAC: an algorithm for concurrent formation of part-families and machine-cells,” International Journal of Production Research, 25(6), 835–850(1987).

    [15] Chandrasekharan M.P. and R. Rajagopalan, “GROUPABILITY: an analysis of the properties of binary data matrices for group technology,” International Journal of Production Research, 27(6), 1035–1052 (1989).

    [16] Dobslaw, F., “A Parameter Tuning Framework for Metaheuristics Based on Design of Experiments and Artificial Neural Networks,” In Proceeding of the International Conference on Computer Mathematics and Natural Computing, 1–4 (2010).

    [17] Drira, A., H. Pierreval and S. Hajri-Gabouj, “Facility layout problems: A survey,” Annual Reviews in Control, 31(2), 255–267 (2007).

    [18] Dura´n O, N. Rodriguez and L.A. Consalter, “Collaborative particle swarm optimization with a data mining technique for manufacturing cell design,” Expert Systems with Applications, 37, 1563–1567 (2010).

    [19] Dı´az, J.A., D. Luna and R. Luna, “A GRASP heuristic for the manufacturing cell formation problem,” Top, 20(3), 679–706 (2012).

    [20] Feng, Y.X. and K.L. Pheng, “An exact schema theorem for adaptive genetic algorithm and its application to machine cell formation,” Expert Systems with Applications, 38, 8538–8552 (2011).

    [21] Gonçalves, J. F. and M. G. C. Resende, “An evolutionary algorithm for manufacturing cell formation,” Computers & Industrial Engineering, 47(2–3), 247–273 (2004).

    [22] Gibson, C. B., A. E. Randel, and P. C. Earley, “Understanding Group Efficacy An Empirical Test of Multiple Assessment Methods,” SAGE Journal, 25, 67–97 (2000).

    [23] Harik, G.R., F.G. Lobo and D.E. Goldberg, “The Compact Genetic Algorithm,” IEEE, 3(4) (1999).

    [24] Harik, G., E. Cant´u-Paz, D. E. Goldberg and B. Miller, “The gambler’s ruin problem, genetic algorithms, and the sizing of populations,” IEEE, 7–12 (1997).

    [25] James, T.L., E.C. Brown and K.B. Keeling, “A hybrid grouping genetic algorithm for the cell formation problem,” Computers & Operations Research, 34(7), 2059–79 (2007).

    [26] King, JR., “Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm,” International Journal of Production Research, 18, 213–232 (1980).

    [27] King, J.R. and V. Nakornchai, “Machine-component group formation in group technology: review and extension,” International Journal of Production Research, 20(2), 117–33 (1982).

    [28] Kusiak, A. and W.S. Chow, “Efficient solving of the group technology problem,” Journal of Manufacturing Systems, 6(2), 117–124 (1987).

    [29] Kumar, K.R. and A. Vannelli, “Strategic subcontracting for efficient disaggregated manufacturing,” International Journal of Production Research, 25(12), 1715–1728 (1987).

    [30] Kusiak, A. and M. Cho, “Similarity coefficient algorithm for solving the group technology problem,” International Journal of Production Research, 30(11), 2633–46 (1992).

    [31] Kumar, K.R., A. Kusiak and A. Vannelli, “Grouping of parts and components in flexible manufacturing systems,” European Journal of Operations Research, 24, 387–397 (1986).

    [32] Lee, K. and K.I. Ahn, “GT efficacy: a performance measure for cell formation with sequence data,” International Journal of Production Research, 51(20), 1–12 (2013).

    [33] Li, X., M.F. Baki and Y.P. Aneja, “An ant colony optimization metaheuristic for machine-part cell formation problems,” Computers &Operations Research, 37, 2071–2081 (2010).

    [34] Mühlenbein, H. and G. Paaß, “From recombination of genes to the estimation of distributions I. binary parameters,” PPSN IV Lecture Notes in Computer Science, 1141, 178–187 (1996).

    [35] Mladenovic, N. and P. Hansen, “Variable Neighborhood Search” Computers & Operations Research, 24(11), 1097-1100 (1997).

    [36] McCormick W.T., P.J. Schweitzer and T.W. White, “Problem decomposition and data reorganization by a clustering technique,” Operations Research, 20, 1993–1009 (1972).

    [37] Mahdavi, I., M.M. Paydar, M. Solimanpur and A. Heidarzade, “Genetic algorithm approach for solving a cell formation problem in cellular manufacturing,” Expert Systems with Applications, 36, 6598-6604 (2009).

    [38] Nila, C.D., A hybrid of Particle Swarm Optimization and Population Based Incremental Learning in Cell Formation, Master thesis, National Taiwan University of Science and Technology, Taiwan (2014).

    [39] Noktehdan, A., B. Karimi and A. Husseinzadeh Kashan, “A differential evolution algorithm for the manufacturing cell formation problem using group based operators,” Expert Systems with Applications, 37, 4822–4829 (2010).

    [40] Pescosolido, A. T., “Group Efficacy And Group Effectiveness: The Effects of Group Efficacy Over Time on Group Performance and Development,” SAGE Journal, 34, 20–42 (2003).
    [41] Papaioanno, G. and J. M. Wilson, “The evolution of cell formation problem methodologies based on recent studies (1997–2008): Review and directions for future research,” European Journal of Operational Research, 206(3), 509–521 (2010).

    [42] Paydar, M. M. and M. Saidi-Mehrabad, “A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy,” International Journal of Computers and Operation Research, 40(4), 980–990 (2013).

    [43] Paydar M.M., I. Mahdavi and K.A. Szabat, “Application of single depot multiple travelling salesman method to cell formation problems,” International Journal of Applied Decision Sciences, 3(4), 390–399 (2010).

    [44] Pailla, A., A.R. Trindade, V. Parada and V.L. Ochi, “A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem,” Expert Systems with Applications, 37, 5476–5483 (2010).

    [45] Stanfel, L.E., “Machine clustering for economic production,” Engineering Costs and Production Economics, 9, 73–81 (1985).

    [46] Seifoddini, H., “A note on the similarity coefficient method and the problem of improper machine assignment in group technology applications,” International Journal of Production Research, 27(7), 1161–1165 (1989).

    [47] Sarker, B. R., “Measures of grouping efficiency in cellular manufacturing systems,” European Journal of Operational Research, 130, 588–611 (2001).

    [48] Stawowy, A., “Evolutionary strategy for manufacturing cell design,” The International Journal of Management Science, 34(1), 1–18 (2006).

    [49] Shakya, S.K., DEUM : A framework for an Estimation of Distribution Algorithm based on Markov Random, (PhD) thesis, The Robert Gordon University, UK (2006).

    [50] Seifoddini, H. and P.M. Wolfe, “Application of the similarity coefficient method in group technology” IIE Transactions, 18(3), 271–277(1986).

    [51] Suresh Kumar and M. P. Chandrasekharan, “Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology,” International Journal of Production Research, 28, 233–243 (1990).

    [52] Srinivasan, G., T.T. Narendran and B. Mahadevan, “An assignment model for the part-families problem in group technology,” International Journal of Production Research, 28(1), 145–152 (1990).

    [53] Selim, M.S., R.G. Askin and A.J. Vakharia, “Cell formation in group technology: review evaluation and directions for future research,” Computers and Industrial Engineering, 34(1), 3–20 (1998).

    [54] Mosier, C.T. and L. Taube, “The facets of group technology and their impact on implementation,” OMEGA, 13(5), 381–391 (1985).

    [55] Tunnukij, T. and C Hicks, “An enhanced grouping genetic algorithm for solving the cell formation problem,” International Journal of Production Research, 47(7), 1989–2007 (2009).

    [56] Tariq, A., I. Hussain, and A. Ghafoor, “Consideration of Single Machine Cells in Designing Cellular Manufacturing System using a Hybrid Genetic Algorithm,” IEEE, 1–5 (2007).

    [57] Utamima, A., “Artificial Particle Swarm Optimization for Solving Single Row Facility Layout Problem,” Master thesis, National Taiwan University of Science and Technology, Taiwan 2012.

    [58] Unler, A. and Z. Gungo, “Applying K-harmonic means clustering to the part– machine classification problem,” Expert Systems with Applications, 36, 1179–1194 (2009).

    [59] Waghodekar P.H. and S. Sahu, “Machine-component cell formation in group technology MACE,” International Journal of Production Research, 22, 937–948(1984).

    [60] Wemmerlov, U. and Nancy L. Hyer, “Research issues in cellular manufacturing,” International Journal of Production Research, 25(3), 413–431 (1987).
    [61] Wu, T.H., C.C. Chang and S.H. Chung, “A simulated annealing algorithm for manufacturing cell formation problems,” Expert Systems with Applications, 34, 1609–1617 (2008).

    [62] Wu, T.H., C.C. Chang and J.Y. Yeh, “A hybrid heuristic algorithm adopting both Boltzmann function and mutation operator for manufacturing cell formation problems,” International Journal of Production Economics, 120, 669–688 (2009)

    [63] Wu, TH., S.H. Chung and C.C. Chang, “A water flow-like algorithm for manufacturing cell formation problems,” European Journal of Operational Research, 205, 346–360 (2010).

    [64] Yang, M.S. and J.H. Yang, “Machine–part cell formation in group technology using a modified ART1 method,” European Journal of Operational Research, 188, 140–52 (2008).

    [65] Ying, K.C., S.W. Lin and C.C. Lu, “Cell formation using a simulated annealing algorithm with variable neighbourhood,” European Journal of Industrial Engineering, 5(1), 22–42, (2011).

    QR CODE