CAJ | 학술논문

研究了基于不同支付规则的多模式项目支付进度问题.首先对所研究问题进行界定;在此基础上构建不同支付规则下的多模式项目支付进度优化模型,证明问题的强NP-hard属性;随后设计模拟退火及禁忌搜索两种启发式求解算法;在随机生成的标准算例集合上对算法进行比较测试,分析关键参数对目标函数的影响.结果表明：该文所开发的模拟退火启发式算法的求解质量要优于禁忌搜索启发式算法,而且这种优势随算例规模的增大而增加;此外,承包商收益随着支付次数与支付比例的增加而增加,随着折现率的提高而减小;基于时间、进展和费用支付规则下的满意解的目标函数值不超过基本支付规则下的对应值.
연구료기우불동지부규칙적다모식항목지부진도문제.수선대소연구문제진행계정;재차기출상구건불동지부규칙하적다모식항목지부진도우화모형,증명문제적강NP-hard속성;수후설계모의퇴화급금기수색량충계발식구해산법;재수궤생성적표준산례집합상대산법진행비교측시,분석관건삼수대목표함수적영향.결과표명：해문소개발적모의퇴화계발식산법적구해질량요우우금기수색계발식산법,이차저충우세수산례규모적증대이증가;차외,승포상수익수착지부차수여지부비례적증가이증가,수착절현솔적제고이감소;기우시간、진전화비용지부규칙하적만의해적목표함수치불초과기본지부규칙하적대응치.
This paper involves the multi-mode project payment scheduling problem based on different payment rules.Firstly the studied problem is identified and the optimization models under different payment rules are constructed.For the strong NP-hardness of the problem,two heuristic algorithms, namely simulated annealing and tabu search,are developed.The two algorithms are tested and evaluated on the basis of a computational experiment performed on a data set constructed by ProGen.The results show that the proposed simulated annealing heuristic algorithm outperforms the tabu search heuristic algorithm especially when the instances become larger.The objective value ascends with the increase of the payment number or the compensation proportion whereas descends as the interest rate per period goes up.Moreover,the desirable objective values under the time-based,progress-based,and expense-based rules cannot exceed those under the corresponding basic rule anyway.