Skip to main content

Manufacturing Cell Formation Problem Using Hybrid Cuckoo Search Algorithm

  • Chapter
  • First Online:
Recent Developments in Metaheuristics

Abstract

Cellular manufacturing, as one of the most important applications of Group Technology, has gained popularity in both academic research and industrial applications. The cell formation problem is considered the first and the foremost issue faced in the designing of cellular manufacturing systems that attempts to minimize the inter-cell movement of the products while maximize the machines utilization. This paper presents an adapted optimization algorithm entitled the cuckoo search algorithm for solving this kind of problems. The proposed method is tested on different benchmark problems; the obtained results are then compared to others available in the literature. The comparison result reveals that on 31 out of 35 problems (88.57%) the results of the introduced method are among the best results.

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

Access this chapter

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

Institutional subscriptions

References

  1. M.P. Chandrasekharan, R. Rajagopalon, ZODIAC-an algorithm for concurrent formation of part-families and machine-cells. Int. J. Prod. Res. 25, 835–850 (1987)

    Article  Google Scholar 

  2. J.A. Diaz, D. Luna, R. Luna, A GRASP heuristic for the manufacturing cell. Top. 20, 679–706 (2012)

    Article  Google Scholar 

  3. C. Dimopoulos, A.M.S. Zalzala, Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons. IEEE Trans. Evol. Comput. 4, 93–113 (2000)

    Article  Google Scholar 

  4. B. Elbenani, J.A. Ferland, CIRRELT: Cell Formation Problem Solved Exactly with the Dinkelbach Algorithm (CIRRELT, Montreal, 2012), pp. 1–14

    Google Scholar 

  5. B. Elbenani, J.A. Ferland, J. Bellemare, Genetic algorithm and large neighbourhood search to solve the cell formation problem. Expert Syst. Appl. 39, 2408–2414 (2012)

    Article  Google Scholar 

  6. J.F. Goncalves, M.G.C. Resende, An evolutionary algorithm for manufacturing cell formation. Comput. Ind. Eng. 47, 247–273 (2004)

    Article  Google Scholar 

  7. A. Husseinzadeh Kashan, B. Karimi, A. Noktehdan, A novel discrete particle swarm optimization algorithm for the manufacturing cell formation problem. Int. J. Adv. Manuf. Tech. 73, 1543–1556 (2014)

    Article  Google Scholar 

  8. T.L. James, E.C. Brown, K.B. Keeling, A hybrid grouping genetic algorithm for the cell formation problem. Comput. Oper. Res. 34, 2059–2079 (2007)

    Article  Google Scholar 

  9. C.S. Kumar, M.P. Chandrasekharan, Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology. Int. J. Protein Res. 28, 233–243 (1990)

    Article  Google Scholar 

  10. G. Papaioannou, J.M. Wilson, The evolution of cell formation problem methodologies based on recent studies (1997–2008): review and directions for future research. Eur. J. Oper. Res. 206, 509–521 (2010)

    Article  Google Scholar 

  11. M.K. Sayadi, A. Hafezalkotob, S.G.J. Naini, Firefly-inspired algorithm for discrete optimization problems: an application to manufacturing cell formation. J. Manuf. Syst. 32, 78–84 (2013)

    Article  Google Scholar 

  12. S.M. Seyedhosseini, H. Badkoobehi, A. Noktehdan, Machine-part cell formation problem using a group based league championship algorithm. J. Promot. Manag. 21, 55–63 (2015)

    Article  Google Scholar 

  13. M. Solimanpur, A. Elmi, A tabu search approach for cell scheduling problem with makespan criterion. Int. J. Prod. Econ. 141, 639–645 (2013)

    Article  Google Scholar 

  14. G. Srinivasan, T.T. Narendran, GRAFICS- A nonhierarchical clustering algorithm for group technology. Int. J. Prod. Res. 29, 463–478 (1991)

    Article  Google Scholar 

  15. X.S. Yang, S. Deb, Cuckoo search via Lévy flights, in IEEE NaBIC 2009: Proceedings of the World Congress on Nature and Biologically Inspired Computing, Coimbatore (2009), pp. 210–214

    Google Scholar 

  16. K.C. Ying, S.W. Lin, C.C. Lu, Cell formation using a simulated annealing algorithm with variable neighbourhood. Eur. J. Ind. Eng. 5, 22–42 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bouchra Karoum .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Cite this chapter

Karoum, B., Elbenani, B., Khattabi, N.E., Imrani, A.A.E. (2018). Manufacturing Cell Formation Problem Using Hybrid Cuckoo Search Algorithm. In: Amodeo, L., Talbi, EG., Yalaoui, F. (eds) Recent Developments in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 62. Springer, Cham. https://doi.org/10.1007/978-3-319-58253-5_10

Download citation

Publish with us

Policies and ethics