The Research on Maneuvering Multiple Targets Data Association Problem with Genetic Simulated Annealing Algorithms

When it is represented as a sort of constraint combinational optimization problem , the data association problem of maneuvering multiple targets can be studied by genetic-simulated annealing algorithms which can greatly improve the tracking multi-maneuvering targets precision reliability of the system in higher dense multi-return environment. The simulation results indicates that genetic-simulated annealing algorithm is obviously superior to genetic algorithm and simulated annealing algorithm used separately.