...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>The International Journal of Advanced Manufacturing Technology >Tabu search heuristic for efficiency of dynamic facility layout problem
【24h】

Tabu search heuristic for efficiency of dynamic facility layout problem

机译：禁忌搜索启发式动态设施布局问题的效率

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The facility layout problem (FLP) is a well-researched problem of finding positions of departments on a plant floor such that departments do not overlap and some specific critical criteria involved in FLP are optimized. In addition, the facility layout dramatically influences the efficiency of material handling within a manufacturing system. In order to ensure optimal performance within a manufacturing system, the facility layout should reflect changes throughout time. However, the static facility layout problem with constant material flows between departments may not be a realistic scenario because a manufacturing facility is a dynamic system that constantly evolves. On the other hand, layout problem has multi-objective nature, and it is necessary to apply various criteria and goals for determining a good facility layout. As a result, this research is about determining a solution for dynamic facility layout problem (DFLP) with equal departments by applying data envelopment analysis (DEA) with consideration of some specific criteria which are cost, adjacency, and distance requested. Cost as a negative criterion is minimized and used as an input, whereas adjacency and distance requested are considered positive criteria and used as output of DEA model. In the proposed algorithm, at first, the initial layout is generated, and then its neighborhood is created by the pair exchange and reverse strategy. By applying tabu search heuristic using diversification strategy which includes "frequency-based memory," "penalty function," and "dynamic tabu list size" to the DEA model, the most desired efficient layout is obtained. Two data sets taken from the relevant literature are used to test and evaluate the performance of the proposed heuristic. Computational experiments show that the proposed heuristic outperforms other heuristics presented in relevant literature, and the most efficient layout is achieved.
机译：设施布局问题（FLP）是一项经过精心研究的问题，它可以在工厂车间找到部门的位置，以使部门不重叠，并且可以优化FLP涉及的某些特定关键标准。此外，设施布局极大地影响了制造系统中物料搬运的效率。为了确保制造系统内的最佳性能，设施布局应反映整个时间的变化。但是，由于制造工厂是一个不断发展的动态系统，因此部门之间物料流动恒定的静态工厂布局问题可能不是现实的情况。另一方面，布局问题具有多目标性质，因此有必要应用各种标准和目标来确定良好的设施布局。因此，本研究旨在通过考虑数据，邻接和所需距离等一些特定标准，通过应用数据包络分析（DEA）确定具有相等部门的动态设施布局问题（DFLP）的解决方案。成本作为否定标准被最小化并用作输入，而所请求的邻接和距离被认为是肯定标准并被用作DEA模型的输出。在提出的算法中，首先生成初始布局，然后通过对交换和反向策略创建其邻域。通过使用包括“基于频率的内存”，“惩罚函数”和“动态禁忌列表大小”在内的多样化策略禁忌搜索试探法，将其应用于DEA模型，可获得最理想的有效布局。来自相关文献的两个数据集用于测试和评估所提出的启发式算法的性能。计算实验表明，提出的启发式算法优于相关文献中提出的其他启发式算法，并且实现了最有效的布局。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号