首页> 外文期刊>International journal of computational intelligence research >Impact of Transportation Cost for Optimum Design FMS Layout: A Genetic Algorithm Approach
【24h】

Impact of Transportation Cost for Optimum Design FMS Layout: A Genetic Algorithm Approach

机译:运输成本对最优设计FMS布局的影响:遗传算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

FMS layout ordering is key issue to yield desirable productivity in manufacturing system. This paper discusses the various layout design in flexible manufacturing system(FMS). The aim of this facility layout problem is to determine the sequence of machines and their configuration, to reduce the number of traversal for a part from machine to machine in such a manner that ordering of machines influence the transportation cost.. Genetic algorithms (GA) provide a powerful search technique with parallel processing of a large number of solutions, while coding the parameters instead of working on the parameters directly. The search is random due to the probabilistic transition rules. The GA operators encourage production of stronger children through the mating of stronger parents as the solution moves through generations. Crossover ensures exploitation while mutation ensures exploration of the solution space without a complete enumeration. This paper furnish the design, development and testing of a Genetic Algorithm to solve the FMS layout problems The proposed method applied to a case problem containing the details like no of machines, inter slot distance between machines, frequency of trips between machines and variable material handling cost. The problem is tested for various iterations and different size of populations involved in genetic algorithm. A simulation programme is developed in C++ for evaluating the problem.
机译:FMS布局排序是在制造系统中产生理想生产率的关键问题。本文讨论了柔性制造系统(FMS)中的各种布局设计。该设施布局问题的目的是确定机器的顺序及其配置,以减少机器之间的零件遍历次数,以使机器的订购影响运输成本。.遗传算法(GA)提供了一种强大的搜索技术,可以并行处理大量解决方案,同时对参数进行编码,而不是直接对参数进行处理。由于概率转移规则,搜索是随机的。当解决方案代代相传时,GA运营商通过结实父母来鼓励结实子女的生产。交叉可确保开发,而变异可确保无需完整枚举即可探索解决方案空间。本文为解决FMS布局问题提供了一种遗传算法的设计,开发和测试。该方法适用于包含以下问题的案例问题:机器数量,机器之间的槽间距离,机器之间的行程频率以及可变的物料处理成本。针对遗传算法中涉及的各种迭代和不同大小的种群,测试了该问题。用C ++开发了一个仿真程序来评估问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号