中文摘要：

旅行售货员问题(TSP ) 是一个古典优化问题；它是 NP 问题的一个班之一。这篇论文论述多说出的一个新方法代理人途径基于的基因算法；蚂蚁殖民地系统将解决 TSP。有不同功能的三种代理人在建筑学由这篇论文建议了的多代理人被设计。第一种代理人是蚂蚁殖民地优化代理人；它的函数连续地正在产生新解决方案。秒种代理人是选择代理人，转线路代理人；变化代理人，他们的功能正在优化当前的答案组。第三种代理人是快本地寻找代理人；它的函数从试用的开始正在优化最好的解决方案。在这篇论文的结束，试验性的结果证明了建议混合途径关于答案的质量有好性能；计算的速度。

英文摘要：

The traveling salesman problem （TSP） is a classical optimization problem and it is one of a class of NP- Problem. This paper presents a new method named multiagent approach based genetic algorithm and ant colony system to solve the TSP. Three kinds of agents with different function were designed in the multi-agent architecture proposed by this paper. The first kind of agent is ant colony optimization agent and its function is generating the new solution continuously. The second kind of agent is selection agent, crossover agent and mutation agent, their function is optimizing the current solutions group. The third kind of agent is fast local searching agent and its function is optimizing the best solution from the beginning of the trial. At the end of this paper, the experimental results have shown that the proposed hybrid ap proach has good performance with respect to the quality of solution and the speed of computation.