摘要
将求解指派问题的行列启发式算法应用于求解多传感器多目标数据互联的广义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.
出处
《兵工学报》
EI
CAS
CSCD
北大核心
2005年第5期629-633,共5页
Acta Armamentarii
基金
全国优秀博士论文作者专项基金资助项目(200237)
关键词
信息处理技术
分配问题
行列启发式算法
拉格朗日松弛算法
数据互联
information processing technique
assignment problem
row-column heuristic algorithm
Lagrangian relaxation algorithm
data association