基于蒙特卡罗方法的大型网络计划工期固定-资源均衡优化  

Resource-Leveling Optimization with Fixed Duration for a Large Network Plan Based on the Monte Carlo Method

作　　者：张厚先[1] 

机构地区：[1]南京工程学院建筑工程学院

出　　处：《施工技术》2015年第18期81-85,共5页Construction Technology

基　　金：住房和城乡建设部科学技术项目(2014-K3-039)

摘　　要：大型网络计划工期固定-资源均衡优化是进度计划制定者最具挑战性的任务之一。大型网络计划工期固定-资源均衡优化是工作数较多(例如超过50个)的网络计划满足工期固定的情况下的资源均衡。提出了基于蒙特卡罗方法的分区优化求解大型网络计划工期固定-资源均衡优化问题,用工作最早开始时间和最迟完成时间、以分区内可能解的组合数小于微机有效处理循环次数为限,把大型网络计划的工作划分到足够多的分区,以减少分区内各工作满足某一条件的可能解组合个数,减少在全工期时段上满足工期固定和资源均衡的可能解组合个数,从而便于微机用蒙特卡罗方法、以有限的循环次数和较高的优化解使最优解的概率得到大型网络计划的工期固定-资源均衡优化的解。基于蒙特卡罗方法的分区优化求解工期固定-资源均衡优化,通过了具有61个工作的大型网络计划工期固定-资源均衡优化算例验证。Resource-leveling optimization with fixed duration for a large network plan is one of the most challenging tasks of construction project planners. Resource-leveling optimization with fixed duration for a large network plan whose works number is more（ such as more than 50） requires minimization of total project duration while considering issues related to optimal resource leveling. The partition optimization of resource-leveling optimization with over a fixed duration for large network plans based on the Monte Carlo method is put forward. With a limitation on the number of possible solutions to the partition,the work of a large network plan is partitioned according to the earliest start time and the latest finish time. Partition optimization is used to reduce the searching scope of possible solutions over the time period of full duration. Possible solutions are selected at random using the Monte Carlo method. Using resource range as the criterion of partition optimization and using resource range and fixed duration as criteria of global optimization,the conditions of limited cycles of the microcomputer are met. It is highly likely that the optimized solution is the optimal solution. The results of numerical examples prove that the optimization effect is evident. The partition optimization of resource-leveling optimization with a fixed duration for a large network plan based on the Monte Carlo method is verified by a optimization example of a large network plan whose works number is 61.

关 键 词：项目管理 大型网络计划 蒙特卡罗方法 分区优化 循环次数 

分 类 号：TU721.3[建筑科学—建筑技术科学] C931.2[经济管理—管理学]