Abstract: Ant Colony Algorithm (ACA) is a Travelling Salesman Problem (TSP) to effectively solve the combination optimization. However, with the increased scale of TSP, traditional ACA has failed to effectively solve a large-scale TSP. The paper proposes a solving method based on Improved AP Ant Colony Algorithm (IAPACA) for large-scale TSP. With the AP clustering, the TSP is divided into sub-problems, for which the optimal solution is sought. Then the consequence of the problem is acquired through combination of the sub-problems with improved scheme. Finally an experiment simulation for test calculating example from TSPLIB standard library is conducted. The experimental results show that IAPACA has better effect than that of the traditional ACA.

Key words: large-scale TSP problem, ant colony algorithm, AP clustering, integration scheme, quality of solution