中文摘要：

基于蚁群优化算法的基本原理，分析线状目标简化过程中所需满足的约束条件，建立具体的算法设计模型，并引入长期禁忌表和局部搜索策略以提高算法的运算效率，给出解题的关键步骤。最后对该算法进行测试，简化结果表明将蚁群优化算法用于线状目标的简化，能较好地保持线状目标的几何形状特征，在顾及长度偏差和矢量偏差的同时有较高的压缩率。与道格拉斯算法简化结果对比表明，在相同的几何限差内蚁群优化算法所得目标函数值更佳。

英文摘要：

According to the purpose for simplifying linear objects, the standards on map production and the basic principles of ant colony optimization algorithm, the simplification of linear objects is explained as a kind of combinatorial optimization problem, and the constraints that should be satisfied in the simplifying process are described by mathematical formulae at first. Then a model of automated simplification using ant colony optimization algorithm is put forward in detail and the key steps are given. In order to improve operational efficiency of the algorithm, long-term taboo list and the local search strategy are introduced. Finally, the algorithm is tested and compared with Douglas algorithm, the results demonstrate that the proposed model to the automatic generalization of linear objects is feasible and effective, and the objective function values obtained from ACO algorithm are better within the same geometric tolerance. Using the proposed algorithm the basic geometric characteristics of linear objects are maintained, and a higher compression ratio is achieved while taking into account length deviation and vector deviation.