By use of the properties of ergodicity, randomicity, and regularity of chaos, a chaos ant colony optimization (CACO) algorithm is proposed to solve traveling salesman problem.