A CGS-MSM PGA based on Multi-Agent and its application in solving TSP

摘要：

TSP(Traveling Salesman Problem) is a typical combinational optimization problem. At present, there are a lot of methods to solve this problem, but with the increase of the scale of this problem, most methods face the difficult problem of combination exploding. This paper combines Multi-Agent theory and CGS MSM PGA(coarse grain size-master slaver model parallel genetic algorithm) together,propose one improvement CGS-MSM PGA based on Multi-Agent, then use this PGA to solve TSP. This PGA is made up of many Agent, solves the TSP by the coordination between many Agents inside the Multi-Agent system. The introduction of Multi-Agent theory, make the master course and slave course of CGS-MSM PGA to be made of Agent, so the ability of communication and coordination raise greatly, thus can not only overcome the shortcoming of original CGS-MSM PGA, but also utilize its advantage at large, so can solve the problem combination exploding brought by the scale of TSP increases.

作者: Tinghong Zhao Zibin Man Xueyi Qi

作者单位: College of Fluid Power and Control Engineering,Lanzhou University of Technology, Gansu, China, 730050

会议类型: 国际会议

会议名称: International Conference on Intelligent Computation Technology and Automation(2008 智能计算技术与自动化国际会议 ICICTA 2008)

会议地点: 长沙

会议语种:英文

页码: 2088-2092

在线出版日期: 2008-10-20（万方平台首次上网日期，不代表论文的发表时间）