...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>European Journal of Operational Research >STaTS: A Slicing Tree and Tabu Search based heuristic for the unequal area facility layout problem
【24h】

STaTS: A Slicing Tree and Tabu Search based heuristic for the unequal area facility layout problem

机译：站点：基于切片树和禁忌搜索的启发式方法，用于不等面积的设施布局问题

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

摘要

In this paper, a slicing tree based tabu search heuristic for the rectangular, continual plane facility layout problem (FLP) is presented. In addition to the incorporation of facilities with unequal areas we also inte_grate the possibility to specify various requirements regarding (rectangular) shape and dimensions of each individual facility by using bounding curves. Therefore, it is possible to solve problems containing facilities of fixed and facilities of flexible shapes at the same time. We present a procedure that calculates the layout corresponding to a given slicing tree on the basis of bounding curves. These layouts are slicing structures which are able to contain empty spaces to guarantee that stringent shape restrictions of facil_ities are kept. Due to these features this approach is better suited for practical use than so far existing ones. The effectiveness of our approach in terms of objective function value is shown by comparing our results to those found in the literature. Even a large problem instance comprised of 62 facilities has been solved.
机译：在本文中，提出了一种基于切片树的禁忌搜索启发式算法，用于矩形，连续平面设施布局问题（FLP）。除了合并具有不相等面积的设施外，我们还集成了使用边界曲线来指定有关每个设施的（矩形）形状和尺寸的各种要求的可能性。因此，可以解决包含固定形状的设备和柔性形状的设备的问题。我们提出了一种基于边界曲线来计算与给定切片树相对应的布局的过程。这些布局是切片结构，它们可以包含空白空间，以确保保留对设施的严格形状限制。由于具有这些功能，因此该方法比现有方法更适合实际使用。通过将我们的结果与文献中的结果进行比较，可以证明我们的方法在目标函数值方面的有效性。甚至解决了由62个设施组成的大型问题实例。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号