Application of Clustering Technology for Cell Formation Problem 賴彥銘、吳泰熙
E-mail: 9221538@mail.dyu.edu.tw
ABSTRACT
Cellular manufacturing system (CMS) is an application of group technology (GT). Due to its several advantages, this problem has been attracting attention from practitioners and researchers. Cell formation is one of the most important parts for the CMS.
However, it is very difficult to obtain optimal solution for the cell formation problem in an acceptable amount of time due to its NP-Complete characteristics. The primary purpose of this research is to propose a heuristic method to solve the cell formation problem in an efficient manner. A simulated annealing-based heuristic algorithm is presented. The original problem is decomposed into two stages, the formation of part families and machine cells, respectively. When solving the subproblems above, a new similarity coefficient is proposed. The computational results show that this similarity coefficient helps forming the manufacturing cells
efficiently and effectively. The design logic for the algorithm for the cell formation is also applied to the cell formation with
alternative routings later in this thesis. Computational results obtained from the comparisons with those from the literature show the efficiency and efficacy of the proposed algorithm.
Keywords : Group technology ; Cell formation ; Simulated annealing Table of Contents
目錄 封面內頁 簽名頁 授權書...iii 中文摘要...v 英文摘 要...vi 誌謝...vii 目錄...viii 圖目 錄...xi 表目錄...xiii 第一章 緒論 1.1 研究背景與動
機...1 1.2 研究目的...2 1.3 研究範圍與假設 ...3 1.4 研究方法...4 1.5 研究流程...5 第二章 文獻探討 2.1 群聚分析演算法 ...8 2.2 單元形成問題相關文獻探討...11 2.2.1 標準單元形成問
題...11 2.2.1.1 早期文獻探討...15 2.2.1.2 近期文獻探討...18 2.2.2 多途程單元形成問題...30 2.3 模擬退火法...32 2.3.1 Metroplis演算
法...33 2.3.2 模擬退火演算法...34 第三章 標準單元形成問題之求解 3.1 標準單元 形成問題演算法介紹...37 3.1.1 問題描述...37 3.1.2 演算法說
明...37 3.2 起始解階段...38 3.2.1 零件分派問題 ...38 3.2.1.1 零件相似係數...38 3.2.1.2 零件起始解產生法則...41 3.2.2 機器分派問
題...43 3.2.2.1 機器啟發式分派法則...43 3.3 改善階 段...49 3.3.1 改善階段一...49 3.2.2 改善階段 二...51 3.4 標準單元形成問題演算法之建立...53 3.4.1 目標函
式...54 3.4.2 演算法流程...55 第四章 多途程單元形成問題之求解 4.1 多途 程單元形成問題演算法介紹...58 4.1.1 問題描述...58 4.1.2 演算法說
明...58 4.2 起始解階段...59 4.2.1 途程選擇問題 ...59 4.2.2 零件分派問題...60 4.2.3 機器分派問題 ...60 4.3 改善階
段...60 4.3.1 途程改善階段 ...61 4.4 多途程單元形成問題演算法之建 立...65 4.4.1 目標函式...66 4.4.2 演算法流程...66 第五章 演算 結果及分析 5.1 標準單元形成問題演算結果...70 5.1.1 標準單元形成問題測試例題資訊...70 5.1.2 標準單元形成問題演算法參數分析 ...71 5.2 多途程單元形成問題演算結果...75 5.2.1 多途 程單元形成問題測試例題資訊 ...75 5.2.2 多途程單元形成問題演算法參數分析...76 5.2.3 小 結...78 第六章 結論與建議 6.1 結論...81 6.2 建
議...82 參考文獻...84 REFERENCES
[1] 吳文田，「製造單元形成問題解法之研究」，大葉大學工業工程研究 所，碩士學位論文，民國八十九年七月。
[2] 陳民葵，「以模擬退火法求解單元行程問題」，大葉大學工業工程研 究所，碩士學位論文，民國九十一年六月。
[3] Abdelmola, A. I., S. M. Taboun and S. Merchawi, 1998, “Productivity optimization of cellular manufacturing systems,” Computers ind.
Engng., 35(3-4), 403-406.
[4] Adil, G.K., Rajamani, D., and Strong, D., “Cell formation considering alternate routings,” International Journal of Production Research, 34, 1361-1380, (1996).
[5] A.M MuKattash, M.B.Adil, K.K. Tahboub, “Heuristic approaches for part assignment in cell formation,” Computers & Industrial Engineering, 42, 329-341, (2002).
[6] Angel A. Cedeno, Gursel A. Suer, “The use of similarity coefficient-base method to perform clustering analysis to a large set of data with dissimilar parts,” Computers ind. Engng Vol. 33.No. 1-2 pp.225-228, (1997).
[7] Ankerst M., Breuning M., Kriegel H.P. and Sander J., “OPTICS: Ordering point to identify the clustering structure,” In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’99), pp. 49-60, Philadelphia, PA, June 1999.
[8] Askin, R.G., Cresswell, S.H., Goldberg, J.B., and Vakharia, A.J., “A Hamiltonian path approach to reordering the part- machine matrix for cellular manufacturing,” International Journal of Production Research, 29, 1081-1100, (1991).
[9] Asoo J. Vakharia, and Urban Wemmerlov, “A comparative investigation of hierarchical clustering techniques and dissimilarity measures applied to the cell formation problem,” Joumal of Operaions Management 13, 117-138, (1995).
[10] Balakrishnan, J., and Jog, P.D., “Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm formulation and comparison,” Mathematical & Computer Modeling, 21, 61-73, (1995).
[11] Boctor, F.F., “A linear formation of the machine-part cell formation problem,” International Journal of Production Research, 29, 343-356, (1990).
[12] Cao, Q. and Mark A. Mcknew,1998, “Partial termination rule of lagrangian relaxation for manufacturing cell formation problems,”
Computers Ops.Res., 25(2), 159-168.
[13] Chandrasekharan, M.P., and Rajagopalan, R., “GROUPABILITY: an analysis of the properties of binary data matrices for group technology,” International Journal of Production Research, 27, 1035-1052, (1989).
[14] Chandrasekharan, M.P., and Rajagopalan, R., “ZODIAC-an algorithm for concurrent formation of part-families and machine-cells,”
International Journal of Production Research, 25, 835-850, (1987).
[15] Chan, F.T.S., Mak, K.L., Luong, L.H.S., and Ming, X.G., “Machine-component grouping using genetic algorithm,” Robotics &
Computer-Integrated Manufacturing, 14, 339-346, (1998).
[16] Cheng C.H., Goh C.H., and Lee A., “Design group technology manufacturing systems using heuristics branching rules,” Computers &
Industrial Engineering, 40, 117-131, (2001).
[17] Cheng, C.H., Gupta, Y.P., Lee, W.H., and Wong, K.F., “A TSP-based heuristic for forming machine groups and part families,”
International Journal of Production Research, 36, 1325-1337, (1998).
[18] Dake Sun, Li Lin and Rajan Batta, “Cell formation tabu search,” Computers ind. Engng Vol. 28.No. 3 pp.485-494, (1995).
[19] Deutsch, S.J., S.F. Freeman and M.Helander,1998, “Manufacturing cell formation using an improved p-median model,” Computers ind.
Engng., 34(1), 135-146.
[20] Ester M., Kriegle H.P., Sander J. and Xu ., “Density- Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise,” In Proc. 1996 Int. conf. Knowledge Discovery and Data Mining (KDD’96), pp. 226-231, Portland, OR, Aug. 1996.
[21] G. Harhalakis, R. Nagi and J.M. Proth, “An efficient heuristic in manufacturing cell formation for group technology applications,” Int J.Prod. Res., vol. 28, no. 1, 185-198, (1990).
[22] G. Prabhakaran, M. Sachithandam and N. Venkiah, “Application of the Maximal Spanning Tree Approach For Machine Cell Formation,”
Int J Adv Manuf techol, 20, 503- 514, (2002).
[23] G.Prabhakaran, T. N. Janakiraman and M. Sachithandam, “Manufacturing data-based combined dissimilarity coefficient for machine cell formation,” Int J Adv Manuf techol, 19, 889-897, (2002).
[24] Gursel A.Suer, and Angel A.Cedeno, “A Configuration-Based Clustering Algorithm For Family Formation,” Computers ind. Engng Vol.31. No.1/2 pp.147-150, (1996).
[25] Han J. and Kamber M., “Data Mining:Concepts and Techniques,” Morgan Kaufmann, 2000.
[26] Hiroshi Ohta, Masateru Nakamura, “Cell formation with reduction in setup time,” Computers & Industrial Engineering, 42, 317-327, (2002).
[27] Hwang, H., and Ree, P., “Routes selection for the cell formation problem with alternative part process plans,” Computers & Industrial Engineering, 30, 423-431, (1996).
[28] Kaufman L. and Rousseeuw PJ, “Finding Groups in Data: an Introduction to Cluster Analysis,” John Wiley & Sons, 1990.
[29] Kirkpatrick, S., and Gelatt, C.D., “Optimization by simulated annealing,” Sci., 22, 671-680, (1983).
[30] Kitaoka, M., Nakamura, R., Serizawa, S., and Usuki, J., “Multivariate analysis model for machine-part cell formation problem ingroup technology,” International Journal of Production Economics, 60-61, 433-438, (1999).
[31] Kumar, C.S. and Chandrasekharan, M.P., 1990. Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology. Int. J. Prod. Res., 28: 233-243,(1990).
[32] Kusiak, A., and Cho, M., “A sililarity coefficient algorithms for solving the group technology problem,” International Journal of Production Research, 30, 2633- 2646, (1992).
[33] Kusiak, A., “The generalized group technology concept,” International Journal of Production Research, 25, 561-569, (1987).
[34] MacQueen J., “Some Methods for Classifiction and Analysis of Multivariate Observation,” In Proc. 5th Berkeley Symp. Math. Stat. And Prob., Vol 1, pp. 281-297, 1967 [35] Mak, K.L., Wong, Y.S., and Wang, X.X., “an adaptive genetic algorithm for manufacturing cell formation,
” International Journal of Advanced Manufacturing Technology, 16, 491-497, (2000).
[36] M.A. Sobhanallahi, G.R. Jahanshahloo, G.R. Amin, E.shayan, “Threshold value for the number of cells in group technology,” Computers
& Industrial Engineering, 42, 231- 236, (2002).
[37] Metropolis, N., Rosenbluth, A.W., and Teller, A.H., “” Equation of state calculations by fast computing machines,” Journal of Chemical Physics, 21, 1087-1092, (1953).
[38] Nair, G.J., and Narendran, T.T., “Cluster goodness: a new measure of performance for cluster formation in design of cellular manufacturing systems,” International Journal of Production Economics, 48, 49-61, (1997)..
[39] Onwubulo, G. C., and Mutingi, M., “A genetic algorithm approach to cellular manufacturing systems,” Computers & Industrial Engineering, 39, 125-144, (2001).
[40] Onwubolu, G. C., and Songore, V., “A tabu search approach to cellular manufacturing systems,” Production Planning & Control, 11, 153-164, (2000).
[41] Sarker, B.R., and Li, K., “Simultaneous route selection and cell formation: a mixed-integer programming time-cost model,” Integrated Manufacturing Systems, 8, 374-377, (1997).
[42] Sarker, B.R., “Measure of grouping efficiency in cellular manufacturing systems,” European Journal of Operational Research, 130, 588-611, (2001).
[43] Shine-Der Lee and Chih-ping Chiang, “Cell formation in the uni-directional loop material handing environment,” European Journal of Operational Research 137, 401-420, (2002).
[44] Vicior L. Berardi, Guoqiang, Zhang, O. Felix Offodile, “A mathematical programming approach to evaluating alternative machine clusters in cellular manufacturing,” Int. J. Production Economics, 58, 253-264, (1999).
[45] Wemmerlov, U., and Hyer, N.L., “Reserch issues in cellular manufacturing,” International Journal of Production Research, 25, 413-431, (1987).
[46] Won, Y., and Kim, S., “Multiple criteria clustering algorithm for solving the group technology problem with multiple process routings,”
Computers & Industrial Engineering, 32, 207-220, (1997).
[47] Won, Y., “New p-median approach to cell formation with alternative process plans,” International Journal of Production Research, 38, 229-240, (2000).
[48] Yasuda, K., and Yin, Y., “A dissimilarity measure for solving the cell formation problem in cellular manufacturing,” Computer & Industrial Engineering, 39, 1- 17, (2001).
[49] Zhao, C., and Wu, Z., “A genetic algorithm for manufacturing cell formation with multiple route and objectives,” International Journal of Production Research, 38, 385-395, (2000).
