检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]烟台师范学院数学与信息学院 [2]海军航空工程学院信息融合研究所,山东烟台264001 [3]宁夏大学数学与计算机学院 [4]海军航空工程学院信息融合研究所
出 处:《兵工学报》2005年第5期629-633,共5页Acta Armamentarii
基 金:全国优秀博士论文作者专项基金资助项目(200237)
摘 要:将求解指派问题的行列启发式算法应用于求解多传感器多目标数据互联的广义3D分配问题松弛的2D子问题;针对3D分配算法计算量较大的问题提出一种改进算法.仿真结果表明,行列启发式算法不仅实施方便,而且程序运行时间较短.改进的3D分配算法既大幅度降低了3D分配问题的拉格朗日松弛算法的程序运行时间,又可将目标互联准确率提高3%~5%.行列启发式算法与改进的3D分配问题算法联合使用,可进一步减少改进3D分配算法的运算量,使其能更好地适应工程实际应用的需要.The row-column heuristic algorithm of 2D assignment problem was proposed by the author recently. This paper focuses on applying it to solve the relaxed 2D problem of a generalized 3D assignment problem. Furthermore, a modified algorithm was presented to reduce the large quantity of calculation in application of the former 3D assignment algorithm. Simulation result shows that the row-column heuristic algorithm for 2D assignment problem is easy to implement, and its run time is lower. The proceeding time of the modified algorithm of 3D assignment problem is largely reduced, and the accuracy of data association can be improved by 3 % - 5 %. The run time of the modified algorithm of 3D assignment algorithm can be further decreased when it is used with the row-column heuristic algorithm together, therefore the combined algorithm can meet the engineering requirements well.
关 键 词:信息处理技术 分配问题 行列启发式算法 拉格朗日松弛算法 数据互联
分 类 号:TN95[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222