基于業(yè)主視角的多模式項目支付進度問題及其啟發(fā)式算法
發(fā)布時間:2018-11-13 17:50
【摘要】:從業(yè)主的視角研究了活動具有多種執(zhí)行模式的項目支付進度問題.首先對所研究問題進行界定并定義文中所用到的符號;隨后構(gòu)建業(yè)主視角多模式項目支付進度問題的優(yōu)化模型,通過將其轉(zhuǎn)化為離散時間/費用權(quán)衡問題的子問題P_C|T,證明該問題為強NP-hard;基于這一結(jié)果,針對問題特征設(shè)計啟發(fā)式求解算法,通過在兩個模塊之間的模擬退火搜索迭代,獲得其滿意解;在40個隨機生成的標(biāo)準(zhǔn)算例上對算法進行測試,得到如下結(jié)論:算法可以在24.63秒內(nèi)求解所有的算例,滿意解對應(yīng)的目標(biāo)函數(shù)值與其上界的相對偏差不超過8.24%;隨著支付次數(shù)、折現(xiàn)率、承包商可接受最低利潤率及支付比例的上升,業(yè)主的項目凈現(xiàn)值下降.
[Abstract]:This paper studies the progress of project payment with multiple execution modes from the perspective of the owner. Firstly, we define the problems and define the symbols used in this paper. Then, the optimization model of multi-mode project payment schedule problem from owner's perspective is constructed. By transforming it into a sub-problem of discrete time / cost tradeoff problem (PC-T), it is proved that the problem is strong NP-hard;. Based on this result, a heuristic algorithm is designed to solve the problem features. The satisfactory solution is obtained by the simulated annealing search iteration between the two modules. The algorithm is tested on 40 randomly generated standard examples, and the following conclusions are obtained: the algorithm can solve all the examples in 24.63 seconds, and the relative deviation between the corresponding objective function value and its upper bound is not more than 8.24; With the increase in the number of payments, the discount rate, the contractor's acceptable minimum profit margin and the proportion of payments paid, the net present value of the employer's project falls.
【作者單位】: 西安交通大學(xué)管理學(xué)院;
【基金】:國家自然科學(xué)基金(70673077) 國家社會科學(xué)基金(07XJL002) 陜西省軟科學(xué)研究項目(2007KR56)
【分類號】:C935
本文編號:2329923
[Abstract]:This paper studies the progress of project payment with multiple execution modes from the perspective of the owner. Firstly, we define the problems and define the symbols used in this paper. Then, the optimization model of multi-mode project payment schedule problem from owner's perspective is constructed. By transforming it into a sub-problem of discrete time / cost tradeoff problem (PC-T), it is proved that the problem is strong NP-hard;. Based on this result, a heuristic algorithm is designed to solve the problem features. The satisfactory solution is obtained by the simulated annealing search iteration between the two modules. The algorithm is tested on 40 randomly generated standard examples, and the following conclusions are obtained: the algorithm can solve all the examples in 24.63 seconds, and the relative deviation between the corresponding objective function value and its upper bound is not more than 8.24; With the increase in the number of payments, the discount rate, the contractor's acceptable minimum profit margin and the proportion of payments paid, the net present value of the employer's project falls.
【作者單位】: 西安交通大學(xué)管理學(xué)院;
【基金】:國家自然科學(xué)基金(70673077) 國家社會科學(xué)基金(07XJL002) 陜西省軟科學(xué)研究項目(2007KR56)
【分類號】:C935
【共引文獻】
相關(guān)期刊論文 前1條
1 何正文;徐渝;;多模式項目支付進度的整合優(yōu)化研究[J];系統(tǒng)工程理論與實踐;2006年01期
相關(guān)博士學(xué)位論文 前1條
1 熊鷹;施工項目資源優(yōu)化配置理論和方法[D];北京交通大學(xué);2008年
,本文編號:2329923
本文鏈接:http://sikaile.net/guanlilunwen/glzh/2329923.html
最近更新
教材專著