基于不同支付规则的MPPSP及其模拟退火与禁忌搜索算法

发布时间：2018-05-02 18:09

本文选题：多模式项目支付进度安排 + 支付规则　；参考：《系统工程理论与实践》2010年08期

【摘要】：研究了基于不同支付规则的多模式项目支付进度问题.首先对所研究问题进行界定;在此基础上构建不同支付规则下的多模式项目支付进度优化模型,证明问题的强NP-hard属性;随后设计模拟退火及禁忌搜索两种启发式求解算法;在随机生成的标准算例集合上对算法进行比较测试,分析关键参数对目标函数的影响.结果表明:该文所开发的模拟退火启发式算法的求解质量要优于禁忌搜索启发式算法,而且这种优势随算例规模的增大而增加;此外,承包商收益随着支付次数与支付比例的增加而增加,随着折现率的提高而减小;基于时间、进展和费用支付规则下的满意解的目标函数值不超过基本支付规则下的对应值.
[Abstract]:This paper studies the payment schedule of multi-mode projects based on different payment rules. Firstly, the problem is defined; on the basis of this, the multi-mode project payment schedule optimization model under different payment rules is constructed to prove the strong NP-hard attribute of the problem, and then two heuristic algorithms, simulated annealing and Tabu search, are designed. The algorithm is compared and tested on the set of randomly generated standard examples, and the influence of key parameters on the objective function is analyzed. The results show that the quality of simulated annealing heuristic developed in this paper is better than that of Tabu search heuristic, and this advantage increases with the increase of example size. The contractor's income increases with the increase of the number of payments and the proportion of payments, and decreases with the increase of the discount rate. The objective function value of the satisfactory solution based on the time, progress and expense payment rules does not exceed the corresponding value under the basic payment rule.
【作者单位】：西安交通大学管理学院;
【基金】：国家自然科学基金(70971105) 国家社会科学基金(07XJL002) 陕西省自然科学基金(2009JM9001) 陕西省软科学研究计划项目(2008KR11)
【分类号】：C935

【参考文献】