华中科技大学学报（自然科学版）2024，Vol.52Issue(11)：147-152,160,7.DOI:10.13245/j.hust.240405
基于结构矩阵求解双代号网络计划的改进算法
Improved algorithm for solving activity-on-arc network planning based on structure matrix
摘要
Abstract
To enhance the versatility and computational efficiency of algorithms for solving the activity-on-arc network planning,the principles of two computer algorithms,which were the algorithm based on edge set array(EA-A)and the algorithm based on structure matrix(SM-A),were initially studied.Then,an improved algorithm(SM-A1)and corresponding Python programming guidelines were proposed.Finally,combined with examples,Python programs were developed to validate the versatility of SM-A1,and performance comparisons of the three algorithms' programs were conducted.It is confirmed that SM-A1 could accurately compute the activity-on-arc network planning after the conversion of overlapping relationships.Performance analysis results show that the computational efficiency of SM-A's Python program is lower than that of EA-A's,primarily due to its increased invocation of third-party functions during matrix operations.The time complexity and third-party function calls of SM-A1's Python program could be reduced by optimizing the algorithm's search ranges and improving the programming guidelines,which could significantly enhance the efficiency in solving time parameters and critical paths of the activity-on-arc network planning.关键词
双代号网络计划/结构矩阵/Python编程规则/时间参数/关键路径Key words
activity-on-arc network planning/structure matrix/Python programming guidelines/time parameters/critical paths分类
信息技术与安全科学引用本文复制引用
李昊翔,侯公羽,陈钦煌,刘冬桥..基于结构矩阵求解双代号网络计划的改进算法[J].华中科技大学学报（自然科学版）,2024,52(11):147-152,160,7.基金项目
国家自然科学基金资助项目(52074299). （52074299）
