The Chinese Traveling Salesman Problem(CTSP)is one of combinatorial optimization problems, and is a NP. Based on Ant Colony Optimizations (ACOs), two improved versions of ACOs are proposed to solve this problem. One is Ant-F, in which systems search probability is increased to avoid premature. Such system with negative and positive feedback can be simply simulated and easily understood. The other is ACS+, which can be used to speed up systems convergence at the last stage of evolution by means of magnifying...