Abstract: 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.

Key words: information processing technique , assignment problem , row-column heuristic algorithm , La- grangian relaxation algorithm , data association