Solving the Cubic Cell Formation Problem Using Simulated Annealing

Solving the Cubic Cell Formation Problem Using Simulated Annealing

Hamida Bouaziz, Ali Lemouari
Copyright: © 2022 |Volume: 12 |Issue: 1 |Pages: 19
ISSN: 2155-6377|EISSN: 2155-6385|EISBN13: 9781683182085|DOI: 10.4018/IJIRR.290827
Cite Article Cite Article

MLA

Bouaziz, Hamida, and Ali Lemouari. "Solving the Cubic Cell Formation Problem Using Simulated Annealing." IJIRR vol.12, no.1 2022: pp.1-19. http://doi.org/10.4018/IJIRR.290827

APA

Bouaziz, H. & Lemouari, A. (2022). Solving the Cubic Cell Formation Problem Using Simulated Annealing. International Journal of Information Retrieval Research (IJIRR), 12(1), 1-19. http://doi.org/10.4018/IJIRR.290827

Chicago

Bouaziz, Hamida, and Ali Lemouari. "Solving the Cubic Cell Formation Problem Using Simulated Annealing," International Journal of Information Retrieval Research (IJIRR) 12, no.1: 1-19. http://doi.org/10.4018/IJIRR.290827

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The Cubic Cell Formation Problem (CCFP) in cellular manufacturing systems consists in decomposing a production system into a set of manufacturing cells, and assigning workers to cells besides parts and machines. The major objective is to obtain manageable cells. Manageable cells mean cells with a minimum value of inter-cell moves of parts and workers and a minimum value of heterogeneity within cells. In this paper, a solution methodology based on a modified simulated annealing heuristic with a proposed neighbourhood search procedure is proposed. The methodology allows building multiple configurations by giving to the decision-maker the ability to control some parameters. Experimental results show that the proposed algorithm gives a promising performance for all problem instances found in the literature.