Skip to main content
SpringerLink
Log in
Book cover

Models, Algorithms, and Technologies for Network Analysis pp 43–69Cite as

Heuristic Algorithm for the Cell Formation Problem

  • Conference paper

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 59))

Abstract

In this chapter, we introduce a new heuristic for Cell Formation Problem in its most general formulation with grouping efficiency as an objective function. Suggested approach applies an improvement procedure to obtain solutions with high grouping efficiency. This procedure is repeated until efficiency can be increased for randomly generated configurations of cells. We consider our preliminary results for 10 popular benchmark instances taken from the literature. Also source instances with the solutions we got can be found in the Appendix.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ghosh, S., Mahanti, A., Nagi, R., Nau, D.S.: Cell formation problem solved exactly with the Dinkelbach algorithm. Ann. Oper. Res. 65(1), 35–54 (1996)

    Article  MATH  Google Scholar 

  2. Boe, W., Cheng, C.H.: A close neighbor algorithm for designing cellular manufacturing systems. Int. J. Prod. Res. 29(10), 2097–2116 (1991)

    Article  MATH  Google Scholar 

  3. Burbidge, J.L.: The new approach to production. SPE Prod. Eng. 40(12), 769–784 (1961)

    Article  Google Scholar 

  4. Burbidge, J.L.: The Introduction of Group Technology. Wiley, New York (1975)

    Google Scholar 

  5. Carrie, S.: Numerical taxonomy applied to group technology and plant layout. Int. J. Prod. Res. 11, 399–416 (1973)

    Article  Google Scholar 

  6. Chandrasekharan, M.P., Rajagopalan, R.: Groupability: analysis of the properties of binary data matrices for group technology. Int. J. Prod. Res. 27(6), 1035–1052 (1989)

    Article  Google Scholar 

  7. Flanders, R.E.: Design manufacture and production control of a standard machine. Trans. Am. Soc. Mech. Eng. 46, 691–738 (1925)

    Google Scholar 

  8. Goldengorin, B., Krushinsky, D., Slomp, J.: Flexible PMP approach for large size cell formation. Oper. Res. 60(5), 1157–1166 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Mitrofanov, S.P.: Nauchnye Osnovy Gruppovoy Tekhnologii. Lenizdat, Leningrad (1959), 435 pp. (in Russian)

    Google Scholar 

  10. Mitrofanov, S.P.: The Scientific Principles of Group Technology. Boston Spa, Yorkshire (1966). National Lending Library Translation, translation of Mitrofanov (1959)

    Google Scholar 

  11. Mosier, C.T., Taube, L.: Weighted similarity measure heuristics for the group technology machine clustering problem. Omega 13(6), 577–583 (1985)

    Article  Google Scholar 

  12. Seifoddini, H., Wolfe, P.M.: Application of the similarity coefficient method in group technology. IIE Trans. 18(3), 271–277 (1986)

    Article  Google Scholar 

  13. Waghodekar, P.H., Sahu, S.: Machine-component cell formation in group technology MACE. Int. J. Prod. Res. 22, 937–948 (1984)

    Article  Google Scholar 

  14. Sandbothe, R.A.: Two observations on the grouping efficacy measure for goodness of block diagonal forms. Int. J. Prod. Res. 36, 3217–3222 (1998)

    Article  MATH  Google Scholar 

  15. Ahi, A., Aryanezhad, Mir.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. Comput. Oper. Res. 36(5), 1478–1496 (2009)

    Article  MATH  Google Scholar 

  16. Bhatnagar, R., Saddikuti, V.: Models for cellular manufacturing systems design: matching processing requirements and operator capabilities. J. Oper. Res. Soc. 61, 827–839 (2010)

    Article  MATH  Google Scholar 

Download references

Acknowledgements

The authors are partially supported by LATNA Laboratory, NRU HSE, RF government grant, ag. 11.G34.31.0057.

Author information

Authors and Affiliations

  1. Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, 136 Rodionova Street, Nizhny Novgorod, 603093, Russian Federation

    Ilya Bychkov, Mikhail Batsyn, Pavel Sukhov & Panos M. Pardalos

  2. Center of Applied Optimization, University of Florida, 401 Weil Hall, P.O. Box 116595, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Authors
  1. Ilya Bychkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Batsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pavel Sukhov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ilya Bychkov .

Editor information

Editors and Affiliations

  1. Dept. of Industrial and Systems Engineer, University of Florida, Gainesville, Florida, USA

    Boris I. Goldengorin

  2. Department of Applied Mathematics, National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Valery A. Kalyagin

  3. Department of Industrial & Systems Engin, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

Appendix: Source Instances and Solutions

Appendix: Source Instances and Solutions

Table 7 Sandbothe (1998) [14]
Full size table
Table 8 Ahi et al. (2009) [15]
Full size table
Table 9 Mosier and Taube (1985) [11]
Full size table
Table 10 Boe and Cheng (1991) [2] 35 parts and 20 machines
Full size table
Table 11 Carrie (1973) [5] 35 parts and 20 machines
Full size table
Table 12 Ahi et al. (2009) [15] 51 parts and 20 machines
Full size table
Table 13 Chandrasekharan and Rajagopalan (1989) [6] 40 parts and 24 machines
Full size table
Table 14 Chandrasekharan and Rajagopalan (1989) [6] 40 parts and 24 machines
Full size table
Table 15 Chandrasekharan and Rajagopalan (1989) [6] 40 parts and 24 machines
Full size table
Table 16 Chandrasekharan and Rajagopalan (1989) [6] 40 parts and 24 machines
Full size table
Table 17 Sandbothe (1998) [14] solution
Full size table
Table 18 Ahi et al. (2009) [15] solution
Full size table
Table 19 Mosier and Taube (1985) [11] solution
Full size table
Table 20 Boe and Cheng (1991) [2] 35 parts and 20 machines solution
Full size table
Table 21 Carrie (1973) [5] 35 parts and 20 machines solution
Full size table
Table 22 Ahi et al. (2009) [15] 51 parts and 20 machines solution
Full size table
Table 23 Chandrasekharan and Rajagopalan (1989) [6] 40 parts and 24 machines solution
Full size table
Table 24 Chandrasekharan and Rajagopalan (1989) [6] 40 parts and 24 machines solution
Full size table
Table 25 Chandrasekharan and Rajagopalan (1989) [6] 40 parts and 24 machines solution
Full size table
Table 26 Chandrasekharan and Rajagopalan (1989) [6] 40 parts and 24 machines solution
Full size table

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this paper

Cite this paper

Bychkov, I., Batsyn, M., Sukhov, P., Pardalos, P.M. (2013). Heuristic Algorithm for the Cell Formation Problem. In: Goldengorin, B., Kalyagin, V., Pardalos, P. (eds) Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics, vol 59. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8588-9_4

Download citation

Publish with us

Policies and ethics

Search

Navigation