Hybridization of simulated annealing with genetic algorithm for cell formation problem

2016 ◽  
Vol 86 (5-8) ◽  
pp. 2243-2254 ◽  
Author(s):  
Alam Zeb ◽  
Mushtaq Khan ◽  
Nawar Khan ◽  
Adnan Tariq ◽  
Liaqat Ali ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Cell Formation ◽  
Cell Formation Problem ◽  
Formation Problem

Genetic algorithm approach for solving a cell formation problem in cellular manufacturing

2009 ◽  
Vol 36 (3) ◽  
pp. 6598-6604 ◽  
Author(s):  
Iraj Mahdavi ◽  
Mohammad Mahdi Paydar ◽  
Maghsud Solimanpur ◽  
Armaghan Heidarzade
Keyword(s):  
Genetic Algorithm ◽  
Cellular Manufacturing ◽  
Cell Formation ◽  
Cell Formation Problem ◽  
Formation Problem ◽  
A Cell ◽  
Genetic Algorithm Approach

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