Abstract
The purpose of cellular manufacturing (CM) is to find part-families and machine cells which form self-sufficient units of production with a certain amount of autonomy that result in easier control (Kusiak, 1987, 1990). One of the most important steps in CM is to optimally identify cells from a given part-machine incidence matrix. Several formulations of various complexities are proposed in the literature to deal with this problem. One of the mostly known formulations for CM is the quadratic assignment formulation (Kusiak and Chow, 1988). The problem with the quadratic assignment based formulation is the difficulty of its solution due to its combinatorial nature. The formulation is also known as NP-hard (Kusiak and Chow, 1988). In this paper a novel simulated annealing based meta-heuristic algorithm is developed to solve quadratic assignment formulations of the manufacturing cell formation problems. In the paper a novel solution representation scheme is developed. Using the proposed solution representation scheme, feasible neighborhoods can be generated easily. Moreover, the proposed algorithm has the ability to self determine the optimal number of cell during the search process. A test problem is solved to present working of the proposed algorithm.
Similar content being viewed by others
References
Baykasoğlu, A. and Gindy, N. (2000) MOCACEF 1.0: Capability based approach to form part-machine groups for cellular manufacturing applications. In ternational Journal of Production Research, 38(5), 1133–1161.
Baykasoglu, A. and Gindy, N. N. Z. (2001) A simulated annealing algorithm for dynamic layout problem. Computers and Operations Research, 28, 1403–1426.
Baykasoglu, A., Gindy, N. N. Z. and Cobb, R. C. (2001) Capability based formulation and solution of multiple objective cell formation problems using simulated annealing. Integrated Manufacturing Systems, 12(4) 258–274.
Chen, W. H. and Srivastava, B. (1994) Simulated annealing procedures for forming machine cells in group technology. European Journal of Operational Research, 75 , 100–111.
Hwang, H. and Sun, J. (1996) A genetic-algorithm-based heuristic for the GT cell formation problem. Computers Industrial Engneering, 30(4), 941–955.
Joglekar, P., Chung, Q. B. and Tavana, M. (2001) Note on a comparative evaluation of nine well-known algorithms for solving the cell formation problem in group technology. Journal of Applied Mathematics and Decision Sciences, 5(3), 253–268
Kirkpatrick, S., Gelatt Jr., C. D. and Vecchi, M. P. (1983) Optimization by simulated annealing. Science, 220 , 670–680.
Kusiak, A. (1987) The generalized group technology concept. International Journal of Production Research, 25(4), 561–569.
Kusiak, A. and Chow, W. S. (1988) Decomposition of manufacturing systems. IEEE Journal of Robotics and Automation, 4(5), 457–471.
Kusiak, A. (1990) Intelligent Manufacturing Systems, Prentice Hall, U.S.A.
Shafer, S. M. and Meredith, J. R. (1990) A comparison of selected manufacturing cell formation techniques. International Journal of Production Research, 28(4), 661–673.
Srinivasan, G., Narendran, T. T. and Mahadevan, B. (1990) An assignment model for the part-families problem in group technology. International Journal of Production Research, 28(1), 145–152.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Baykasoğlu, A. A meta-heuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells. Journal of Intelligent Manufacturing 15, 753–759 (2004). https://doi.org/10.1023/B:JIMS.0000042661.56171.bb
Issue Date:
DOI: https://doi.org/10.1023/B:JIMS.0000042661.56171.bb