• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Industrial Engineering and Engineering Management >Genetic algorithm approach for solving intercellular layout problems in cellular manufacturing systems
【24h】

Genetic algorithm approach for solving intercellular layout problems in cellular manufacturing systems

机译：解决细胞制造系统中细胞间布局问题的遗传算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, a comprehensive genetic algorithm (GA) based solution methodology is proposed for solving layout problems in cellular manufacturing systems (CMS). The issue of intercellular layout is dealt with. The layout of facilities to locations called as facility location problems has been most researched. The optimal assignment of facilities to locations is a combinatorial optimization problem and has been proved NP-hard. The proposed solution methodology is compared to the facility locations algorithms as well as with the other existing algorithms. The novelty of the proposed genetic algorithm lies in the way the initial solution is constructed, and in the way the initial and final chromosomes for GA are obtained. In order to validate the performance of the algorithm, a well known CMS problems that deals with location, is taken for testing which shows that the proposed methodology provides promising results.
机译：在本文中，提出了一种基于综合遗传算法（GA）的解决方案方法，用于解决细胞制造系统（CMS）中的布局问题。细胞间布局的问题得到了解决。人们对设施到场所的布局（称为设施位置问题）进行了最多的研究。设施到位置的最佳分配是一个组合优化问题，并且已被证明是NP-hard的。所提出的解决方案方法与设施位置算法以及其他现有算法进行了比较。提出的遗传算法的新颖之处在于构造初始解的方式，以及获得遗传算法的初始和最终染色体的方式。为了验证算法的性能，进行了一个众所周知的与位置有关的CMS问题进行测试，结果表明所提出的方法可提供有希望的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号