The application of several meta-heuristic in DGPS integer ambiguity resolution

In this paper, several meta-heuristic, includes Crossover Tabu Search (CTS), Tabu Search (TS), Genetic Algorithm (GA) and Ant Colony System (ACS) are applied for the integer ambiguity-searching problem (IASP). Given the baseline, those meta-heuristic are proposed to search optimal solution in integer ambiguity space, which is deduced by solving the resolution of GPS (Global Positioning System) double-differential integer ambiguity based on null-space restriction, and by eliminating the correlation of the float solutions successively. The crossover operator of the genetic algorithm is used as the diversification strategy of the CTS. Three criterions, searching efficiency, searching reliability and running time, are used to evaluate these algorithms. The resolution of a practical measurement example proves that the performances of the CTS is better than the other algorithms in the IASP, and the CTS can get better results with less calculation time.