A new solution for a dynamic cell formation problem with alternative routing and machine costs using simulated annealing

2008 ◽  
Vol 59 (4) ◽  
pp. 443-454 ◽  
Author(s):  
R Tavakkoli-Moghaddam ◽  
N Safaei ◽  
F Sassani
Keyword(s):  
Simulated Annealing ◽  
Cell Formation ◽  
Cell Formation Problem ◽  
Formation Problem ◽  
Dynamic Cell ◽  
Alternative Routing

scholarly journals Sensitivity Analysis of Dynamic Cell Formation Problem through Meta-heuristic

2014 ◽  
Vol 12 ◽  
pp. 186-195 ◽  
Author(s):  
Mohammad Hassannezhad ◽  
Marco Cantamessa ◽  
Francesca Montagna ◽  
Fahad Mehmood
Keyword(s):  
Sensitivity Analysis ◽  
Cell Formation ◽  
Cell Formation Problem ◽  
Formation Problem ◽  
Dynamic Cell

scholarly journals Solving the Cubic Cell Formation Problem Using Simulated Annealing

2022 ◽  
Vol 12 (1) ◽  
pp. 0-0
Keyword(s):  
Simulated Annealing ◽  
Manufacturing Systems ◽  
Cell Formation ◽  
Cell Formation Problem ◽  
Major Objective ◽  
Minimum Value ◽  
Formation Problem ◽  
Neighbourhood Search ◽  
Problem Instances ◽  
Solution Methodology

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.

Sign in / Sign up

Export Citation Format

Share Document