针对建设工程类项目中进行时间费用权衡的现实需求,以及资源转移成本对逻辑关系的固有影响,提出综合考虑施工顺序可变以及允许多施工组同时施工的软逻辑关系模型,同时引入资源转移对逻辑关系的选择进行限制,以工期和费用的双目标权衡为...针对建设工程类项目中进行时间费用权衡的现实需求,以及资源转移成本对逻辑关系的固有影响,提出综合考虑施工顺序可变以及允许多施工组同时施工的软逻辑关系模型,同时引入资源转移对逻辑关系的选择进行限制,以工期和费用的双目标权衡为目标构建问题数学模型(comprehensive soft-logic scheduling problem of repetitive projects with resource transfer,CSLSPRPRT)。针对引入软逻辑带来的复杂性提升,以及静态拥挤度选择方法的固有缺陷,设计基于个体多样性自适应和动态拥挤度的改进遗传算法(NSGA-Ⅱ/IDDC)。仿真实验结果表明,该方法能在不同规模的实际场景下优化项目工期和费用,改进后算法能获得更多的可行解数量和更好的算法收敛性。展开更多
Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff...Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff problem(TCTP). Simplifying TCTP is a simple path problem in a critical path method(CPM) network. The authors transform TCTP into a simple activity float problem and design a complex polynomial algorithm for its solution. First, the authors discover relationships between activity floats and path lengths by studying activity floats from the perspective of path instead of time.Second, the authors perform simplification and improve the efficiency and accuracy of the solution by deleting redundant activities and narrowing the duration intervals of non-redundant activities. Finally,the authors compare our method with current methods. The relationships between activity floats and path lengths provide new approaches for other path and correlative project problems.展开更多
文摘针对建设工程类项目中进行时间费用权衡的现实需求,以及资源转移成本对逻辑关系的固有影响,提出综合考虑施工顺序可变以及允许多施工组同时施工的软逻辑关系模型,同时引入资源转移对逻辑关系的选择进行限制,以工期和费用的双目标权衡为目标构建问题数学模型(comprehensive soft-logic scheduling problem of repetitive projects with resource transfer,CSLSPRPRT)。针对引入软逻辑带来的复杂性提升,以及静态拥挤度选择方法的固有缺陷,设计基于个体多样性自适应和动态拥挤度的改进遗传算法(NSGA-Ⅱ/IDDC)。仿真实验结果表明,该方法能在不同规模的实际场景下优化项目工期和费用,改进后算法能获得更多的可行解数量和更好的算法收敛性。
基金supported by the Science and Technology Foundation of Jiangxi Provincial Department of Education in China under Grant No.GJJ161114the Natural Science Foundation of China under Grant No.71271081the Soft Science Research Base of Water Security and Sustainable Development of Jiangxi Province in China
文摘Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff problem(TCTP). Simplifying TCTP is a simple path problem in a critical path method(CPM) network. The authors transform TCTP into a simple activity float problem and design a complex polynomial algorithm for its solution. First, the authors discover relationships between activity floats and path lengths by studying activity floats from the perspective of path instead of time.Second, the authors perform simplification and improve the efficiency and accuracy of the solution by deleting redundant activities and narrowing the duration intervals of non-redundant activities. Finally,the authors compare our method with current methods. The relationships between activity floats and path lengths provide new approaches for other path and correlative project problems.
