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.

• 摘要利用混沌运动的遍历性、随机性和规律性等特点，提出了一种求解旅行商问题的混沌蚁群(CACO)算法。