首页> 外文期刊>Automation in construction >Optimization of overlapping activities in the design phase of construction projects
【24h】

Optimization of overlapping activities in the design phase of construction projects

机译:在建设项目的设计阶段优化重叠活动

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

摘要

A well-known practice to accelerate construction projects is to overlap the design phase activities. For a typical construction project, a number of overlapping strategies exist during the design phase which all can result in timesaving. However, the cost of these strategies varies significantly depending on the total rework and complexity they generate. A favorable overlapping strategy is one that generates the required timesaving at the minimum cost. To find such a strategy, the question "Which activities have to be overlapped and to what extent to reduce the project duration at the minimum cost?" should be answered. This research aimed at answering the question through generating an overlapping optimization algorithm. The algorithm works based on the principles of genetic algorithms (GAs). The algorithm explained in the paper is unique compared to previous algorithms and frameworks available in the literature, as it can optimize multi-path networks and can handle all types of activity dependencies (i.e. finish-to-start, start-to-start, and finish-to-finish). It also takes both critical and non-critical activities into account and follows the critical path if the critical path changes or new critical paths emerge. A computer tool was also developed to run, examine and validate the overlapping optimization algorithm. This paper introduces the algorithm and the computer tool in detail and explains the results of their validation through optimizing a real-world project schedule. (C) 2015 Elsevier B.V. All rights reserved.
机译:加快建设项目的一种众所周知的做法是重叠设计阶段的活动。对于典型的建筑项目,在设计阶段存在许多重叠的策略,所有这些策略都可以节省时间。但是,这些策略的成本根据它们产生的总返工和复杂性而有很大差异。一种有利的重叠策略是一种以最小的成本节省所需时间的策略。要找到这样的策略,问题是“哪些活动必须重叠,以最小的成本在多大程度上减少项目工期?”应该回答。这项研究旨在通过生成重叠优化算法来回答问题。该算法基于遗传算法(GA)的原理工作。与以前的文献中可用的算法和框架相比,本文中介绍的算法是独特的,因为它可以优化多路径网络并可以处理所有类型的活动依赖项(即从头到尾,从头到尾和完成到完成)。它还考虑了关键和非关键活动,并且在关键路径发生变化或出现新的关键路径时遵循关键路径。还开发了一种计算机工具来运行,检查和验证重叠优化算法。本文详细介绍了算法和计算机工具,并通过优化实际项目进度表说明了其验证结果。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号