A new hybrid evolutionary algorithm for solving multi objective cellformation problem

2009 International Conference on Computers and Industrial Engineering, CIE 2009

Volumn , Issue , 2009, Pages 612-616

  Haleh, H ^a   Iranmanesh, H ^b   Kor, H ^b  

^a ISFAHAN UNIVERSITY OF TECHNOLOGY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Cellular manufacturing system; Memetic algorithm; Multi objective; Pareto set; Revised TOPSIS

Indexed keywords

CELLULAR MANUFACTURING; DECISION MAKING;

DECISION MAKERS; HYBRID EVOLUTIONARY ALGORITHM; MEMETIC ALGORITHMS; MULTI OBJECTIVE; MULTI-OBJECTIVE CELL FORMATION PROBLEM; NONDOMINATED SOLUTIONS; PARETO SET; REVISED TOPSIS;

EVOLUTIONARY ALGORITHMS;

EID: 77956120442     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccie.2009.5223729     Document Type: Conference Paper

References (13)

1. Wemmerlov, U. and Johnson, D.J., Cellular manufacturing at 46 userplants: implementation experiences and performance improvements. Int. J. Prod.Res., 1997, 35, 29-49.
2. Wemmerlov, U. and Johnson, D.J., Empirical findings in manufacturing celldesign. Int. J. Prod. Res., 2000, 38, 481-507.
3. Mansouri, S.A., Moattar Husseini, S.M. and Newman, S.T., A review of themodern approaches to multi-criteria cell design. Int. J. Prod. Res., 2000, 38,1201-1218.
4. Dimopoulos, C. and Mort, N., Evolving knowledge for the solution ofclustering problems in cellular manufacturing. Int. J. Prod. Res., 2004, 42,4119-4133.
5. Zitzler, E. and Thiele, L., Multi-objective evolutionary algorithms: acomparative case study and the Strength Pareto approach. IEEE Trans. Evol.Comput., 1999, 3, 257-271.
6. Chandrasekharan, M.P. and Rajagopalan, R., Groupability: analysis of theproperties of binary data matrices for group technology. Int. J. Prod. Res.,1989, 27, 1035-1052.
7. Kumar, C.S. and Chandrasekharan, M.P., Grouping efficacy: a quantitativecriterion for goodness of block diagonal forms of binary matrices in grouptechnology. Int. J. Prod. Res., 1990, 28, 233-243.
8. Miltenburg, J. and Zhang, W., A comparative evaluation of nine well-knownalgorithms for solving the cell formation problem in group technology. J. Oper.Manage. 1991, 10, 44-72.
9. Gupta, Y.P., Gupta, M.C., Kumar, A. and Sundaram, C., A geneticalgorithm-based approach to cell composition and layout design problems. Int. J.Prod. Res., 1996, 34, 447-482.
10. Dimopoulos, C., Multi-objective optimization of manufacturing celldesign. Int. J. Prod. Res., 2006, 44(22), 4855-4875.
11. Haupt, S.E., Haupt, R.L., 1998. Practical genetic algorithm, secondedition, John Wiley.
12. C. M. Fonseca and P. J. Fleming. Genetic Algorithms for Multi-objectiveOptimization: Formulation, Discussion and Generalization. In S. Forrest, editor,Proceedings of the Fifth International Conference on Genetic Algorithms, pages416-423, San Mateo, California, 1993. University of Illinois atUrbana-Champaign, Morgan Kaufmann Publishers.
13. J. Morse. Reducing the size of the nondominated set: Pruning byclustering. Computers and Operations Research, 7(l-2):55-66, 1980.