| 引用本文: | 阳春华,唐小林,周晓君,桂卫华.一种求解旅行商问题的离散状态转移算法(英文)[J].控制理论与应用,2013,30(8):1040~1046.[点击复制] |
| YANG Chun-hua,TANG Xiao-lin,ZHOU Xiao-jun,GUI Wei-hua.A discrete state transition algorithm for traveling salesman problem[J].Control Theory and Technology,2013,30(8):1040~1046.[点击复制] |
|
| 一种求解旅行商问题的离散状态转移算法(英文) |
| A discrete state transition algorithm for traveling salesman problem |
| 摘要点击 5241 全文点击 2193 投稿时间：2012-07-14 修订日期：2013-04-02 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 10.7641/CTA.2013.12167 |
| 2013,30(8):1040-1046 |
| 中文关键词 状态转移算法 旅行商问题 参数学习 组合优化 |
| 英文关键词 state transition algorithm traveling salesman problem parametric study combinatorial optimization |
| 基金项目 This work was supported by the the National Science Found for Distinguished Young Scholars of China (No. 61025015), and the China Scholarship Council. |
|
| 中文摘要 |
| 本文提出了一种求解旅行商问题的离散状态转移算法, 设计了交换、平移、对称等3种转移算子, 讨论了算法的收敛性和时间复杂度等问题, 研究了参数对算法的影响. 实验结果表明, 与模拟退火算法及蚁群算法等经典组合优化算法相比, 该算法具有耗时短、寻优能力强等优点, 这也表明了状态转移算法的适应性很好. |
| 英文摘要 |
| 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. |
|
|
|
|
|