.png){kind=icon}
返回
A genetic algorithm for FMS part type selection and machine loading
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540050176058.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Part type selection (PTS) and machine loading are two major problems in the production planning of flexible manufacturing systems. In this paper, we solve these problems by the use of genetic algorithms (GAs). We exploit the problem's MIP (mixed integer programming) model to make our GA more meaningful and less computation-intensive. The GA strategy is developed in three parts: solution coding, solution generation and solution recombination. In solution coding, we replace the original binary routing variables with integer variables and thus reduce the chromosome length significantly. Tn solution generation, the level of Feasibility is the main concern. We divide the constraints into two categories: direct and indirect. The direct constraints involve only two variables each and are easily satisfied by context-dependent genes. Since the direct constraints form the major chunk of constraints, their satisfaction controls infeasibility to a large extent. The remaining indirect constraints are handled by the penalty function approach. The solution recombination involves crossover and mutation. The crossover is performed in two steps, the PTS swap, followed by the routing swap, so that the feasibility level is not disturbed. With a similar intent, the mutation is allowed to operate only on selective genes. All the steps are illustrated with examples. Our GA is able to achieve optimum or near-optimum performance on a variety of objectives. A parametric study of GA factors is also carried out, indicating population size and mutation probability as influential parameters.
Keyword:
FLEXIBLE MANUFACTURING SYSTEMS
OPERATION-ALLOCATION
TOOL ALLOCATION
FORMULATION
MODEL
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
