.png){kind=icon}
.png){kind=icon}
Return
A genetic algorithm with proper parameters for manufacturing cell formation problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-010-0446-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
One fundamental problem in cellular manufacturing is the formation of product families and machine cells. Many solution methods have been developed for the cell formation problem. Since efficient grouping is the prerequisite of a successful Cellular Manufacturing installation the research in this area will likely be continued. In this paper, we consider the problem of cell formation in cellular manufacturing systems with the objective of maximizing the grouping efficacy. We propose a Genetic Algorithm (GA) to obtain machine-cells and part-families. Developed GA has three different selection and crossover operators. The proper operators and parameters of the GA were determined by design of experiments. A set of 15 test problems with various sizes drawn from the literature is used to test the performance of the proposed algorithm. The corresponding results are compared to several well-known algorithms published. The comparative study shows that the proposed GA improves the grouping efficacy for 40% of the test problems.
Keywords:
Cell formation problem
Genetic algorithms
Grouping efficacy
Design of experiments
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.4
Papers:
3.5K
Citations:
1.1W