State transition algorithm for traveling salesman problem
Discrete version of state transition algorithm is proposed in order to solve the traveling salesman problem. Three special operators for discrete optimization problem named swap, shift and symmetry transformations are presented. Convergence analysis and time complexity of the algorithm are also considered. To make the algorithm simple and efficient, no parameter adjusting is suggested in current version. Experiments are carried out to test the performance of the strategy, and comparisons with simulated annealing and ant colony optimization have demonstrated the effectiveness of the proposed algorithm. The results also show that the discrete state transition algorithm consumes much less time and has better search ability than its counterparts, which indicates that state transition algorithm is with strong adaptability.
State Transition Algorithm Traveling Salesman Problem Swap Shift Symmetry
YANG Chunhua TANG Xiaolin ZHOU Xiaojun GUI Weihua
School of Information Science and Engineering, Central South University, Changsha 410083, P. R. Chin School of Information Science and Engineering, Central South University, Changsha 410083, P. R. Chin
国际会议
The 31st Chinese Control Conference(第三十一届中国控制会议)
合肥
英文
2481-2485
2012-07-01（万方平台首次上网日期，不代表论文的发表时间）