...
首页> 外文期刊>The International Journal of Advanced Manufacturing Technology >An elitist strategy genetic algorithm for integrated layout design
【24h】

An elitist strategy genetic algorithm for integrated layout design

机译:集成布局设计的精英策略遗传算法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

While designing the layout of any manufacturing organizations, the primary objective is to decide an optimal arrangement of their departments (machines or cells) in a two-dimensional shop floor (facility) satisfying desired objectives, which is termed facility layout problem (FLP). In traditional layout design philosophy, the inter-cell layout and flow path layout design of material handling system (MHS) was carried out step by step in a sequential manner. This results in sub-optimal solutions for FLP. In this paper, an integrated approach is adopted to design the inter-cell layout and the flow path layout of MHS simultaneously. The quality of the final layout is evaluated by minimizing the weighted sum of two distance-based cost objectives namely, (1) total material handling cost. (2) Distance-weighted cost of total closeness rating score. Sequence-pair (SP) representation is used for layout encoding. The translation from SP to layout is efficiently done by longest common subsequence methodology. Due to NP-hard nature of the proposed problem, an elitist strategy genetic algorithm (ESGA) is developed and tested with three test problem instances available in the literature. It is found that the proposed ESGA algorithm is able to produce the best solutions consistently, twice faster than the standard GA for the test problem instances.
机译:在设计任何制造组织的布局时,主要目标是确定部门(机器或单元)在满足期望目标的二维车间(设施)中的最佳布置,这被称为设施布局问题(FLP)。在传统的布局设计理念中,物料搬运系统(MHS)的小室间布局和流路布局设计是逐步进行的。这导致FLP的解决方案不理想。本文采用一种集成的方法来同时设计MHS的小区间布局和流路布局。通过最小化两个基于距离的成本目标的加权总和,即(1)总物料搬运成本,可以评估最终布局的质量。 (2)距离加权总接近度评分得分。序列对(SP)表示用于布局编码。从SP到布局的转换可以通过最长的通用子序列方法有效地完成。由于提出的问题具有NP难性,因此开发了精英策略遗传算法(ESGA)并使用文献中提供的三个测试问题实例进行了测试。发现所提出的ESGA算法能够始终如一地产生最佳解决方案,比测试问题实例的标准GA快两倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号