检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《系统工程》2006年第11期109-113,共5页Systems Engineering
基 金:国家社会科学基金资助项目(06CJY019);西安市软科学项目(HU06007-07)
摘 要:给出多模式项目支付进度问题的优化模型;随后对问题的解空间规模进行了分析,推断出解空间规模随项目活动数的增加呈指数形式增长的结论;鉴于这一结论,设计了由支付事件集合搜索模块和事件进度搜索模块构成的双模块模拟退火启发式算法;最后用从经典文献及实际中获得的代表性算例对算法进行了测试,结果满意。The optimal model of MPPSP is given firstly. Then the scale of MPPSP ,solution space is analyzed and the conclusion that with the increase of the number of project activities the ,solution space augments in an exponential manner is obtained. On account of this conclusion, a two-module simulated annealing heuristics (TMSAH) which is composed of the module of seeking for the satisfactory payment event set and the module of searching for the satisfactory event schedule is worked out. Ultimately TMSAH is tested with representative examples obtained from classical literatures or practice, showing that the quality of TMSAH can be acceptable.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.143