Abstract: This paper gives a mathematical model for solving travelling salesman problems on a cuboid and proposes an improved Ant Colony Optimization algorithom（ACO） to solve the travelling salesman problems on a cuboid.The improved algorithm can obtain the global optimal solution or an approximate solution which is greatly close to the optimal solution，and propose the high-quality solutions within shortest time.The experimental results demonstrate that this improved method has much higher convergence speed than that of the basic ant colony algorithm，and can jump over the region of the local minimum，and escape from the trap of a local minimum successfully.

Key words: global optimization, improved ant colony algorithm, path planning, cuboid, traveling salesman problem

摘要： 给出立体表面TSP问题的数学模型，提出一种改进的蚁群优化算法，用于解决立体表面TSP问题。该算法能快速找到最优路径或近似最优路径，得到的解质量较高且计算时间短。实验方法表明，改进后的蚁群算法在TSP的求解中，收敛速度和全局寻优能力均得到较大的提高。

关键词: 全局优化, 改进蚁群算法, 路径规划, 立方体, 旅行商问题