SIMULATED ANNEALING METHOD WITH DIFFERENT NEIGHBORHOODS FOR SOLVING THE CELL FORMATION PROBLEM

Luong Thuan Thanh, Jacques A. Ferland, Nguyen Dinh Thuc, Van Hien Nguyen

Abstract

In this paper we solve the cell formation problem with different variants of the simulated annealing method obtained by using different neighborhoods of the current solution. The solution generated at each iteration is obtained by using a diversification of the current solution combined with an intensification to improve this solution. Different diversification and intensification strategies are combined to generate different neighborhoods. The most efficient variant allows improving the best-known solution of one of the 35 benchmark problems commonly used by authors to compare their methods, and reaching the best-known solution of 30 others.

References

  1. Askin, R. G. and Subramanian, S. P., 1987. A cost-based heuristic for group technology configuration. International Journal of Production Research, 25, 101-113.
  2. Boctor, F. F., 1991. A linear formulation of the machinepart cell formation problem. International Journal of Production Research, 29, 343-356.
  3. Boe, W. J. and Cheng, C. H., 1991. A close neighbour algorithm for designing cellular manufacturing systems. International Journal of Production Research, 29, 2097-2116.
  4. Carrie, A. S., 1973. Numerical taxonomy applied to group technology and plant layout. International Journal of Production Research, 11, 399-416.
  5. Cerny, V., 1985. Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Application, 45, 41 - 51.
  6. Chan, H. M. and Milner, D. A., 1982. Direct clustering algorithm for group formation in cellular manufacture. Journal of Manufacturing Systems, 1, 65-75.
  7. Chandrasekharan, M. P. and Rajagopalan, R., 1987. ZODIAC: an algorithm for concurrent formation of part-families and machine-cells. International Journal of Production Research, 25, 835-850.
  8. Chandrasekharan, M. P. and Rajagopalan, R., 1989. GROUPABILITY: an analysis of the properties of binary data matrices for group technology. International Journal of Production Research, 27, 1035-1052.
  9. Chandrasekharan, M. P. and Rajagopalan, R., 1986a. MODROC: an extension of rank order clustering for group technology. International Journal of Production Research, 24, 1221-1233.
  10. Chandrasekharan, M. P. and Rajagopalan, R., 1986b. An ideal seed non-hierarchical clustering algorithm for cellular manufacturing. International Journal of Production Research, 24, 451-464.
  11. Dimopoulos, C. and Zalzala, A. M. S., 2000. Recent developments in evolutionary computations for manufacturing optimization: problems, solutions, and comparisons. IEEE Transactions on Evolutionary Computations, 4, 93-113.
  12. Elbenani, B., Ferland, J. A., Bellemare J., 2011. Genetic algorithm and large neighbourhood search to solve the cell formation problem. Expert Systems with Applications (to appear).
  13. Ferland, J. A. and Costa D., 2001. Heuristic search methods for combinatorial programming problems. Publication # 1193, Department of computer science and operation research, University of Montreal, Canada.
  14. Ghosh, T., Dan, P. K., Sengupta, S., Chattopadhyay, M., 2010. Genetic rule based techniques in cellular manufacturing (1992-2010): a systematic survey. International Journal of Engineering Science and Technology, 2, 198-215.
  15. Goncalves, J. and Resende, M. G. C., 2004. An evolutionary algorithm for manufacturing cell formation. Computers & Industrial Engineering, 47, 247-273.
  16. James, T. L., Brown, E. C., Keeling, K. B., 2007. A hybrid Grouping Genetic Algorithm for the cell formation problem. Computers & Operations Research, 34, 2059-2079.
  17. Khoa, T., Ferland, J. A., Tien, D., 2011. A randomized local search algorithm for the machine-part cell formation problem. In Advanced Intelligent Computing Technology and Applications-ICIC2011 (to appear).
  18. King, J. R., 1980. Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm. International Journal of Production Research, 18, 213-232.
  19. Kirkpatrick, S., Gelatt, C. D. Jr, Vecchi, M. P., 1983. Optimization by simulated annealing. Science, 220, 671 - 680.
  20. King, J. R. and Nakornchai, V., 1982. Machinecomponent group formation in group technology: review and extension. International Journal of Production Research, 20, 117-133.
  21. Kumar, C. and Chandrasekharan, M., 1990. Grouping efficiency: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology. International Journal of Production Research, 28, 233-243.
  22. Kumar, K. R. and Vannelli, A., 1987. Strategic subcontracting for efficient disaggregated manufacturing. International Journal of Production Research, 25, 1715-1728.
  23. Kumar, K. R., Kusiak, A., Vannelli, A., 1986. Grouping of parts and components in flexible manufacturing systems. European Journal of Operational Research, 24, 387-397.
  24. Kusiak, A. and Cho, M., 1992. Similarity coefficient algorithm for solving the group technology problem. International Journal of Production Research, 30, 2633-2646.
  25. Kusiak, A. and Chow, W. S., 1987. Efficient solving of the group technology problem, Journal of Manufacturing Systems, 6, 117-124.
  26. Luo, L., Tang, L., 2009. A hybrid approach of ordinal optimization and iterated local search for manufacturing cell formation. International Journal of Advanced Manufacturing Technology, 40, 362- 372.
  27. Mahdavi, I., Javadi, B., Fallah-Alipour, K., Slomp, J., 2007. Designing a new mathematical model for cellular manufacturing system based on cell utilization. Applied Mathematics and Computation, 190, 662-670.
  28. McCormick, W. T., Schweitzer, P. J., White, T. W., 1972. Problem decomposition and data reorganization by a clustering technique. Operations Research, 20, 993- 1009.
  29. Mosier, C. T. and Taube, L., 1985a. The facets of group technology and their impact on implementation. OMEGA, 13, 381-391.
  30. Mosier, C. and Taube, L., 1985b. Weighted similarity measure heuristics for the group technology machine clustering problem, OMEGA, 13, 577-83.
  31. Papaioannou, G. and Wilson, J. N., 2010. The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research, European Journal of Operational Research, 206, 509-521.
  32. Rojas, W., Solar, M., Chacon, M, Ferland, J. A., 2004. An efficient genetic algorithm to solve the manufacturing cell formation problem. In Adaptive Computing in Design and Manufacture VI, I.C. Parmee (ed), Springer-Verlag, 173-184 .
  33. Sarker, B. and Khan, M., 2001. A comparison of existing grouping efficiency measures and a new grouping efficiency measure. IIE Transactions, 33, 11-27.
  34. Seifoddini, H., 1989. A note on the similarity coefficient method and the problem of improper machine assignment in group technology applications. International Journal of Production Research, 27, 1161-1165.
  35. Seifoddini, H. and Wolfe, P. M., 1986. Application of the similarity coefficient method in group technology, IIE Transactions, 18, 271-277.
  36. Srinivasan, G., Narendran, T. T., Mahadevan, B., 1990. An assignment model for the part-families problem in group technology, International Journal of Production Research, 28, 145-152.
  37. Stanfel, L. E., 1985. Machine clustering for economic production. Engineering Costs and Production Economics, 9, 73-81.
  38. Tunnukij, T. and Hicks, C., 2009. An Enhanced Genetic Algorithm for solving the cell formation problem. International Journal of Production Research, 47, 1989-2007.
  39. Waghodekar, P. H. and Sahu, S., 1984. Machinecomponent cell formation in group technology MACE. International Journal of Production Research, 22, 937-948.
  40. Ying K. C., Lin S.W., Lu C. C. 2011. Cell formation using a simulated annealing algorithm with variable neighbourhood. European Journal of Industrial Engineering, 5, 22-42.
Download


Paper Citation


in Harvard Style

Thanh L., A. Ferland J., Thuc N. and Nguyen V. (2011). SIMULATED ANNEALING METHOD WITH DIFFERENT NEIGHBORHOODS FOR SOLVING THE CELL FORMATION PROBLEM . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 525-533. DOI: 10.5220/0003723705250533


in Bibtex Style

@conference{fec11,
author={Luong Thuan Thanh and Jacques A. Ferland and Nguyen Dinh Thuc and Van Hien Nguyen},
title={SIMULATED ANNEALING METHOD WITH DIFFERENT NEIGHBORHOODS FOR SOLVING THE CELL FORMATION PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011)},
year={2011},
pages={525-533},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003723705250533},
isbn={978-989-8425-83-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011)
TI - SIMULATED ANNEALING METHOD WITH DIFFERENT NEIGHBORHOODS FOR SOLVING THE CELL FORMATION PROBLEM
SN - 978-989-8425-83-6
AU - Thanh L.
AU - A. Ferland J.
AU - Thuc N.
AU - Nguyen V.
PY - 2011
SP - 525
EP - 533
DO - 10.5220/0003723705250533