首先界定研究假设条件并定义文中所使用的符号;随后从业主及承包商双重视角构建MPPSP的整数规划优化模型;针对问题的强NP—hard属性,设计禁忌搜索启发式算法;在随机生成的标准算例集合上对算法进行测试;最后用一个算例对研究结果进:行说明。结论如下:本文所开发的禁忌搜索启发式算法可以有效地求解MPPSP;关于给定项目的支付进度安排,承包商和业主的偏好存在显著差异;随着支付次数与支付比例的增加,承包商收益提高,业主收益下降,而双方收益均随折现率的上升而下降。
This paper identifies the assumptions of the study and defines the notations used in the paper at first. Then the integer programming optimization models of MPPSP are constructed from the perspectives of eontraetor and client respectively. For the strong NP-hardness of the problem, a tabu search heuristic is developed and tested on a standard data set generated randomly. Ultimately, an instance is given to illustrate the outcomes of the study. The conclusions of the paper are as follows: The proposed heuristic can solve MPPSP efficiently. For the project payment scheduling of a certain project, the preference of the contractor is quite different from that of the client. With the increase of the payment number and the payment proportion the profit of the contractor ascends while that of the client descends, and the profits of the two parties of the contract deerease as the interest rate per period goes up.