研究了基于不同支付规则的多模式项目支付进度问题.首先对所研究问题进行界定;在此基础上构建不同支付规则下的多模式项目支付进度优化模型,证明问题的强NP-hard属性;随后设计模拟退火及禁忌搜索两种启发式求解算法;在随机生成的标准算例集合上对算法进行比较测试,分析关键参数对目标函数的影响.结果表明:该文所开发的模拟退火启发式算法的求解质量要优于禁忌搜索启发式算法,而且这种优势随算例规模的增大而增加;此外,承包商收益随着支付次数与支付比例的增加而增加,随着折现率的提高而减小;基于时间、进展和费用支付规则下的满意解的目标函数值不超过基本支付规则下的对应值. This paper studies the payment schedule problem of multi-modal projects based on different payment rules.Firstly, the problem under study is defined.On this basis, a multi-modal payment progress optimization model under different payment rules is constructed to prove the strong NP-hard property of the problem. Design simulated annealing and tabu search two kinds of heuristic solving algorithms; compare and test the algorithm on the randomly generated set of standard examples, and analyze the influence of the key parameters on the objective function.The results show that the simulated annealing heuristic algorithm developed in this paper The quality of solution is better than that of tabu search heuristics, and this advantage increases with the scale of the example. In addition, the contractor’s income increases with the increase of payment times and payment ratio. As the discount rate increases And the objective function value based on the satisfactory solution under the time, progress and expense payment rules does not exceed the corresponding value under the basic payment rules.