- Title
- State transition algorithm for traveling salesman problem
- Creator
- Yang, Chunhua; Tang, Xiaolin; Zhou, Xiaojun; Gui, Weihua
- Date
- 2012
- Type
- Text; Conference proceedings
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/35243
- Identifier
- vital:4908
- Identifier
- http://www.scopus.com/inward/record.url?eid=2-s2.0-84873539183∂nerID=40&md5=b6ad9043aac300da632ffe51216dabbf
- Abstract
- 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. © 2012 Chinese Assoc of Automati.
- Publisher
- Hefei Chinese Assoc. of Automati
- Rights
- 2012 Chinese Assoc of Automati
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- Shift; State Transition Algorithm; Swap; Symmetry; Traveling Salesman Problem
- Full Text
- Hits: 958
- Visitors: 978
- Downloads: 59
Thumbnail | File | Description | Size | Format | |||
---|---|---|---|---|---|---|---|
View Details Download | SOURCE1 | Published version | 126 KB | Adobe Acrobat PDF | View Details Download |