Improved Discrete PSO Algorithm Based on University Geographic Coordinates

摘要：

Studying the actual key university geographic coordinates in Xian,a discrete PSO algorithm model is made to solve TSP (Traveling Salesman Problem).An improved discrete PSO algorithm is been proposed.The average and optimal solution is counted in different iterations and number of particles in the PSO algorithm.The appropriate algorithm parameters are summed up.Experimental results demonstrate great practical and theoretical value of discrete PSO algorithm in solving the practical problem.

关键词： discrete PSO algorithm TSP problem algorithm parameters

作者: Xin Fang Fangxing Lv Shenghai Zhong

作者单位: Department of Electronic and Information Engineering Ankang University Ankang,China,725000

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 292-294

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