- Title
- A discrete state transition algorithm for traveling salesman problem
- Creator
- Yang, Chunhua; Tang, Xiaolin; Zhou, Xiaojun; Gui, Weihua
- Date
- 2013
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/61409
- Identifier
- vital:5256
- Identifier
-
https://doi.org/10.7641/CTA.2013.12167
- Identifier
- ISSN:1000-8152
- Abstract
- A discrete version of state transition algorithm is proposed to solve the traveling salesman problem. Three special operators named swap, shift and symmetry transformations are presented for discrete optimization problem. Convergence analysis and time complexity of the algorithm are also considered. To make the algorithm efficient, a parametric study is investigated. Experiments are carried out to test its performance, 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 other traditional combinatorial optimization methods, indicating that state transition algorithm has strong adaptability.; C1
- Relation
- Kongzhi Lilun Yu Yingyong/Control Theory and Applications Vol. 30, no. 8 (2013), p. 1040-1046
- Rights
- Copyright South China University of Technology
- Rights
- This metadata is freely available under a CCO license
- Subject
- Combinatorial optimization; Parametric study; State transition algorithm; Traveling salesman problem
- Reviewed
- Hits: 860
- Visitors: 836
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|