期刊
IEEE ACCESS
卷 7, 期 -, 页码 44391-44403出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2908961
关键词
State transition; simulated annealing algorithm; combinatorial optimization; continuous optimization problem; traveling salesman problem
资金
- National Natural Science Foundation of China [21606159]
- Key Research and Development Program of Shanxi Province [201803D121039]
A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure. When the scale of the problem becomes larger, the convergence rate is slow and it is difficult to reach the global optimal solution. In this paper, seven special intelligent operators are introduced to a SA algorithm, and therefore, a new state transition SA (STASA) algorithm is proposed for combinatorial optimization and continuous optimization problems. The performance of the STASA algorithm is tested on the traveling salesman problem and some continuous function optimization problems. The experimental results show that the proposed algorithm is efficient and reliable.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据