Abstract
One of the fundamental problems in cellular manufacturing is grouping products with similar features into families and associated machines into cells. The objective is to maximize grouping efficacy, which indicates the within-cell machine utilization and the inter-cell movement. In this paper, a novel hybrid approach combining ordinal optimization (OO) and iterated local search (ILS) is presented to solve it in a short time. The hybrid algorithm takes ordinal optimization as the main framework, while ILS is embedded in the framework as a sub-procedure. In each iteration of the algorithm, according to OO strategy, r best solutions are accepted as the initial solutions for the embedded ILS in turn. From each initial solution, H solutions are generated and totally rH “good enough” solutions are obtained. For the ILS algorithm, a very-large scale neighborhood, cyclic transfer neighborhood is adopted, the characteristic of which is several products moving simultaneously in a cyclical manner. A reinforcement kick strategy is also proposed for the ILS algorithm, in which the products and machines are regrouped according to the current grouping relationships between products and machines. Computational experience on a set of group technology problems available in the literature shows the efficiency of the new hybrid algorithm. The results obtained by the hybrid algorithm are comparable to those obtained by other known algorithm in the literature for the problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Akturk MS, Turkcan A (2000) Cellular manufacturing system design using a holonistic approach. Int J Prod Res 38(1):2327–2347
Kusiak A, Cheng CH (1991) Group technology: analysis of selected models and algorithms. Design, Analysis, and Control of Manufacturing Cells 53:99–114
Kusiak A (1990) Intelligent manufacturing systems. Prentice Hall, Upper Saddle River
Kumar KR, Chandrasekharan MP (1990) Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology. Int J Prod Res 28(2):233–243
Kusiak A (1987) The generalized group technology concept. Int J Prod Res 25(4):561–569
Viswanathan S (1996) A new approach for solving the p-median problem in group technology. Int J Prod Res 34(10):2691–2700
Deutsch SJ, Freeman SF, Helander M (1998) Manufacturing cell formation using an improved p-median model. Comput Ind Eng 34(1):135–146
Won Y (2000a) New p-median approach to cell formation with alternative process plans. Int J Prod Res 38(1) 229–240
Won Y (2000b) Two-phase approach to GT cell formation using efficient p-median formulations. Int J Prod Res 38(7):1601–1613
Gonçalves JF, Resende MGC (2004) An evolutionary algorithm for manufacturing cell formation. Comput Ind Eng 47:247–273
Solimanpur M, Vrat P, Shankar R (2004) Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing. Eur J Oper Res 157:560–592
Rogers DF, Kulkarni SS (2005) Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing. Eur J Oper Res 160:423–444
Ho YC, Sreenivas RS, Vakili P (1992) Ordinal optimization of DEDS. Discrete Event Dyn Syst 2(2):61–88
Ho YC (1994) Heuristics, rule of thumb, and the 80/20 proposition. IEEE Transactions on Automatic Control 39:1025–1027
Li D, Lee LH, Ho YC (2002) Constraint ordinal optimization. Inf Sci 148(1–4):201–220
Sullivan KA, Jacobson SH (2000) Ordinal hill climbing algorithms for discrete manufacturing process design optimization problems. Discrete Event Dyn Syst 10:307–324
Yen DH, Wong DSH, Jang SS (2004) Solution of trim-loss problem by a hybrid simulated annealing and ordinal optimization approach. J Intell Manuf 15:701–709
Luo Y, Guinard M, Chen C (2001) A hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization. J Intell Manuf 12:509–519
Dai L (1996) Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems. J Optim Theory Appl 91(2):363–388
Besten M, Stutzle T, Dorigo M (2001) Design of iterated local search algorithms - An example application to the single machine total weighted tardiness problem. Applications of Evolutionary Computing, Proceedings Lecture Notes in Computer Science 2037:441–451
Paquete L, Stützle T (2002) An experimental investigation of iterated local search for coloring graphs. Applications of Evolutionary Computing, Proceedings Lecture Notes in Computer Science 2279:122–131
Merz P (2003) An iterated local search approach for minimum sum-of-squares clustering. Advances in Intelligent Data Analysis Lecture Notes in Computer Science 2810:286–296
Lourenço HR (1995) Job-shop scheduling: Computational study of local search and large-step optimization methods. Eur J Oper Res 83:347–364
Lourenço HR, Martin O, Stützle T (2001) A beginner’s introduction to iterated local search. MIC’2001-4th Metaheuristics International Conference. Porto, Portugal, July 16–20
Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discrete Appl Math 123:75–102
Pacheco JA (2005) A scatter search approach for the minimum sum-of-squares clustering problem. Comput Oper Res 32:325–1335
Thompson PM, Orlin JB (1989) The theory of cyclic transfers. Working paper. Operations Research Center MIT, Cambridge Mass
Congram RK (2000) Polynomially searchable exponential neighbourhood for sequencing problems in combinatorial optimization. Ph.D. Thesis, Faculty of Mathmatical Studies, University of Southampton, U.K.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Luo, J., Tang, L. A hybrid approach of ordinal optimization and iterated local search for manufacturing cell formation. Int J Adv Manuf Technol 40, 362–372 (2009). https://doi.org/10.1007/s00170-007-1346-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-007-1346-8