一种求解多模式项目支付进度问题的双模块模拟退火启发式算法

被引:3
作者
何正文
徐渝
贾涛
机构
[1] 西安交通大学管理学院
关键词
支付进度安排; 优化模型; 解空间规模; 模拟退火; 算法测试;
D O I
暂无
中图分类号
F224 [经济数学方法];
学科分类号
0701 ; 070104 ;
摘要
给出多模式项目支付进度问题的优化模型;随后对问题的解空间规模进行了分析,推断出解空间规模随项目活动数的增加呈指数形式增长的结论;鉴于这一结论,设计了由支付事件集合搜索模块和事件进度搜索模块构成的双模块模拟退火启发式算法;最后用从经典文献及实际中获得的代表性算例对算法进行了测试,结果满意。
引用
收藏
页码:109 / 113
页数:5
相关论文
共 12 条
[1]  
A n equ itab le approach to thepaym en t schedu ling prob lem in pro ject m anagem en t. U lusoy U,C ebe lli S. European Journa l of O perationa l R esearch . 2000
[2]  
S tatistica l dependence in riskana lys is for pro ject netw orks us ing M on te C arlom ethods. D orp V,Du ffey M. In ternationa l Journa l of P roductionE conom ics . 1999
[3]  
T hed iscrete tim e-cost tradeoff prob lem rev is ited. P rabuddha D,Jam es D,Jaym G,CharlesW. European Journa l of O perationa l R esearch . 1995
[4]  
N on linear tim e/cost tradeoff m ode ls in pro jectm anagem en t. R ichard D,John H,W illiam V,H enn ing G,Satya V. Com pu ter and Industria lEng ineering . 1995
[5]  
O n m ode ling progresspaym en ts in pro ject netw orks. D ayanand N,Padm an R. Journa l of theO perationa l R esearch Soc iety . 1997
[6]  
O ptim a l procedures for the d iscrete tim e/costtrade-off prob lem in pro ject netw orks. D em eu lem eester E,H erroe len W,E lm aghraby S. European Journa l of O peration R esearch . 1996
[7]  
A fuzzy pro ject schedu ling approach tom in im ize schedu le risk for product deve lopm en t. Ju ite W. Fuzzy Sets and Systems . 2002
[8]  
O n paym en t schedu les incon tractor clien t negotiations in pro jects:anoverv iew of the prob lem and research issues. D ayanand N,Padm an R. P ro ject schedu ling:recen t m ode ls,a lgorithm s and app lications . 1999
[9]  
Four paym en t m ode lsfor the m u lti-m ode resource constra ined pro jectschedu ling prob lem w ith d iscoun ted cash flow s. U lusoy G,Funda S,Sah in S. Annals of Operations Research . 2001
[10]  
A tw o stage searchheuristic for schedu ling paym en ts in pro jects. D ayanand N,Padm an R. Annals of Operations Research . 2001