...
首页> 外文期刊>European Journal of Industrial Engineering >Solution for bi-objective single row facility layout problem using artificial bee colony algorithm
【24h】

Solution for bi-objective single row facility layout problem using artificial bee colony algorithm

机译:使用人工蜂菌落算法的双目标单行设施布局问题解决方案

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

摘要

The single row facility layout problem (SRFLP) is concerned with the arrangements of machineries in a single line for processing multiple products. This arrangement is termed as linear machine sequence (lms). The aim of the proposed work is to design a best lms that simultaneously minimises the objectives: the total flow distance of the products (D); and the total length of the flow line (L) needed for accommodating the machineries in the shop floor. Consideration of more than one objective in a multi-product environment in bi-objective single row facility layout problem (BOSRFLP) is an NP-hard problem. Hence, artificial bee colony (ABC) algorithm is applied to identify the best lms. The effectiveness of the proposed algorithm is verified by solving the problems discussed in the literature. Maximum of 37.54% reduction in total flow distance and 9.31% reduction in total length of the flow line are achieved by the proposed method.
机译:单行设施布局问题(SRFLP)涉及机器在单线中的安排,用于处理多个产品。 这种布置被称为线性机器序列(LMS)。 拟议工作的目的是设计一个最佳LMS,同时最大限度地减少目标:产品的总流量距离(D); 以及容纳车间内部机器所需的流量线(L)的总长度。 在双目标单行设施布局问题(Bosrflp)中,考虑在多产品环境中的多产品环境中是一个NP难题。 因此,应用人造蜜蜂菌落(ABC)算法来识别最佳LMS。 通过解决文献中讨论的问题来验证所提出的算法的有效性。 通过该方法实现了总流量距离的总流量距离的最大值和9.31%的9.31%,所提出的方法实现了9.31%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号