重复性项目调度中时间费用权衡优化研究

发布时间：2018-02-21 18:19

本文关键词： 重复性调度项目控制路线连续性约束遗传算法　出处：《华北电力大学》2012年硕士论文　论文类型：学位论文

【摘要】：时间-费用权衡问题中最基本的调度目标是：总资源给定的条件下使项目的工期最短(项目预算问题),或在给定项目工期的条件下使项目的总成本最小(工期底线问题)。对于重复性建设项目来说,项目调度的目标也可以归结为这两种。时间-费用权衡问题一般是多模式选择问题,既每个工序都有多种执行方式可供选择,不同的执行方式对应不同工期和费用。项目的时间-费用权衡的优化过程就是对执行模型的重新组合过程,这类问题属于Np-hard问题。因此本文利用智能优化算法来实现对时间-费用权衡问题的优化过程。在项目调度中,控制路线决定了项目的总工期,而之前的确定控制路线的方法存在不同程度的缺点和不足,本文首先重新定义了控制路线的概念,制定了确定控制路线的方法,使得控制路线的确定过程更加准确,更加符合实际要求。并且重重新区分了工序连续与不连续、资源连续与不连续利用的约束情况。分析了工序系间存在优先约束关系、资源连续性约束、工序系连续性约束等情况下的工期计算过程和方法。为实现重复性调度问题的时间和费用的优化,文中分别叙述了RSM问题的时间和费用模型。时间模型主要针对工序工期的计算,时间约束的计算等。费用模型主要包括材料费用、劳动力费用、设备费用和总费用等。依据实际需要,将时间-费用权衡问题的分为两种模型：工期确定下计算最小费用、费用确定下计算最小工期。而对于计算过程中工序数量庞大、工序间约束关系众多的问题,本文采用遗传算法来求解该问题。遗传算法不仅运算速度快,而且能够求解多目标问题。该模型为重复性项目调度问题的执行者提供了方便有效的时间-费用权衡优化方法,文章最后例举了一项桥梁施工过程的计算实例,并且利用遗传算法进行求解。
[Abstract]:The most basic scheduling goal in the time-cost tradeoff problem is to make the project's duration the shortest (project budget problem) or the project's total cost (the end of the project period) when the total resources are given. For repetitive construction projects, The goal of project scheduling can also be attributed to these two kinds. The time-cost tradeoff problem is generally a multi-mode selection problem, in which there are many execution modes for each process. Different execution modes correspond to different duration and cost. The optimization process of time-cost tradeoff of the project is the recombination of the execution model. This kind of problem belongs to Np-hard problem. Therefore, this paper uses intelligent optimization algorithm to realize the optimization process of time-cost tradeoff problem. In project scheduling, the control route determines the total duration of the project. However, the previous method of determining control route has some shortcomings and shortcomings. Firstly, the concept of control route is redefined and the method of determining control route is established, which makes the process of determining control route more accurate. Moreover, the constraints of continuous and discontinuous processes, continuous and discontinuous utilization of resources are divided into many new areas. The procedure and method of time limit calculation under the condition of continuity constraint. In order to optimize the time and cost of the repetitive scheduling problem, the time and cost models of the RSM problem are described in this paper. The cost model includes material cost, labor cost, equipment cost and total cost etc. According to the actual need, the time-cost tradeoff problem is divided into two models: calculating the minimum cost under the fixed time limit. For the problem of large number of processes and numerous constraints between processes, genetic algorithm is used to solve the problem. The genetic algorithm is not only fast, but also can be used to solve the problem. The model provides a convenient and effective time-cost tradeoff optimization method for the operators of repetitive project scheduling problems. At the end of this paper, an example of bridge construction process is given. Genetic algorithm is used to solve the problem.
【学位授予单位】：华北电力大学
【学位级别】：硕士
【学位授予年份】：2012
【分类号】：F062.4

【相似文献】