当前位置:主页 > 科技论文 > 电气论文 >

资源约束下电力工程项目进度计划编排研究

发布时间:2018-05-06 08:04

  本文选题:电力工程 + 进度计划 ; 参考:《华北电力大学(北京)》2017年硕士论文


【摘要】:随着国民经济的高速发展以及人民生活水平的不断提高,攀升的电力需求使电力建设不断加快。在大规模电力工程项目的投资建设活动中,有效的进度管理可以使项目早日投产运行并产生效益,同时还能很好地减少资金占用。而合理的项目进度计划是有效进行进度管理与控制的前提和保证。因此研究如何在施工过程中编制与优化施工进度计划,以实现均衡施工,达成工期最短具有重要的现实意义。由于其自身的特性,电力建设工程进度计划编排属于资源供给量随时间变化并存在资源窗口期且工序有多种执行模式的资源受限项目调度问题(RCPSP)。在目前RCPSP领域的研究中,任务拆分问题是一个研究热点。由于在进行进度计划编排时将任务进行拆分可以避免资源的脉冲式使用,使其投入更加均衡,因此无论对于以资源均衡还是工期最短为目标的RCPSP问题来说都有重要的意义。然而理论研究中能够使工期大幅缩减的任务拆分在工程实际中却难以得到施展,这是因为在实际工作中打断一个正在进行的工序意味着人员、材料、机械的转移与工作面的保护问题,在时间和费用上需要付出相应的代价,强行拆分工序的调度方案很可能在实际工作当中得不偿失。为了弥合这种理论与工程实际的脱节,本文将一种不会导致额外时间与费用代价的工序拆分形式从一般的工序拆分形式中分离出来,并将其定义为非占先工序拆分,方便与任意的占先工序拆分相对应。然后对比两种工序拆分形式在调度方案优化方面起到作用的大小。本文首先介绍了该论文的研究背景及意义,就国内外资源约束下项目调度问题的研究现状做了较为详细的综合论述。其次,阐述了项目进度计划优化的相关理论。在此基础上,从均衡施工的角度对占先拆分在工期优化中的作用进行了探讨。然后按照进度计划编排时允许进行工序占先拆分、只允许对工序进行非占先拆分、不允许进行工序拆分三种情况分别建立数学模型,并采用基于优先级的分支定界法来求解该问题,最后通过算例研究得到了三种任务拆分方式下电力工程项目施工进度的对比结果,并以某电力工程项目进度计划编排实例验证了本文所设计的电力工程项目进度计划编排模型与算法在解决此类问题时的有效性。
[Abstract]:With the rapid development of national economy and the continuous improvement of people's living standard, the rising power demand accelerates the electric power construction. In the investment and construction activities of large-scale electric power engineering project, effective schedule management can make the project put into operation as soon as possible and produce benefits, at the same time, it can also reduce the capital occupation. Reasonable project schedule is the premise and guarantee of effective schedule management and control. Therefore, it is of great practical significance to study how to draw up and optimize the construction schedule in the construction process in order to realize the balanced construction and achieve the shortest construction period. Because of its own characteristics, the scheduling of electric power construction project is a kind of resource constrained project scheduling problem with resource supply varying with time and resource window period, and the process has many execution modes. Task splitting is a hot topic in the field of RCPSP. Since splitting tasks can avoid the impulsive use of resources and make their input more balanced, it is of great significance to solve the problem of RCPSP which aims at resource balance or the shortest duration. However, in theoretical research, the task that can reduce the duration greatly is difficult to carry out in engineering practice, because interrupting an ongoing process in actual work means people, materials, The transfer of machinery and the protection of working face need to pay the corresponding cost in time and cost. The scheduling scheme of forced split process may outweigh the gain in actual work. In order to bridge the disconnection between this theory and engineering practice, this paper separates a kind of process separation form which does not lead to extra time and cost cost from the general process separation form, and defines it as non-preemptive process separation. Convenient and arbitrary preemptive process split corresponding. Then compare the size of the two kinds of process split in the optimization of scheduling scheme. This paper first introduces the research background and significance of this paper, and makes a detailed and comprehensive discussion on the research status of project scheduling problem under resource constraints at home and abroad. Secondly, the related theory of project schedule optimization is expounded. On this basis, the role of preemptive split in the optimization of construction period is discussed from the point of view of balanced construction. Then, according to the schedule schedule, it is allowed to split the process first, only to split the process without preemption, and not to set up the mathematical model of each of the three cases. The priority based branch and bound method is used to solve the problem. Finally, the comparison results of the construction schedule of power engineering projects under three different task splitting methods are obtained by a numerical example. The effectiveness of the proposed model and algorithm in solving this kind of problems is verified by an example of the scheduling of a power engineering project.
【学位授予单位】:华北电力大学(北京)
【学位级别】:硕士
【学位授予年份】:2017
【分类号】:TU722;TM7

【参考文献】

相关期刊论文 前7条

1 张松;陈华平;刘建;;复杂时间约束的水利工程项目调度问题研究[J];系统工程学报;2016年01期

2 杨波;万仲平;尹德玉;;资源约束项目排序问题的一种修正蚁群算法[J];工程数学学报;2007年03期

3 王巍;赵国杰;;粒子群优化在资源受限工程调度问题中的应用[J];哈尔滨工业大学学报;2007年04期

4 王宏;林丹;李敏强;;一种求解资源受限项目调度问题的自适应遗传算法[J];系统工程;2005年12期

5 郑超,高连生;蚁群算法在资源受限项目调度问题中的应用[J];计算机工程与应用;2005年27期

6 王振禄,蔡慧林;资源受限项目调度中基于邻域搜索的混合遗传算法[J];兰州交通大学学报;2005年03期

7 刘士新,王梦光,唐加福;一种求解资源受限工程调度问题的遗传算法[J];系统工程学报;2002年01期

相关博士学位论文 前1条

1 何立华;资源不确定条件下项目调度多目标优化研究[D];天津大学;2013年



本文编号:1851471

资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/dianlidianqilunwen/1851471.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户be426***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com