Colony optimization algorithm applied to simplification of closed linear objects

In map generalization, it is important to simplify closed linear objects. In fact, an area object can be represented by its boundary in vector, such as lakes, land use, etc. So shape simplification of area objects can make full use of the algorithms for simplifying closed linear objects. According to the purpose of simplification for boundary line of land use, the standards on map production and basic principles of ant colony optimization algorithm, the simplification of closed linear objects is explained as a kind of combinatorial optimization problem. The algorithm of automated simplification using ant colony optimization algorithm is put forward and the key steps are given. The algorithm not only sets up objective function, constraints, heuristic information, pheromones and so on, but also introduces long-term taboo list with the idea of tabu search algorithm is merged into the simplification of linear objects. In order to demonstrate that the proposed algorithm to the automatic simplification of closed linear objects is feasible and effective, the algorithm will be tested for boundary line of forest land, and the results will be compared with the Douglas algorithm.