摘要
为了研究不同算法处理网络计划问题的效果与网络计划问题的特征之间的关系,在综合考虑网络图的拓扑结构、资源可替换性、截止日期等因素的基础上,提出了柔性资源约束下网络计划问题的复杂度特征指标,以及网络计划优劣的评价指标.利用多元回归分析技术研究了不同算法处理网络计划问题的效果与网络计划特征之间的关系.实验结果表明,提出的特征指标能很好地度量网络计划问题的复杂性,得到的回归方程也能比较准确的估计出算法的结果,为根据网络计划问题的特征选择合适的算法提供可靠依据.
To investigate the treatment effect of different algorithms on network planning problem, the coefficients of network complexity （CNC） and network evaluation indices are proposed, taking the topological structure, interchangeability of resource and due date of the network into consideration. And then the relationship between the effects of different algorithms and the characteristics of network is analyzed based on multiple regression technology. The experimental results show that the proposed coefficients of network complexity are reasonable and the regression equations can accurately estimate the results of the algorithms, so that useful information can be provided to select a proper algorithm based on the characteristics of network planning problem.
出处
《哈尔滨工业大学学报》
EI
CAS
CSCD
北大核心
2010年第3期418-423,共6页
Journal of Harbin Institute of Technology
基金
国家高技术研究发展计划资助项目(2008AA04Z401)
哈尔滨电机厂生产计划系统开发项目
关键词
网络计划
复杂度
回归分析
算法选择
network planning
complexity
regression analysis
algorithm selection
