基于资金约束的项目支付进度问题研究  

Study of capital constraint based project payment scheduling problems

作　　者：何正文[1] 任世科[1] 徐渝[1] 

机构地区：[1]西安交通大学管理学院,陕西西安710049

出　　处：《系统工程学报》2012年第3期399-406,共8页Journal of Systems Engineering

基　　金：国家自然科学基金资助项目(70971105);陕西省自然科学基金资助项目(2009JM9001);中央高校基本科研业务费专项资金资助项目(Sk2010032)

摘　　要：研究资金约束下的项目支付进度安排问题,其中活动具有多种执行模式,目标是最大化项目净现值.首先界定研究假设条件并定义文中用到的符号;随后构建问题的非线性整数规划优化模型;针对其强NP-hard属性,设计三层迭代循环嵌套的禁忌搜索启发式算法;以多重迭代改进算法为对比基准,在随机生成的3240个标准算例上对算法进行测试,结果表明:禁忌搜索获得的满意解质量远高于多重迭代改进,但其计算时间要长于后者.该研究可为承包商安排项目进度及平衡现金流提供决策支持.This paper studies the capital constrained project payment scheduling problem,where activities are performed with several modes and the objective is to maximize the net present value of the project.The assumptions of the study are given and the notations used are defined at first.Then a nonlinear integer-programming model of the problem is constructed and aiming at its strong NP-hardness a tabu search heuristic algorithm composed of three nested iterative loops is developed.Taking the multiple iterative improvement algorithm as the comparison baseline,the tabu search heuristic algorithm is tested on a data set consisting of 3 240 standard instances generated randomly.The results indicate that the tabu search heuristic algorithm tends to obtain much better solutions but runs more slowly than the multi-start iterative improvement algorithm.

关 键 词：项目支付进度 资金约束 优化模型 禁忌搜索启发式算法 

分 类 号：C935[经济管理—管理学] F224.33