...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Automation in construction >A new tabu search-based hyper-heuristic algorithm for solving construction leveling problems with limited resource availabilities
【24h】

A new tabu search-based hyper-heuristic algorithm for solving construction leveling problems with limited resource availabilities

机译：一种新的基于禁忌搜索的超启发式算法，用于解决资源有限的施工平整问题

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

摘要

We present a tabu search-based hyper-heuristic algorithm for solving construction resource leveling problems, i.e. resource leveling under resource constraints with the prescribed maximum project duration to be equal or greater than the initial/minimum duration, as well as the related resource availability cost problem. The algorithm operates within a commercial project management software package by altering the priorities assigned to activities. The hyper-heuristic controls a set of low-level heuristics, which modify the priorities of selected activities by performing simple moves such as "replace" and "swap". The most promising heuristics according to their efficiency are applied first, and a tabu list is used to prohibit heuristics with recently poor performance from being applied too soon. The application of the algorithm in three project cases showed that the proposed procedure is promising for handling resource optimization problems.
机译：我们提出了一种基于禁忌搜索的超启发式算法，用于解决建筑资源平整问题，即在资源限制条件下的资源平整（规定的最大项目工期等于或大于初始/最小工期）以及相关的资源可用性成本问题。该算法通过更改分配给活动的优先级在商业项目管理软件包中运行。超启发式方法控制一组低级启发式方法，这些方法通过执行简单的动作（例如“替换”和“交换”）来修改选定活动的优先级。首先根据其效率使用最有前途的启发式方法，并使用禁忌表禁止过早使用性能较差的启发式方法。该算法在三个项目案例中的应用表明，所提出的程序对于处理资源优化问题是有希望的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号