考虑次关键路线的基于粒子群算法工期-费用优化研究  

Study on Optimization of Time-cost Based on Particle Swarm Optimization with Considering Secondary Critical Path

作　　者：贾正源[1] 宫立华[1] 

机构地区：[1]华北电力大学经济管理系,河北保定071003

出　　处：《技术经济》2008年第10期69-73,共5页Journal of Technology Economics

摘　　要：工期-费用优化是网络优化技术的核心内容。传统的工期-费用优化研究忽略了次关键路线、资源约束条件对工期压缩的影响。本文研究了次关键路线对工期压缩的影响,描述了求解最低压缩成本的特征路线法,并以此为基础建立了有资源约束的工期-费用优化数学模型。对解进行编码处理后,采用粒子群算法对工期—费用优化模型进行求解,并根据求得的最优解来调整工序工期,最终实现工期-费用的最优化。最后,经过工程实例的仿真,证明了模型的合理性和有效性。The time-cost optimization is the core of network plan. However,the traditional study on optimization of time-cost neglectes the im pact of secondary critical path and resource constraint on time compression. This paper studies the impact of secondary critical path on time compression ,and describes the characteristic path method for solving the optimal cost of compression. Based on this method, it establishes the mathematical model on time cost with resource constraint. After coding for solution,it uses the particle swarm optimization to solve this model, and then adjusts the time of working procedure to obtain the optimum time cost according to the optimal solution. Finally, through the simulation of project example, it verifies the rationality and effectiveness of this model.

关 键 词：网络计划图 工期-费用优化 柱子群算法 次关键路线 

分 类 号：TP399-C2[自动化与计算机技术—计算机应用技术]