首页> 外文会议>Online World Conference on Soft Computing in Industrial Applications >Solving Facility Layout Problems with a Set of Geometric Hard-constraints using Tabu Search
【24h】

Solving Facility Layout Problems with a Set of Geometric Hard-constraints using Tabu Search

机译:使用禁忌搜索,解决一组几何硬度约束的设施布局问题

获取原文

摘要

This paper approaches a computational solving of the industrial layout problem considering a set of hard-constraints not handled in previous works. The intention here has been to provide a new consistent benchmark problem that may help researchers to test their proposed algorithms. In order to handle the experiments, the computational optimization tool AVOLI (Visual Environment for Industrial Layout Optimization) is utilized. By using this computational tool, the provided hypothetic new facility layout problem mimicking a real one is solved in two steps: first a constructive-heuristic-based initial solution is generated and then Tabu Search (TS) heuristic is used to improve it.
机译:考虑到在以前的作品中未处理的一组硬度限制,本文涉及工业布局问题的计算解决。这里的意图是提供了一个新的一致基准问题,可以帮助研究人员测试其所提出的算法。为了处理实验,利用计算优化工具Avoli(用于工业布局优化的可视环境)。通过使用该计算工具,分两步解决了模仿真实的新设施布局问题:首先生成建设性 - 启发式的初始解决方案,然后使用禁忌搜索(TS)启发式来改进它。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号