Approaches to solve cell formation, machine layout and cell layout problem: A Review
DOI:
https://doi.org/10.14738/tmlai.25.600Keywords:
Genetic Algorithm, Cell Formation Problem, Machine Layout Problem, Cell Layout Problem.Abstract
Cell formation, machine layout and cell layout problems in cellular manufacturing system are NP-Complete optimization problems. Good cell formation & layout design in cellular manufacturing system is achieved by finding optimum or near-optimum solutions of these problems, which substantially reduces manufacturing cost and time. Many approaches have been advocated by researchers to obtain better cell formation & layout design. An attempt has been done in this paper to review such approaches based on heuristics, meta-heuristics, hybrid methods and exact solution methods developed by past researchers to solve these problems. The main objective of this review paper is to find out the effective and efficient approaches by comparing them based on performance criteria, their benefits and drawbacks in solving cellular manufacturing system problems and find out future research scope in this area.
References
. M. P. Chandrasekharan, & R. Rajagopalan, “An ideal seed non-hierarchical clustering algorithm for cellular manufacturing”, International Journal of Production Research, vol. 24(2), 1986, pp. 451–463.
. M. P. Chandrasekharan, & R. Rajagopalan, “MODROC: an extension to rank order clustering for group technology”, International Journal of Production Research, vol. 24(5), 1986, pp. 1221–1233.
. Kumar, C. S., & Chandrasekharan, M. P., “Grouping efficacy: A quantitative criterion for goodness of block diagonal forms of binary matrices in group technology”, International Journal of Production Research, vol. 28(2), 1990, pp. 233–243.
. Tavakkoli-Moghaddam R., Aryanezhad M. B., Safaei N., & Azaron A., “Solving a dynamic cell formation problem using metaheuristics”, Applied Mathematics and Computation, vol. 170(2), 2005, pp. 761-780.
. Vin E., Delchambre A. & Francq P., “A generalized cell formation problem solved by an adapted GGA”, 8th International Conference of Modeling and Simulation - MOSIM’10, May 10-12, 2010.
. McCormick Jr., W. T., Schweitzer, P. J., & White, T. W., “Problem decomposition and data reorganization by a clustering technique”, Operations Research, vol. 20(5), 1972, pp. 993–1009.
. Wang J., “Formation of machine cells and part families in cellular manufacturing systems using a linear assignment algorithm”, Automatica, vol. 39(9), 2003, pp. 1607-1615.
. Collette Y, & Siarry P., “Multi-objective optimization: principles and case studies”, New York: Springer, 2003.
. Mahdavi, I. and Mahadevan, B., “CLASS: An algorithm for cellular manufacturing system and layout design using sequence data”, Robotics and Computer-Integrated Manufacturing, vol. 24(3), 2008, pp. 488-497.
. V. Anbumakar and G. Prabhaharan, “Machine assignment in cellular manufacturing layout using genetic algorithm”, The International Journal of Applied Management and Technology, vol. 4(1), 2006, pp. 165-179.
. Chan W. M., Chan C. Y. & Ip W. H., “A heuristic algorithm for machine assignment in cellular layout”, Computers & industrial Engineering, vol. 44, 2002, pp. 49-73.
. I. B. Hunagund & M. Pillai V, “Development of a heuristic for layout formation and design of robust layout under dynamic demand”, Proceedings of the International Conference on Digital Factory, ICDF 2008, August 11-13, 2008 Organized, pp. 1398-1405.
. Andersen R., “Solution methods to the machine layout problem”, Doctoral dissertation, Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark, 2006.
. Solimanpur M., Vrat P. & Shankar R., “Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing”, European Journal of Operational Research, vol. 157(3), 2004, pp. 592-606.
. Yaman.R, Gethin.D.T. and Clarke.M.J., “An effective sorting method for facility layout constructions”, International Journal of Production Research, vol. 31(2), 1993, pp. 413-427.
. Tang.C. and Abdel-Malek.L.L., “A frame work for hierarchical interactive generation of cellular layout”, International Journal of Production Research, vol. 34(8), 1996, pp. 2133-2162.
. J. R. King, “Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm”, International Journal of Production Research, vol. 18 (2), 1980, pp. 213–232.
. Srinivasan, G., Narendran, T. T., & Mahadevan, B., “An assignment model for the part-families problem in group technology”, International Journal of Production Research, vol. 28(1), 1990, pp. 145–152.
. Yin Y. & Yasuda K., “Similarity coefficient methods applied to the cell formation problem: a comparative investigation”, Computers & Industrial Engineering, vol. 48(3), 2005, pp. 471-489.
. Ahi A., Aryanezhad M. B., Ashtiani B., & Makui A., “A novel approach to determine cell formation, intracellular machine layout and cell layout in the CMS problem based on TOPSIS method”, Computers & Operations Research, vol.
(5), 2009, pp. 1478-1496.
. Morad N., “Genetic Algorithms Optimization for the Machine Layout Problem”, International Journal of the Computer, the Internet and Management, vol. 8(1), 2000.
. Mahdavi I., Paydar M. M., Solimanpur M. & Heidarzade A., “Genetic algorithm approach for solving a cell formation problem in cellular manufacturing”, Expert Systems with Applications, vol. 36(3), 2009, pp. 6598-6604.
. Chandrasekharan, M. P., & Rajagopalan, R., “ZODIAC: An algorithm for concurrent formation of part-families and machine-cells”, International Journal of Production Research, vol. 25(6), 1987, pp. 835–850.
. Srinivasan, G., & Narendran, T. T., “GRAFICS-A nonhierarchical clustering algorithm for group technology”, International Journal of Production Research, vol. 29(3), 1991, pp. 463–478.
. Cheng, C., Gupta, Y., Lee, W., & Wong, K., “A TSP-based heuristic for forming machine groups and part families”, International Journal of Production Research, vol. 36, 1998, pp. 1325–1337.
. Onwubolu, G. C., & Mutingi, M., “A genetic algorithm approach to cellular manufacturing systems”, Computers and Industrial Engineering, vol. 39(1), 2001, pp. 125–144.
. Goncalves, J., & Resende, M., “An evolutionary algorithm for manufacturing cell formation”, Computers and Industrial Engineering, vol. 47, 2004, pp. 247–273.
. Wu, T. H., Chang, C. C., & Chung, S. H., “A simulated annealing algorithm for manufacturing cell formation problems”, Expert Systems with Applications, vol. 34, 2008, pp. 1609–1617.
. De Lit P., Falkenauer E., & Delchambre A., “Grouping genetic algorithms: an efficient method to solve the cell formation problem”, Mathematics and Computers in simulation, vol. 51(3), 2000, pp. 257-271.
. Brown E. C., & Sumichrast R. T., “CF-GGA: a grouping genetic algorithm for the cell formation problem”, International Journal of Production Research, vol. 39(16), 2001, pp. 3651-3669.
. SRINIVASAN, G., “A clustering algorithm for machine cell formation in group technology using minimum spanning trees”, International Journal of Production Research, vol. 32, 1994, pp. 2149-2158.
. JOINES, J., CULBRETH, C. T. and KING, R. E., “Manufacturing cell design: an integer programming model employing genetic algorithms”, IEE Transactions, vol. 28, 1996, pp. 69-85.
. Sofianopoulou, S., “Manufacturing cell design with alternative process plans and/or replicate machines”, International Journal of Production research, vol. 37(3), 1999, pp. 707-720.
. Car Z. & Mikac T., “Evolutionary approach for solving cell-formation problem in cell manufacturing”, Advanced Engineering Informatics, vol. 20(3), 2006, pp. 227-232.
. S. J. Chen, & C. S. Cheng, “A neural network-based cell
formation algorithm in cellular manufacturing”, The International Journal of Production Research, vol. 33 (2), 1995, pp. 293–318.
. Mikac T, Jurkovic´ M, & Pekic´ Z., “A neural network approach in cellular manufacturing”, in: Proceedings of the 5th International Conference on Advanced Manufacturing Systems and Technology, AMST ’99, 1999, pp. 521–528.
. K. Chandrasekar, P. Venkumar, “Genetic algorithm approach for integrating cell formation with machine layout and cell layout”, International Journal of Operational Research, vol. 16(2), 2013, pp. 155-171.
. Ahi, A., Aryanezhad, M. B., Ashtiani, B. and Makui, A., “A novel approach to determine cell formation, intracellular machine layout and cell layout in the CMS problem based on TOPSIS method”, Computers and Operations Research, vol. 36, 2009, pp. 1478–1496.
. Xambre A. R., & Vilarinho P. M., “A simulated annealing approach for manufacturing cell formation with multiple identical machines”, European Journal of Operational Research, vol. 151(2), 2003, pp. 434-446.
. Wu, N., & Salvendy, G., “An efficient heuristic for the design of cellular manufacturing systems with multiple identical machines”, International Journal of Production Research, vol. 37(15), 1999, pp. 3519–3540.
. Pailla A., Trindade A. R., Parada V. & Ochi L. S., “A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem”, Expert Systems with Applications, vol. 37(7), 2010, pp. 5476-5483.
. Nugent, C. E., Vollman, T. E., & Ruml, J., “An
experimental comparison of techniques for the assignment of facilities to locations”, Operations Research, vol. 16(1), 1968, pp. 150-173.
. Wang, S., & Sarker, B. R., “Locating cells with bottleneck machines in cellular manufacturing systems”, International Journal of Production Research, vol. 40 (2), 2002, pp. 403-424.
. Taillard, E. D., & Gambardella, L. M., “Adaptive memories for the quadratic assignment problem”, Technical Report IDSIA-87-97, IDSIA, Lugano, Switzerland, 1997.
. L. M. Gambardella, E. Taillard, and M. Dorigo, “Ant colonies for QAP,” IDSIA, Lugano, Switzerland, Technical Report IDSIA 97-4, 1997.
. Stutzle, T., & Hoos, H. H., “MAX-MIN ant system”, Future Generation Computer Systems, vol. 16(8), 2000, pp. 889-914.
. Maniezzo, V., & Colorni, A., “The ant system applied to the quadratic assignment problem”, IEEE Transactions on Knowledge and Data Engineering, vol. 11 (5), 1999, pp. 769-
. C. Fleurent, J. A. Ferland, “Genetic hybrids for the quadratic assignment problem”, in: P.M. Pardalos, H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, American Mathematical Society, Providence, RI, 1994, pp. 173–187.
. Bajestani M. A., Rabbani M., Rahimi-Vahed A. R. & Baharian Khoshkhou G., “A multi-objective scatter search for a dynamic cell formation problem”, Computers & operations research, vol. 36(3), 2009, pp. 777-794.
. Hung W. L., Yang M. S. & Lee E. S., “Cell formation using fuzzy relational clustering algorithm”, Mathematical and computer Modelling, vol. 53(9), 2011, pp. 1776-1787.
. M. S. Yang, W. L. Hung, & F. C. Cheng, “Mixed-variable fuzzy clustering approach to part family and machine cell formation for GT applications”, International Journal of Production Economics, vol. 103(1), 2006, pp. 185–198.
. Mutingi M., Mbohwa C. T., Mhlanga S., & Goriwondo W., “Integrated Cellular Manufacturing System Design: an Evolutionary Algorithm Approach”, Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management, July 3 – 6, 2012, pp. 254-264.
. Bazargan-Lari.M., “Layout designs in cellular manufacturing”, European Journal of Operational Research, vol. 112, 1999, pp. 258-272.
. Gonçalves J. F. & Resende M. G., “An evolutionary algorithm for manufacturing cell formation”, Computers & Industrial Engineering, vol. 47(2), 2004, pp. 247-273.
. Nsakanda A. L., Diaby M. & Price W. L., “Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings”, European Journal of Operational Research, vol. 171(3), 2006, pp. 1051-1070.
. Elbenani B., Ferland J. A., & Bellemare J., “Genetic algorithm and large neighbourhood search to solve the cell formation problem”, Expert Systems with Applications, vol. 39(3), 2012, pp. 2408-2414.
. Paydar M. M., & Saidi-Mehrabad M., “A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy”, Computers & Operations Research, vol. 40(4), 2013, pp. 980-990.
. Maghsud Solimanpur and Amir Jafari, “Optimal solution for the two-dimensional facility layout problem using a branch-and-bound algorithm”, Computers & Industrial Engineering, vol. 55(3), 2008, pp. 606–619.
. Elbenani, B., & Ferland, J. A., “Cell Formation Problem Solved Exactly with the Dinkelbach Algorithm”, Publication CIRRELT-2012-07, University of Montreal, Canada, 2012.
